Rozprawy doktorskie: „Error correction coding”

1

Zhang, Wenbo. "Unary error correction coding". Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/419401/.

Pełny tekst źródła

Streszczenie:

In this thesis, we introduce the novel concept of Unary Error Correction (UEC) coding. Our UEC code is a Joint Source and Channel Coding (JSCC) scheme conceived for performing both the compression and error correction of multimedia information during its transmission from an encoder to a decoder. The UEC encoder generates a bit sequence by concatenating and encoding unary codewords, while the decoder operates on the basis of a trellis that has only a modest complexity, even when the source symbol values are selected from a set having an infinite cardinality, such as the set of all positive integers. This trellis is designed so that the transitions between its states are synchronous with the transitions between the consecutive unary codewords in the concatenated bit sequence. This allows the UEC decoder to exploit any residual redundancy that remains following UEC encoding for the purpose of error correction by using the classic Bahl, Cocke, Jelinek and Raviv (BCJR) algorithm. Owing to this, the UEC code is capable of mitigating any potential capacity loss, hence facilitating near-capacity operation, even when the cardinality of the symbol value set is infinite. We investigate the applications, characteristics and performance of the UEC code in the context of digital telecommunications. Firstly, we propose an adaptive UEC design for expediting the decoding process. By concatenating the UEC code with a turbo code, we conceive a three-stage concatenated adaptive iterative decoding technique. A Three-Dimensional (3D) EXtrinsic Information Transfer (EXIT) chart technique is proposed for both controlling the dynamic adaptation of the UEC trellis decoder, as well as for controlling the activation order between the UEC decoder and the turbo decoder. Secondly, we develop an irregular UEC design for ‘nearer-capacity’ operation. The irregular scheme employs different UEC parametrizations for the coding of different subsets of each message frame, operating on the basis of a single irregular trellis having a novel structure. This allows the irregularity to be controlled on a fine-grained bit-by-bit basis, rather than on a symbol-by-symbol basis. Hence, nearer-to-capacity operation is facilitated by exploiting this fine-grained control of the irregularity. Thirdly, we propose a learning-aided UEC design for transmitting symbol values selected from unknown and non-stationary probability distributions. The learning-aided UEC scheme is capable of heuristically inferring the source symbol distribution, hence eliminating the requirement of any prior knowledge of the symbol occurrence probabilities at either the transmitter or the receiver. This is achieved by inferring the source distribution based on the received symbols and by feeding this information back to the decoder. In this way, the quality of the recovered symbols and the estimate of the source distribution can be gradually improved in successive frames, hence allowing reliable near-capacity operation to be achieved, even if the source is unknown and non-stationary. Finally, we demonstrate that the research illustrated in this thesis can be extended in several directions, by highlighting a number of opportunities for future work. The techniques proposed for enhancing the UEC code can be extended to the Rice Error Correction (RiceEC) code, to the Elias Gamma Error Correction (EGEC) code and to the Exponential Golomb Error Correction (ExpGEC) code. In this way, our UEC scheme may be extended to the family of universal error correction codes, which facilitate the nearcapacity transmission of infinite-cardinality symbol alphabets having any arbitrary monotonic probability distribution, as well as providing a wider range of applications. With these benefits, this thesis may contribute to future standards for the reliable near-capacity transmission of multimedia information, having significant technical and economic impact.

Style APA, Harvard, Vancouver, ISO itp.

2

Lundqvist, Henrik. "Error Correction Coding for Optical CDMA". Licentiate thesis, KTH, Microelectronics and Information Technology, IMIT, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1637.

Pełny tekst źródła

Streszczenie:

The optical fiber is a very attractive communication mediumsince it offers a large bandwidth and low attenuation and cantherefore facilitate demanding services such as high-qualityvideo transmission. As the reach of optical fiber is beingextended to the access network it is economically attractive toshare fibers between different users without adding activecomponents in the network. The most common multiple accessmethod for such passive optical networks is time divisionmultiple access (TDMA), but lately there has been an increasedinterest in using wavelength division multiple access (WDMA)and optical code division multiple access (OCDMA). This thesisevaluates forward error correction as a method to improve theperformance of passive optical networks, in particular OCDMAnetworks.

Most studies of OCDMA use simple channel models focusingonly on the multiple access interference. However, beat noiseis the main performance limitation for many implementations ofOCDMA. Beat noise occurs when multiple optical fields areincident on a receiver, because of the square-law detection. Tomake a realistic evaluation of OCDMA, channel models which takeinterference, beat noise and other noise types into account arestudied in this thesis. Both direct sequencing CDMA and fastfrequency hopping are considered as spreading methods. Anefficient simulation method was developed in order to simulatesystems with forward error correction (FEC) and soft decoding.The simulations show that the performance is significantlyoverestimated when the beat noise is neglected. In order todecrease the error rate without using overly complex equipmentthe bandwidth has to be increased. Simulation results show thatit is beneficial to use error correction codes in addition tospreading codes for the bandwidth expansion. The efficiency canbe further improved by using soft decoding; therefore maximumlikelihood decoding methods for the OCDMA channels aredeveloped and demonstrate a significant reduction in the errorrate. Frequency hopping and direct sequencing are also comparedwith each other, and the results show that temporally codedOCDMA is more sensitive to beat noise.

In addition, the performance of a low complexity softdecoding method for Reed-Solomon codes is evaluated. Softdecoding of Reed Solomon codes has not yet found practical usebecause the earlier proposed methods do not offer sufficientperformance gains to motivate the increased complexity. Thebit-level Chase-decoding algorithm evaluated here can be easilyimplemented using any algebraic decoder.

Style APA, Harvard, Vancouver, ISO itp.

3

Cheung, Kar-Ming McEliece Robert J. "Error-correction coding in data storage systems /". Diss., Pasadena, Calif. : California Institute of Technology, 1987. http://resolver.caltech.edu/CaltechETD:etd-02282008-133009.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Klinc, Demijan. "On applications of puncturing in error-correction coding". Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39610.

Pełny tekst źródła

Streszczenie:

