Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 41 for “"Maximum likelihood decoding"”.

  1. Maximum likelihood decoding and burst error correction

    A brief discussion of basic encoding and decoding on noisy channels is presented to provide a background for the experimental portion of this research. A portioned 3 state Gilbert model is used to model a burst channel and a method of calculating error-sequence probabilities using this model is …

    nps Repository record for Maximum likelihood decoding and burst error correction (opens in a new tab)

  2. Space-time block codes with low maximum-likelihood decoding complexity

    … designing space-time block codes that have low maximum-likelihood (ML) decoding complexity. We present a unified framework for determining the worst-case ML decoding complexity of space-time block codes. We use this framework to not only determine the worst-case ML decoding complexity of our own …

    gatech Repository record for Space-time block codes with low maximum-likelihood decoding complexity (opens in a new tab)

  3. Interative multistage maximum likelihood decoding algorithm for multilevel codes and its applications

    … and amount of computation needed for successful decoding of these codes may in practice be infeasible. Thus the search for an efficient decoding algorithm is as important as the search for a good code. A good trade-off between the performance, measured by the low error probability, and …

    hawaii Repository record for Interative multistage maximum likelihood decoding algorithm for multilevel codes and its applications (opens in a new tab)

  4. Applications of linear programming to coding theory

    Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the …

    nebraska Repository record for Applications of linear programming to coding theory (opens in a new tab)

  5. A maximum likelihood approach to video error correction applied to H.264 decoding

    … a novel video error correction method based on maximum likelihood decoding. The method estimates the likeliest syntactically valid video slice content based on the erroneous video packets rather than discarding the content, and concealing the missing information. Such content is obtained by …

    ets-quebec Download PDF for A maximum likelihood approach to video error correction applied to H.264 decoding (opens in a new tab)

  6. A PC-Based Simulation for Convolutional Codes Using Viterbi Decoding

    … hardware investment. The optimal approach to decoding convolutional codes is the Maximum-Likelihood method. This method compares the received data sequence to all possible sequences and chooses the sequence that provides the best match. Unfortunately, the number of possible sequences (and the …

    ucf Repository record for A PC-Based Simulation for Convolutional Codes Using Viterbi Decoding (opens in a new tab)

  7. A comparison of four coding methods

    … approximation of the amount of computation for decoding, and Pe is the probability of error. The four schemes considered are: (1) Maximum-likelihood decoding, (2) Convolutional codes with syndrome decoding, (3) BCH codes, (4) Finite state and convolutional codes with sequential decoding. …

    rice Repository record for A comparison of four coding methods (opens in a new tab)

  8. Binary Ldpc Design For Slepian-wolf Coding Of Correlated Information Sources

    … the Dorsch decoder without the implementation of maximum-likelihood decoding. Finally, a framework is established for attaining maximum likelihood decoding and the associated complexity is presented.

    plymouth Repository record for Binary Ldpc Design For Slepian-wolf Coding Of Correlated Information Sources (opens in a new tab)

  9. Improved closed-form bounds on the performance of convolutional codes with correlated Rayleigh fading

    … binary antipodal modulation and soft-decision maximum-likelihood decoding over a correlated Rayleigh-fading channel. The bounds are closed-form expressions in terms of the code's transfer function; they are illustrated by considering a system using convolutional encoding. A long-standing …

    clemson Repository record for Improved closed-form bounds on the performance of convolutional codes with correlated Rayleigh fading (opens in a new tab)

  10. Performance analysis of linear block codes over the queue-based channel

    … focus into two parts. First, we investigate the maximum likelihood decoding of binary linear block codes over the QBC. Since it is well known that for binary symmetric memoryless channels, maximum likelihood decoding reduces to minimum Hamming distance decoding, our objective here is to explore …

    queens Repository record for Performance analysis of linear block codes over the queue-based channel (opens in a new tab)

  11. Soft decision diversity coded DS/DPSK systems in pulse-jammed multipath-fading channels

    … convolutional coding and soft decision Viterbi decoding. Here the performance of the maximum likelihood decoding operation is expressed in terms of an equivalent uncoded system for both the Rayleigh and Rician fading channel with interference effects. Numerical results are then presented …

    nps Repository record for Soft decision diversity coded DS/DPSK systems in pulse-jammed multipath-fading channels (opens in a new tab)

  12. Error -Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs

    … In the first technique, which is based on decoding with a layered graph known as a trellis, we examine generalization of heuristically good codes called lexicodes. We propose and analyze a method for designing generalized lexicodes that minimize or constrain various trellis decoding …

    uiuc Repository record for Error -Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs (opens in a new tab)

  13. FPGA design and implementation of systolic array-based viterbi decoders

    … is known to provide an efficient method for the maximum likelihood decoding of convolutional codes. In this thesis, a design and FPGA implementation of a Viterbi decoder with a constraint length of 9 and code rate of 1/2 is presented. In this design, a novel systolic array architecture with time …

    concordia Download PDF for FPGA design and implementation of systolic array-based viterbi decoders (opens in a new tab)

  14. On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels

    … adding delay to the system. We study optimal maximum likelihood block decoding of binary codes sent over several binary additive channels with infinite and finite memory. We derive conditions on general binary codes and channels parameters under which maximum likelihood and minimum distance …

    queens Repository record for On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels (opens in a new tab)

  15. Convergence Improvement Of Iterative Decoders

    Iterative decoding techniques shaked the waters of the error correction and communications field in general. Their amazing compromise between complexity and performance offered much more freedom in code design and made highly complex codes, that were being considered undecodable until recently, …

    plymouth Repository record for Convergence Improvement Of Iterative Decoders (opens in a new tab)

  16. Subspace Decomposition of Linear Secrecy Codes

    … a metric which relates to an eavesdropper's maximum likelihood decoding performance. We use subspace decomposition to prove theoretical results about certain classes of codes, including a new code construction termed subspace exclusion codes, which are optimal in a number of situations. We …

    byu Repository record for Subspace Decomposition of Linear Secrecy Codes (opens in a new tab) Download PDF for Subspace Decomposition of Linear Secrecy Codes (opens in a new tab)

  17. Improved error control techniques for data transmission

    … and storage of digital data. Many methods for decoding such codes already exist. The choice falls mainly into two areas: hard-decision algebraic decoding, a computationally-efficient method, and soft-decision combinatorial decoding, which although more complex offers better error-correction. …

    lancaster Download file for Improved error control techniques for data transmission (opens in a new tab)

Page 1 of 3