Sökning: "Maximum-Likelihood Decoding"
Visar resultat 6 - 10 av 20 avhandlingar innehållade orden Maximum-Likelihood Decoding.
6. Tales of Tailbiting Codes
Sammanfattning : Tailbiting codes are error correcting codes and can be used in digital transmission systems. They are obtained by terminating convolutional codes into block codes. This thesis consists of an introduction to convolutional and tailbiting codes, and the Papers A--G that include the main results. LÄS MER
7. Trellis Decoding: From Algorithm to Flexible Architectures
Sammanfattning : Trellis decoding is a popular method to recover encoded information corrupted during transmission over a noisy channel. Prominent members of this class of decoding algorithms are the Viterbi algorithm, which provides maximum likelihood estimates, and the BCJR algorithm, which is a maximum a posteriori estimator commonly used in iterative decoding. LÄS MER
8. Towards a Theory of Codes for Iterative Decoding
Sammanfattning : Channel codes in combination with iterative decoding techniques are a both powerful and efficient method to protect data against disturbances in digital communication systems. This thesis deals with various code constructions for block-wise and continuous transmission that have the potential to achieve low bit error rates with iterative decoding, even when operating close to the Shannon limit. LÄS MER
9. Multirate Schemes and Multiuser Decoding in DS/CDMA Systems
Sammanfattning : Direct-Sequence Code Division Multiple-Access (DS/CDMA) has for some yearsbeen considered as a candidate for future personal and mobile communications.The reasons are mainly the properties of universal frequency reuse andthe multi-path mitigation. LÄS MER
10. Iterative decoding of product codes
Sammanfattning : Iterative decoding of block codes is a rather old subjectthat regained much interest recently. The main idea behinditerative decoding is to break up the decoding problem into asequence of stages, iterations, such that each stage utilizesthe output from the previous stages to formulate its ownresult. LÄS MER