This thesis investigates applications of puncturing in error-correction coding and physical layer security with an emphasis on binary and non-binary LDPC codes. Theoretical framework for the analysis of punctured binary LDPC codes at short block lengths is developed and a novel decoding scheme is designed that achieves considerably faster convergence than conventional approaches. Subsequently, optimized puncturing and shortening is studied for non-binary LDPC codes over binary input channels. Framework for the analysis of punctured/shortened non-binary LDPC codes over the BEC channel is developed, which enables the optimization of puncturing and shortening patterns. Insight from this analysis is used to develop algorithms for puncturing and shortening of non-binary LDPC codes at finite block lengths that perform well. It is confirmed that symbol-wise puncturing is generally bad and that bit-wise punctured non-binary LDPC codes can significantly outperform their binary counterparts, thus making them an attractive solution for future communication systems; both for error-correction and distributed compression. Puncturing is also considered in the context of physical layer security. It is shown that puncturing can be used effectively for coding over the wiretap channel to hide the message bits from eavesdroppers. Further, it is shown how puncturing patterns can be optimized for enhanced secrecy. Asymptotic analysis confirms that eavesdroppers are forced to operate at BERs very close to 0.5, even if their signal is only slightly worse than that of the legitimate receivers. The proposed coding scheme is naturally applicable at finite block lengths and allows for efficient, almost-linear time encoding. Finally, it is shown how error-correcting codes can be used to solve an open problem of compressing data encrypted with block ciphers such as AES. Coding schemes for multiple chaining modes are proposed and it is verified that considerable compression gains are attainable for binary sources.

Style APA, Harvard, Vancouver, ISO itp.

5

Kong, Der-Hung. "Simulation of coherent signals with forward error correction coding". Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion.exe/07Mar%5FKong.pdf.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2007.
Thesis Advisor(s): Clark Robertson. "March 2007." Includes bibliographical references (p.47-48). Also available in print.

Style APA, Harvard, Vancouver, ISO itp.

6

Von, Solms Suné. "Exploiting the implicit error correcting ability of networks that use random network coding / by Suné von Solms". Thesis, North-West University, 2009. http://hdl.handle.net/10394/3991.

Pełny tekst źródła

Streszczenie:

In this dissertation, we developed a method that uses the redundant information implicitly generated inside a random network coding network to apply error correction to the transmitted message. The obtained results show that the developed implicit error correcting method can reduce the effect of errors in a random network coding network without the addition of redundant information at the source node. This method presents numerous advantages compared to the documented concatenated error correction methods. We found that various error correction schemes can be implemented without adding redundancy at the source nodes. The decoding ability of this method is dependent on the network characteristics. We found that large networks with a high level of interconnectivity yield more redundant information allowing more advanced error correction schemes to be implemented. Network coding networks are prone to error propagation. We present the results of the effect of link error probability on our scheme and show that our scheme outperforms concatenated error correction schemes for low link error probability.
Thesis (M.Ing. (Computer Engineering))--North-West University, Potchefstroom Campus, 2010.

Style APA, Harvard, Vancouver, ISO itp.

7

Hashmi, Shafiq Ullah. "Efficient forward error correction coding technique for spread spectrum communications". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0021/MQ54317.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

He, Zhongmin. "A generic postprocessing technique for image coding applications". Thesis, University of Portsmouth, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.264852.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Rice, Mark. "Decoding of cyclic block codes". Thesis, University of Manchester, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.330207.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Shen, Bingxin. "Application of Error Correction Codes in Wireless Sensor Networks". Fogler Library, University of Maine, 2007. http://www.library.umaine.edu/theses/pdf/ShenB2007.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Alzubi, Jafar A. "Forward error correction coding and iterative decoding using algebraic geometric theory". Thesis, Swansea University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.582101.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Asghari, Hossein. "Bandwidth-efficient forward-error-correction-coding for long burst noise channels". [Gainesville, Fla.] : University of Florida, 2006. http://purl.fcla.edu/fcla/etd/UFE0012862.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Wang, Xiaohan Sasha. "Investigation of Forward Error Correction Coding Schemes for a Broadcast Communication System". Thesis, University of Canterbury. Computer Science and Software Engineering, 2013. http://hdl.handle.net/10092/7902.

Pełny tekst źródła

Streszczenie:

This thesis investigates four FEC (forward error correction) coding schemes for their suitability for a broadcast system where there is one energy-rich transmitter and many energy-constrained receivers with a variety of channel conditions. The four coding schemes are: repetition codes (the baseline scheme); Reed-Solomon (RS) codes; Luby-Transform (LT) codes; and a type of RS and LT concatenated codes. The schemes were tested in terms of their ability to achieve both high average data reception success probability and short data reception time at the receivers (due to limited energy). The code rate (Rc) is fixed to either 1/2 or 1/3. Two statistical channel models were employed: the memoryless channel and the Gilbert-Elliott channel. The investigation considered only the data-link layer behaviour of the schemes. During the course of the investigation, an improvement to the original LT encoding process was made, the name LTAM (LT codes with Added Memory) was given to this improved coding method. LTAM codes reduce the overhead needed for decoding short-length messages. The improvement can be seen for decoding up to 10000 number of user packets. The maximum overhead reduction is as much as 10% over the original LT codes. The LT-type codes were found to have the property that can both achieve high success data reception performance and flexible switch off time for the receivers. They are also adaptable to different channel characteristics. Therefore it is a prototype of the ideal coding scheme that this project is looking for. This scheme was then further developed by applying an RS code as an inner code to further improve the success probability of packet reception. The results show that LT&RS code has a significant improvement in the channel error tolerance over that of the LT codes without an RS code applied. The trade-off is slightly more reception time needed and more decoding complexity. This LT&RS code is then determined to be the best scheme that fulfils the aim in the context of this project which is to find a coding scheme that both has a high overall data reception probability and short overall data reception time. Comparing the LT&RS code with the baseline repetition code, the improvement is in three aspects. Firstly, the LT&RS code can keep full success rate over channels have approximately two orders of magnitude more errors than the repetition code. This is for the two channel models and two code rates tested. Secondly, the LT&RS code shows an exceptionally good performance under burst error channels. It is able to maintain more than 70% success rate under the long burst error channels where both the repetition code and the RS code have almost zero success probability. Thirdly, while the success rates are improved, the data reception time, measured in terms of number of packets needed to be received at the receiver, of the LT&RS codes can reach a maximum of 58% reduction for Rc = 1=2 and 158% reduction for Rc = 1=3 compared with both the repetition code and the RS code at the worst channel error rate that the LT&RS code maintains almost 100% success probability.

Style APA, Harvard, Vancouver, ISO itp.

14

Al-Agamy, M. A. A. "Time-efficient error correction coding for the Rayleigh fading mobile communications channel". Thesis, University of Kent, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304148.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Chao, Chi-chao McEliece Robert J. McEliece Robert J. "Error-correction coding for reliable communication in the presence of extreme noise /". Diss., Pasadena, Calif. : California Institute of Technology, 1989. http://resolver.caltech.edu/CaltechETD:etd-02012007-093354.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Du, Bing Bing. "ECC video : an active second error control approach for error resilience in video coding". Thesis, Queensland University of Technology, 2003. https://eprints.qut.edu.au/15847/1/Bing_Bing_Du_Thesis.pdf.

Pełny tekst źródła

Streszczenie:

To support video communication over mobile environments has been one of the objectives of many engineers of telecommunication networks and it has become a basic requirement of a third generation of mobile communication systems. This dissertation explores the possibility of optimizing the utilization of shared scarce radio channels for live video transmission over a GSM (Global System for Mobile telecommunications) network and realizing error resilient video communication in unfavorable channel conditions, especially in mobile radio channels. The main contribution describes the adoption of a SEC (Second Error Correction) approach using ECC (Error Correction Coding) based on a Punctured Convolutional Coding scheme, to cope with residual errors at the application layer and enhance the error resilience of a compressed video bitstream. The approach is developed further for improved performance in different circumstances, with some additional enhancements involving Intra Frame Relay and Interleaving, and the combination of the approach with Packetization. Simulation results of applying the various techniques to test video sequences Akiyo and Salesman are presented and analyzed for performance comparisons with conventional video coding standard. The proposed approach shows consistent improvements under these conditions. For instance, to cope with random residual errors, the simulation results show that when the residual BER (Bit Error Rate) reaches 10-4, the video output reconstructed from a video bitstream protected using the standard resynchronization approach is of unacceptable quality, while the proposed scheme can deliver a video output which is absolutely error free in a more efficient way. When the residual BER reaches 10-3, the standard approach fails to deliver a recognizable video output, while the SEC scheme can still correct all the residual errors with modest bit rate increase. In bursty residual error conditions, the proposed scheme also outperforms the resynchronization approach. Future works to extend the scope and applicability of the research are suggested in the last chapter of the thesis.

Style APA, Harvard, Vancouver, ISO itp.

17

Du, Bing Bing. "ECC Video: An Active Second Error Control Approach for Error Resilience in Video Coding". Queensland University of Technology, 2003. http://eprints.qut.edu.au/15847/.

Pełny tekst źródła

Streszczenie:

To support video communication over mobile environments has been one of the objectives of many engineers of telecommunication networks and it has become a basic requirement of a third generation of mobile communication systems. This dissertation explores the possibility of optimizing the utilization of shared scarce radio channels for live video transmission over a GSM (Global System for Mobile telecommunications) network and realizing error resilient video communication in unfavorable channel conditions, especially in mobile radio channels. The main contribution describes the adoption of a SEC (Second Error Correction) approach using ECC (Error Correction Coding) based on a Punctured Convolutional Coding scheme, to cope with residual errors at the application layer and enhance the error resilience of a compressed video bitstream. The approach is developed further for improved performance in different circumstances, with some additional enhancements involving Intra Frame Relay and Interleaving, and the combination of the approach with Packetization. Simulation results of applying the various techniques to test video sequences Akiyo and Salesman are presented and analyzed for performance comparisons with conventional video coding standard. The proposed approach shows consistent improvements under these conditions. For instance, to cope with random residual errors, the simulation results show that when the residual BER (Bit Error Rate) reaches 10-4, the video output reconstructed from a video bitstream protected using the standard resynchronization approach is of unacceptable quality, while the proposed scheme can deliver a video output which is absolutely error free in a more efficient way. When the residual BER reaches 10-3, the standard approach fails to deliver a recognizable video output, while the SEC scheme can still correct all the residual errors with modest bit rate increase. In bursty residual error conditions, the proposed scheme also outperforms the resynchronization approach. Future works to extend the scope and applicability of the research are suggested in the last chapter of the thesis.

Style APA, Harvard, Vancouver, ISO itp.

18

Zhang, Liren. "Recovery of cell loss in ATM networks using forward error correction coding techniques /". Title page, contents and summary only, 1992. http://web4.library.adelaide.edu.au/theses/09PH/09phz6332.pdf.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 1993.
Copies of author's previously published articles inserted. Includes bibliographical references (leaves 179-186).

Style APA, Harvard, Vancouver, ISO itp.

19

Robie, David Lee. "Error Correction and Concealment of Bock Based, Motion-Compensated Temporal Predition, Transform Coded Video". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7101.

Pełny tekst źródła

Streszczenie:

Error Correction and Concealment of Block Based, Motion-Compensated Temporal Prediction, Transform Coded Video David L. Robie 133 Pages Directed by Dr. Russell M. Mersereau The use of the Internet and wireless networks to bring multimedia to the consumer continues to expand. The transmission of these products is always subject to corruption due to errors such as bit errors or lost and ill-timed packets; however, in many cases, such as real time video transmission, retransmission request (ARQ) is not practical. Therefore receivers must be capable of recovering from corrupted data. Errors can be mitigated using forward error correction in the encoder or error concealment techniques in the decoder. This thesis investigates the use of forward error correction (FEC) techniques in the encoder and error concealment in the decoder in block-based, motion-compensated, temporal prediction, transform codecs. It will show improvement over standard FEC applications and improvements in error concealment relative to the Motion Picture Experts Group (MPEG) standard. To this end, this dissertation will describe the following contributions and proofs-of-concept in the area of error concealment and correction in block-based video transmission. A temporal error concealment algorithm which uses motion-compensated macroblocks from previous frames. A spatial error concealment algorithm which uses the Hough transform to detect edges in both foreground and background colors and using directional interpolation or directional filtering to provide improved edge reproduction. A codec which uses data hiding to transmit error correction information. An enhanced codec which builds upon the last by improving the performance of the codec in the error-free environment while maintaining excellent error recovery capabilities. A method to allocate Reed-Solomon (R-S) packet-based forward error correction that will decrease distortion (using a PSNR metric) at the receiver compared to standard FEC techniques. Finally, under the constraints of a constant bit rate, the tradeoff between traditional R-S FEC and alternate forward concealment information (FCI) is evaluated. Each of these developments is compared and contrasted to state of the art techniques and are able to show improvements using widely accepted metrics. The dissertation concludes with a discussion of future work.

Style APA, Harvard, Vancouver, ISO itp.

20

Fagervik, Kjetil. "Iterative decoding of concatenated codes". Thesis, University of Surrey, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268307.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Chan, Morgan Hing Lap. "Channel characterization and forward error correction coding for data communications on intrabuilding electric power lines". Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/29071.

Pełny tekst źródła

Streszczenie:

The use of intrabuilding electric power lines for data communications and local area networking is of growing interest. In this thesis, an original work to study the very important signal propagation and noise characteristics of the complex and hostile power line networks has been completed. Various impairments such as high and varying signal attenuation levels, periodic signal fading and impulse noise were identified. Estimates of the amplitude, pulse width and interarrival distributions of impulse noise were obtained. Communication signal attenuation of power line networks was explored. The effects of electrical loading on these communication channel factors were examined. Implications of the results for intrabuilding communications are addressed. To combat power line impulse noise, channel fading, attenuation and other impairments, forward error correction (FEC) coding and bit interleaving is proposed and shown to be very effective, and is an essential component for reliable communication over power lines. The performance of interleaved hard and soft decision decoding of repetition codes with or without erasure has been analysed, using a simple first order power line noise model. Various random and burst error correcting block codes have been evaluated, using actual recorded bit error patterns encountered on power line data channels. Based on studies of the channel and error correction coding, an actual low cost FEC coded communication system for use on intrabuilding power lines was successfully designed, implemented and tested. Real time performance results of coded and uncoded data transmissions on typical power lines were experimentally determined. Convolutional codes as well as repetition coding and bit interleaving are used to overcome burst errors and other impairments encountered on power line channels. The emphasis is on high speed transmission at bit transmission rates up to 57.6 kbits/s. Typical practical coding gains from 10 to 20 dB were achieved at bit error rate of 10⁻⁴ on various noisy links. It is successfully demonstrated that with appropriate and inexpensive FEC coding, reliable high speed data transmission over power lines is feasible, even at very small interleaving delay.
Applied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate

Style APA, Harvard, Vancouver, ISO itp.

22

Watkins, Yijing Zhang. "Image Compression and Channel Error Correction using Neurally-Inspired Network Models". OpenSIUC, 2018. https://opensiuc.lib.siu.edu/dissertations/1529.

Pełny tekst źródła

Streszczenie:

Everyday an enormous amount of information is stored, processed and transmitted digitally around the world. Neurally-inspired compression models have been rapidly developed and researched as a solution to image processing tasks and channel error correction control. This dissertation presents a deep neural network (DNN) for gray high-resolution image compression and a fault-tolerant transmission system with channel error-correction capabilities. A feed-forward DNN implemented with the Levenberg-Marguardt learning algorithm is proposed and implemented for image compression. I demonstrate experimentally that the DNN not only provides better quality reconstructed images but also requires less computational capacity as compared to DCT Zonal coding, DCT Threshold coding, Set Partitioning in Hierarchical Trees (SPIHT) and Gaussian Pyramid. An artificial neural network (ANN) with improved channel error-correction rate is also proposed. The experimental results indicate that the implemented artificial neural network provides a superior error-correction ability by transmitting binary images over the noisy channel using Hamming and Repeat-Accumulate coding. Meanwhile, the network’s storage requirement is 64 times less than the Hamming coding and 62 times less than the Repeat-Accumulate coding. Thumbnail images contain higher frequencies and much less redundancy, which makes them more difficult to compress compared to high-resolution images. Bottleneck autoencoders have been actively researched as a solution to image compression tasks. However, I observed that thumbnail images compressed at a 2:1 ratio through bottleneck autoencoders often exhibit subjectively low visual quality. In this dissertation, I compared bottleneck autoencoders with two sparse coding approaches. Either 50\% of the pixels are randomly removed or every other pixel is removed, each achieving a 2:1 compression ratio. In the subsequent decompression step, a sparse inference algorithm is used to in-paint the missing the pixel values. Compared to bottleneck autoencoders, I observed that sparse coding with a random dropout mask yields decompressed images that are superior based on subjective human perception yet inferior according to pixel-wise metrics of reconstruction quality, such as PSNR and SSIM. With a regular checkerboard mask, decompressed images were superior as assessed by both subjective and pixel-wise measures. I hypothesized that alternative feature-based measures of reconstruction quality would better support my subjective observations. To test this hypothesis, I fed thumbnail images processed using either bottleneck autoencoder or sparse coding using either checkerboard or random masks into a Deep Convolutional Neural Network (DCNN) classifier. Consistent, with my subjective observations, I discovered that sparse coding with checkerboard and random masks support on average 2.7\% and 1.6\% higher classification accuracy and 18.06\% and 3.74\% lower feature perceptual loss compared to bottleneck autoencoders, implying that sparse coding preserves more feature-based information. The optic nerve transmits visual information to the brain as trains of discrete events, a low-power, low-bandwidth communication channel also exploited by silicon retina cameras. Extracting high-fidelity visual input from retinal event trains is thus a key challenge for both computational neuroscience and neuromorphic engineering. % Here, we investigate whether sparse coding can enable the reconstruction of high-fidelity images and video from retinal event trains. Our approach is analogous to compressive sensing, in which only a random subset of pixels are transmitted and the missing information is estimated via inference. We employed a variant of the Locally Competitive Algorithm to infer sparse representations from retinal event trains, using a dictionary of convolutional features optimized via stochastic gradient descent and trained in an unsupervised manner using a local Hebbian learning rule with momentum. Static images, drawn from the CIFAR10 dataset, were passed to the input layer of an anatomically realistic retinal model and encoded as arrays of output spike trains arising from separate layers of integrate-and-fire neurons representing ON and OFF retinal ganglion cells. The spikes from each model ganglion cell were summed over a 32 msec time window, yielding a noisy rate-coded image. Analogous to how the primary visual cortex is postulated to infer features from noisy spike trains in the optic nerve, we inferred a higher-fidelity sparse reconstruction from the noisy rate-coded image using a convolutional dictionary trained on the original CIFAR10 database. Using a similar approach, we analyzed the asynchronous event trains from a silicon retina camera produced by self-motion through a laboratory environment. By training a dictionary of convolutional spatiotemporal features for simultaneously reconstructing differences of video frames (recorded at 22HZ and 5.56Hz) as well as discrete events generated by the silicon retina (binned at 484Hz and 278Hz), we were able to estimate high frame rate video from a low-power, low-bandwidth silicon retina camera.

Style APA, Harvard, Vancouver, ISO itp.

23

Susanto, Misfa. "Network Coding for Multihop Wireless Networks: Joint Random Linear Network Coding and Forward Error Correction with Interleaving for Multihop Wireless Networks". Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/14864.

Pełny tekst źródła

Streszczenie:

Optimising the throughput performance for wireless networks is one of the challenging tasks in the objectives of communication engineering, since wireless channels are prone to errors due to path losses, random noise, and fading phenomena. The transmission errors will be worse in a multihop scenario due to its accumulative effects. Network Coding (NC) is an elegant technique to improve the throughput performance of a communication network. There is the fact that the bit error rates over one modulation symbol of 16- and higher order- Quadrature Amplitude Modulation (QAM) scheme follow a certain pattern. The Scattered Random Network Coding (SRNC) system was proposed in the literature to exploit the error pattern of 16-QAM by using bit-scattering to improve the throughput of multihop network to which is being applied the Random Linear Network Coding (RLNC). This thesis aims to improve further the SRNC system by using Forward Error Correction (FEC) code; the proposed system is called Joint RLNC and FEC with interleaving. The first proposed system (System-I) uses Convolutional Code (CC) FEC. The performances analysis of System-I with various CC rates of 1/2, 1/3, 1/4, 1/6, and 1/8 was carried out using the developed simulation tools in MATLAB and compared to two benchmark systems: SRNC system (System-II) and RLNC system (System- III). The second proposed system (System-IV) uses Reed-Solomon (RS) FEC code. Performance evaluation of System IV was carried out and compared to three systems; System-I with 1/2 CC rate, System-II, and System-III. All simulations were carried out over three possible channel environments: 1) AWGN channel, 2) a Rayleigh fading channel, and 3) a Rician fading channel, where both fading channels are in series with the AWGN channel. The simulation results show that the proposed system improves the SRNC system. How much improvement gain can be achieved depends on the FEC type used and the channel environment.

Style APA, Harvard, Vancouver, ISO itp.

24

Geoghegan, Mark. "EXTENDING THE RANGE OF PCM/FM USING A MULTISYMBOL DETECTOR AND TURBO CODING". International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/607538.

Pełny tekst źródła

Streszczenie:

International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California
It has been shown that a multi-symbol detector can improve the detection efficiency of PCM/FM by 3 dB when compared to traditional methods without any change to the transmitted waveform. Although this is a significant breakthrough, further improvements are possible with the addition of Forward Error Correction (FEC). Systematic redundancy can be added by encoding the source data prior to the modulation process, thereby allowing channel errors to be corrected using a decoding circuit. Better detection efficiency translates into additional link margin that can be used to extend the operating range, support higher data throughput, or significantly improve the quality of the received data. This paper investigates the detection efficiency that can be achieved using a multisymbol detector and turbo product coding. The results show that this combination can improve the detection performance by nearly 9 dB relative to conventional PCM/FM systems. The increase in link margin is gained at the expense of a small increase in bandwidth and the additional complexity of the encoding and decoding circuitry.

Style APA, Harvard, Vancouver, ISO itp.

25

Waschura, Thomas E. "625 MBIT/SEC BIT ERROR LOCATION ANALYSIS FOR INSTRUMENTATION RECORDING APPLICATIONS". International Foundation for Telemetering, 1998. http://hdl.handle.net/10150/609650.

Pełny tekst źródła

Streszczenie:

International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California
This paper describes techniques for error location analysis used in the design and testing of high-speed instrumentation data recording and communications applications. It focuses on the differences between common bit error rate testing and new error location analysis. Examples of techniques presented include separating bit and burst error components, studying probability of burst occurrences, looking at error free interval occurrence rates as well as auto-correlating error position. Each technique contributes to a better understanding of the underlying error phenomenon and enables higher-quality digital recording and communication. Specific applications in error correction coding emulation, magnetic media error mapping and systematic error interference are discussed.

Style APA, Harvard, Vancouver, ISO itp.

26

Rawat, Sachin. "Implementation of a Forward Error Correction Technique using Convolutional Encoding with Viterbi Decoding". Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1088439298.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Moon, Todd K., i Jacob H. Gunther. "AN INTRODUCTION TO LOW-DENSITY PARITY-CHECK CODES". International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/607470.

Pełny tekst źródła

Streszczenie:

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada
Low-Density Parity-Check (LDPC) codes are powerful codes capable of nearly achieving the Shannon channel capacity. This paper presents a tutorial introduction to LDPC codes, with a detailed description of the decoding algorithm. The algorithm propagates information about bit and check probabilities through a tree obtained from the Tanner graph for the code. This paper may be useful as a supplement in a course on error-control coding or digital communication.

Style APA, Harvard, Vancouver, ISO itp.

28

Biju, S., T. V. Narayana, P. Anguswamy i U. S. Singh. "A Systolic Array Based Reed-Solomon Decoder Realised Using Programmable Logic Devices". International Foundation for Telemetering, 1995. http://hdl.handle.net/10150/611584.

Pełny tekst źródła

Streszczenie:

International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada
This paper describes the development of a Reed-Solomon (RS) Encoder-Decoder which implements the RS segment of the telemetry channel coding scheme recommended by the Consultative Committee on Space Data Systems (CCSDS)[1]. The Euclidean algorithm has been chosen for the decoder implementation, the hardware realization taking a systolic array approach. The fully pipelined decoder runs on a single clock and the operating speed is limited only by the Galois Field (GF) multiplier's delay. The circuit has been synthesised from VHDL descriptions and the hardware is being realised using programmable logic chips. This circuit was simulated for functional operation and found to perform correction of error patterns exactly as predicted by theory.

Style APA, Harvard, Vancouver, ISO itp.

29

Pishro-Nik, Hossein. "Applications of Random Graphs to Design and Analysis of LDPC Codes and Sensor Networks". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7722.

Pełny tekst źródła

Streszczenie:

This thesis investigates a graph and information theoretic approach to design and analysis of low-density parity-check (LDPC) codes and wireless networks. In this work, both LDPC codes and wireless networks are considered as random graphs. This work proposes solutions to important theoretic and practical open problems in LDPC coding, and for the first time introduces a framework for analysis of finite wireless networks. LDPC codes are considered to be one of the best classes of error-correcting codes. In this thesis, several problems in this area are studied. First, an improved decoding algorithm for LDPC codes is introduced. Compared to the standard iterative decoding, the proposed decoding algorithm can result in several orders of magnitude lower bit error rates, while having almost the same complexity. Second, this work presents a variety of bounds on the achievable performance of different LDPC coding scenarios. Third, it studies rate-compatible LDPC codes and provides fundamental properties of these codes. It also shows guidelines for optimal design of rate-compatible codes. Finally, it studies non-uniform and unequal error protection using LDPC codes and explores their applications to data storage systems and communication networks. It presents a new error-control scheme for volume holographic memory (VHM) systems and shows that the new method can increase the storage capacity by more than fifty percent compared to previous schemes. This work also investigates the application of random graphs to the design and analysis of wireless ad hoc and sensor networks. It introduces a framework for analysis of finite wireless networks. Such framework was lacking from the literature. Using the framework, different network properties such as capacity, connectivity, coverage, and routing and security algorithms are studied. Finally, connectivity properties of large-scale sensor networks are investigated. It is shown how unreliability of sensors, link failures, and non-uniform distribution of nodes affect the connectivity of sensor networks.

Style APA, Harvard, Vancouver, ISO itp.

30

Ellis, Robert H. "Long haul communications in the HF spectrum utilizing high speed modems". Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/23289.

Pełny tekst źródła

Streszczenie:

Approved for public release; distribution is unlimited
In the past ten years reliable high-speed satellite systems have pushed slower less reliable communication systems to the bottom of the list for development programs. Concern over reduced budgets, vulnerability of expensive satellite systems, and recent advances in HF technology are creating new interest in upgrading existing HF communication systems. Nondevelopment Items (NDI) are defined as the use of off-the-shelf commercial items instead of costly, time-consuming conventional research and development programs. The Navy Department's current policies are designed to insure the maximum use of NDI to fulfill Navy requirements. The speed of HF systems can be improved using current signaling and modulation techniques, and reliability can be increased by error-correcting codes or error detection used in conjunction with automatic repeat request (ARQ) schemes. Improved HF systems not only provide survivable back-up capability, but increased capacity for present communication needs.
http://archive.org/details/longhaulcommunic00elli
Lieutenant, United States Navy

Style APA, Harvard, Vancouver, ISO itp.

31

Billah, Md Munibun. "Generalization of Signal Point Target Code". DigitalCommons@USU, 2019. https://digitalcommons.usu.edu/etd/7586.

Pełny tekst źródła

Streszczenie:

Detecting and correcting errors occurring in the transmitted data through a channel is a task of great importance in digital communication. In Error Correction Coding (ECC), some redundant data is added with the original data while transmitting. By exploiting the properties of the redundant data, the errors occurring in the data from the transmission can be detected and corrected. In this thesis, a new coding algorithm named Signal Point Target Code has been studied and various properties of the proposed code have been extended. Signal Point Target Code (SPTC) uses a predefined shape within a given signal constellation to generate a parity symbol. In this thesis, the relation between the employed shape and the performance of the proposed code have been studied and an extension of the SPTC are presented. This research presents simulation results to compare the performances of the proposed codes. The results have been simulated using different programming languages, and a comparison between those programming languages is provided. The performance of the codes are analyzed and possible future research areas have been indicated.

Style APA, Harvard, Vancouver, ISO itp.

32

Zhang, Yequn. "Advanced Coding Techniques For Fiber-Optic Communications And Quantum Key Distribution". Diss., The University of Arizona, 2015. http://hdl.handle.net/10150/555940.

Pełny tekst źródła

Streszczenie:

Coding is an essential technology for efficient fiber-optic communications and secure quantum communications. In particular, low-density parity-check (LDPC) coding is favoured due to its strong error correction capability and high-throughput implementation feasibility. In fiber-optic communications, it has been realized that advanced high-order modulation formats and soft-decision forward error correction (FEC) such as LDPC codes are the key technologies for the next-generation high-speed optical communications. Therefore, energy-efficient LDPC coding in combination with advanced modulation formats is an important topic that needs to be studied for fiber-optic communications. In secure quantum communications, large-alphabet quantum key distribution (QKD) is becoming attractive recently due to its potential in improving the efficiency of key exchange. To recover the carried information bits, efficient information reconciliation is desirable, for which the use of LDPC coding is essential. In this dissertation, we first explore different efficient LDPC coding schemes for optical transmission of polarization-division multiplexed quadrature-amplitude modulation (QAM) signals. We show that high energy efficiency can be achieved without incurring extra overhead and complexity. We then study the transmission performance of LDPC-coded turbo equalization for QAM signals in a realistic fiber link as well as that of pragmatic turbo equalizers. Further, leveraging the polarization freedom of light, we expand the signal constellation into a four-dimensional (4D) space and evaluate the performance of LDPC-coded 4D signals in terms of transmission reach. Lastly, we study the security of a proposed weak-coherent-state large-alphabet QKD protocol and investigate the information reconciliation efficiency based on LDPC coding.

Style APA, Harvard, Vancouver, ISO itp.

33

Planjery, Shiva Kumar. "Iterative Decoding Beyond Belief Propagation of Low-Density Parity-Check Codes". Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/305883.

Pełny tekst źródła

Streszczenie:

The recent renaissance of one particular class of error-correcting codes called low-density parity-check (LDPC) codes has revolutionized the area of communications leading to the so-called field of modern coding theory. At the heart of this theory lies the fact that LDPC codes can be efficiently decoded by an iterative inference algorithm known as belief propagation (BP) which operates on a graphical model of a code. With BP decoding, LDPC codes are able to achieve an exceptionally good error-rate performance as they can asymptotically approach Shannon's capacity. However, LDPC codes under BP decoding suffer from the error floor phenomenon, an abrupt degradation in the error-rate performance of the code in the high signal-to-noise ratio region, which prevents the decoder from achieving very low error-rates. It arises mainly due to the sub-optimality of BP decoding on finite-length loopy graphs. Moreover, the effects of finite precision that stem from hardware realizations of BP decoding can further worsen the error floor phenomenon. Over the past few years, the error floor problem has emerged as one of the most important problems in coding theory with applications now requiring very low error rates and faster processing speeds. Further, addressing the error floor problem while taking finite precision into account in the decoder design has remained a challenge. In this dissertation, we introduce a new paradigm for finite precision iterative decoding of LDPC codes over the binary symmetric channel (BSC). These novel decoders, referred to as finite alphabet iterative decoders (FAIDs), are capable of surpassing the BP in the error floor region at a much lower complexity and memory usage than BP without any compromise in decoding latency. The messages propagated by FAIDs are not quantized probabilities or log-likelihoods, and the variable node update functions do not mimic the BP decoder. Rather, the update functions are simple maps designed to ensure a higher guaranteed error correction capability which improves the error floor performance. We provide a methodology for the design of FAIDs on column-weight-three codes. Using this methodology, we design 3-bit precision FAIDs that can surpass the BP (floating-point) in the error floor region on several column-weight-three codes of practical interest. While the proposed FAIDs are able to outperform the BP decoder with low precision, the analysis of FAIDs still proves to be a difficult issue. Furthermore, their achievable guaranteed error correction capability is still far from what is achievable by the optimal maximum-likelihood (ML) decoding. In order to address these two issues, we propose another novel class of decoders called decimation-enhanced FAIDs for LDPC codes. For this class of decoders, the technique of decimation is incorporated into the variable node update function of FAIDs. Decimation, which involves fixing certain bits of the code to a particular value during decoding, can significantly reduce the number of iterations required to correct a fixed number of errors while maintaining the good performance of a FAID, thereby making such decoders more amenable to analysis. We illustrate this for 3-bit precision FAIDs on column-weight-three codes and provide insights into the analysis of such decoders. We also show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. The new adaptive decimation scheme proposed has marginally added complexity but can significantly increase the slope of the error floor in the error-rate performance of a particular FAID. On certain high-rate column-weight-three codes of practical interest, we show that adaptive decimation-enhanced FAIDs can achieve a guaranteed error-correction capability that is close to the theoretical limit achieved by ML decoding.

Style APA, Harvard, Vancouver, ISO itp.

34

Gallo, Martin. "Posouzení vlivu dělícího poměru na pasivní optickou síť". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2016. http://www.nusl.cz/ntk/nusl-242101.

Pełny tekst źródła

Streszczenie:

This thesis deals with the most recent passive optical network standard NG-PON2, describes the sublayer model which includes error correction coding during propagation in optical fibres. Assesses the impact of split ratios using the simulation environment created from defined model and compares various scenarios. Discusses possible sources of errors of simulation model in compare to real deployment.

Style APA, Harvard, Vancouver, ISO itp.

35

Pfennig, Stefan, i Elke Franz. "Comparison of Different Secure Network Coding Paradigms Concerning Transmission Efficiency". Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-145096.

Pełny tekst źródła

Streszczenie:

Preventing the success of active attacks is of essential importance for network coding since even the infiltration of one single corrupted data packet can jam large parts of the network. The existing approaches for network coding schemes preventing such pollution attacks can be divided into two categories: utilize cryptographic approaches or utilize redundancy similar to error correction coding. Within this paper, we compared both paradigms concerning efficiency of data transmission under various circumstances. Particularly, we considered an attacker of a certain strength as well as the influence of the generation size. The results are helpful for selecting a suitable approach for network coding taking into account both security against pollution attacks and efficiency.

Style APA, Harvard, Vancouver, ISO itp.

36

Pfennig, Stefan, i Elke Franz. "Comparison of Different Secure Network Coding Paradigms Concerning Transmission Efficiency". Technische Universität Dresden, 2013. https://tud.qucosa.de/id/qucosa%3A28134.

Pełny tekst źródła

Streszczenie:

Preventing the success of active attacks is of essential importance for network coding since even the infiltration of one single corrupted data packet can jam large parts of the network. The existing approaches for network coding schemes preventing such pollution attacks can be divided into two categories: utilize cryptographic approaches or utilize redundancy similar to error correction coding. Within this paper, we compared both paradigms concerning efficiency of data transmission under various circumstances. Particularly, we considered an attacker of a certain strength as well as the influence of the generation size. The results are helpful for selecting a suitable approach for network coding taking into account both security against pollution attacks and efficiency.

Style APA, Harvard, Vancouver, ISO itp.

37

Wiid, Riaan. "Implementation of a protocol and channel coding strategy for use in ground-satellite applications". Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20346.

Pełny tekst źródła

Streszczenie:

Thesis (MScEng)--Stellenbosch University, 2012.
ENGLISH ABSTRACT: A collaboration between the Katholieke Universiteit van Leuven (KUL) and Stellenbosch University (SU), resulted in the development of a satellite based platform for use in agricultural sensing applications. This will primarily serve as a test platform for a digitally beam-steerable antenna array (SAA) that was developed by KUL. SU developed all flight - and ground station based hardware and software, enabling ground to flight communications and interfacing with the KUL SAA. Although most components had already been completed at the start of this M:Sc:Eng: project, final systems integration was still unfinished. Modules necessary for communication were also outstanding. This project implemented an automatic repeat and request (ARQ) strategy for reliable file transfer across the wireless link. Channel coding has also been implemented on a field programmable gate array (FPGA). This layer includes an advanced forward error correction (FEC) scheme i.e. a low-density parity-check (LDPC), which outperforms traditional FEC techniques. A flexible architecture for channel coding has been designed that allows speed and complexity trade-offs on the FPGA. All components have successfully been implemented, tested and integrated. Simulations of LDPC on the FPGA have been shown to provide excellent error correcting performance. The prototype has been completed and recently successfully demonstrated at KUL. Data has been reliably transferred between the satellite platform and a ground station, during this event.
AFRIKAANSE OPSOMMING: Tydens ’n samewerkingsooreenkoms tussen die Katholieke Universiteit van Leuven (KUL) en die Universiteit van Stellenbosch (US) is ’n satelliet stelsel ontwikkel vir sensor-netwerk toepassings in die landbou bedryf. Hierdie stelsel sal hoofsaaklik dien as ’n toetsmedium vir ’n digitaal stuurbare antenna (SAA) wat deur KUL ontwikkel is. Die US het alle hardeware en sagteware komponente ontwikkel om kommunikasie d.m.v die SAA tussen die satelliet en ’n grondstasie te bewerkstellig. Sedert die begin van hierdie M:Sc:Ing: projek was die meeste komponente alreeds ontwikkel en geïmplementeer, maar finale stelselsintegrasie moes nog voltooi word. Modules wat kommunikasie sou bewerkstellig was ook nog uistaande. Hierdie projek het ’n ARQ protokol geïmplementeer wat data betroubaar tussen die satelliet en ’n grondstasie kon oordra. Kanaalkodering is ook op ’n veld programmeerbare hekskikking (FPGA) geïmplementeer. ’n Gevorderde foutkorrigeringstelsel, naamlik ’n lae digtheids pariteit toetskode (LDPC), wat tradisionele foutkorrigeringstelsels se doeltreffendheid oortref, word op hierdie FPGA geïmplementeer. ’n Kanaalkoderingsargitektuur is ook ontwikkel om die verwerkingspoed van data en die hoeveelheid FPGA logika wat gebruik word, teenoor mekaar op te weeg. Alle komponente is suksesvol geïmplementeer, getoets en geïntegreer met die hele stelsel. Simulasies van LDPC op die FPGA het uistekende foutkorrigeringsresultate gelewer. ’n Werkende prototipe is onlangs voltooi en suksesvol gedemonstreer by KUL. Betroubare data oordrag tussen die satelliet en die grondstasie is tydens hierdie demonstrasie bevestig.

Style APA, Harvard, Vancouver, ISO itp.

38

Křivánek, Vítězslav. "Systémy realizace protichybového kódování". Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-233469.

Pełny tekst źródła

Streszczenie:

Due to growing transmission speed burst-forming errors tend to occur still more frequently not exclusively in data transmission. The presented paper concentrates on the search for alternative burst error correction solutions complementing the existing methods in use. Its objective is an elaboration of a detailed analysis of the issue of convolution codes for error burst correction which can be used in individual anti-error systems and thus an achievement of better results than those attained by mass application of the existing solutions. First the methods implemented to remove or suppress burst errors are briefly characterized. This part is followed by a detailed description of the individual systematic convolution codes by means of mathematical tools which extend the set of possible evaluative criteria of anti-error systems which can be applied while assessing proposals for individual solutions. The acquired code properties are compared with convolution codes as well as with other versions of proposals for message protection against an error burst. The processed convolution codes are subject to testing by means of Matlab mathematical programme simulation in order to validate the correctness of the derived mathematical tools. This is because simulation represents the principal method applied to verify and present an already proposed security process and enables the acquisition of a better overview of the issue at hand. The feasibility of the individual anti-error systems is then confirmed by way of creating a circuit behaviour description in the VHDL language. Its high portability presents a big advantage when drafting individual systems of the actual implementation.

Style APA, Harvard, Vancouver, ISO itp.

39

Demircin, Mehmet Umut. "Robust video streaming over time-varying wireless networks". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24790.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009.
Committee Chair: Yucel Altunbasak; Committee Member: Chuanyi Ji; Committee Member: Ghassan AlRegib; Committee Member: Ozlem Ergun; Committee Member: Russell M. Mersereau.

Style APA, Harvard, Vancouver, ISO itp.

40

Wu, Huahui. "ARMOR - adjusting repair and media scaling with operations research for streaming video". Link to electronic dissertation, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-050406-144021/.

Pełny tekst źródła

Streszczenie:

Dissertation (Ph.D.)--Worcester Polytechnic Institute.
Keywords: Streaming MPEG, User Study, Video Quality, Forward Error Correction, Temporal Scaling, Quality Scaling. Includes bibliographical references (p.186-198).

Style APA, Harvard, Vancouver, ISO itp.

41

Kosek, Peter M. "Error Correcting Codes". The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1417508067.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Cao, Lei. "Error resilient image coding and wireless communications /". free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3052160.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Hwang, Eui-Sik. "Direct detection and coherent optical systems employing error-correcting coding". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA284350.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Engineering Acoustics) Naval Postgraduate School, June 1994.
Thesis advisor(s): Tri T. Ha ; Randy L. Borchardt. "June 1994." Includes bibliographical references. Also available online.

Style APA, Harvard, Vancouver, ISO itp.

44

McEwen, Peter A. "Trellis coding for partial response channels /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9968170.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Akeredolu, P. S. "Some new procedures for generating and decoding error correcting codes". Thesis, De Montfort University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382273.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Fan, Xiaopeng. "Wyner-ziv coding and error control for video communication /". View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20FAN.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Lyle, Suzanne McLean. "Error Correcting Codes and the Human Genome". Digital Commons @ East Tennessee State University, 2010. https://dc.etsu.edu/etd/1689.

Pełny tekst źródła

Streszczenie:

In this work, we study error correcting codes and generalize the concepts with a view toward a novel application in the study of DNA sequences. The author investigates the possibility that an error correcting linear code could be included in the human genome through application and research. The author finds that while it is an accepted hypothesis that it is reasonable that some kind of error correcting code is used in DNA, no one has actually been able to identify one. The author uses the application to illustrate how the subject of coding theory can provide a teaching enrichment activity for undergraduate mathematics.

Style APA, Harvard, Vancouver, ISO itp.

48

Xianming, Zhao, Zhou Tingxian, Zhao Honglin i Lu Qun. "CONVOLUTIONAL CODING FOR HR RADIO TELEMETRY SYSTEM". International Foundation for Telemetering, 1995. http://hdl.handle.net/10150/608418.

Pełny tekst źródła

Streszczenie:

International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada
This paper discusses an error-correcting scheme applied to a telemetry system over HF radio channel. According to the statistical properties of transmission error on HF radio channel, the scheme uses one important diffuse convolutional code, which is threshold decoded and corrects the random or burst errors. The operation of this code is explained, and a new method for word synchronization and bit synchronization is proposed. Coding and decoding, word synchronization, and bit synchronization are all activated by software program so as to greatly improve the flexibleness and applicability of the data transmission system. Test results of error-correcting are given for a variety of bit-error-rate (BER)s on HF radio channel.

Style APA, Harvard, Vancouver, ISO itp.

49

Wilson, Robert P. "Coding performance on the AX. 25 radio packet /". Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-07292009-090546/.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Nenno, Robert B. "An introduction to the theory of nonlinear error-correcting codes /". Online version of thesis, 1987. http://hdl.handle.net/1850/10350.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat „Error correction coding”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych