Sökning: "iterative decoding"

Visar resultat 11 - 15 av 47 avhandlingar innehållade orden iterative decoding.

1. 11. Trellis Decoding: From Algorithm to Flexible Architectures

   Författare :Matthias Kamuf; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electronics; Signalbehandling; Signal processing; VLSI; Viterbi algorithm; trellis decoding; TCM; survivor path; flexibility; convolutional codes; ACS; ASIC; Elektronik; Telecommunication engineering; Telekommunikationsteknik;

   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

3. 12. Hybrid ARQ using serially concatenated block codes for real-time communication : an iterative decoding approach

   Författare :Elisabeth Uhlemann; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; serially concenated block codes; ARQ; trellis; iterative detection; real-time;

   Sammanfattning : .... LÄS MER

4. 13. On the Design of Turbo Codes

   Författare :Johan Hokfelt; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Channel coding; concatenated codes; convolutional codes; iterative decoding; interleaver design; trellis termination; Electronics; Turbo codes; Elektronik;

   Sammanfattning : This thesis is about Turbo codes - codes constructed via parallel concatenation of two recursive convolutional encoders linked by an interleaver. The focus of the work is on the understanding and design of Turbo codes. LÄS MER

5. 14. On the Construction and Analysis of Iteratively Decodable Codes

   Författare :Dmitri Truhachev; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Computer science; minimum distance; cycles; asymptotic performance; turbo codes; iterative decoding; low-density parity-check codes; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll;

   Sammanfattning : Iterative decoding methods allow efficient decoding of long codes that are composed of smaller component codes. As a result reliable communication can be achieved with low decoding complexity even for rates close to Shannon capacity. This makes iteratively decodable codes a very attractive object of study in modern coding theory. LÄS MER

7. 15. Some concatenated and iterative decoding approaches for continuous phase modulation

   Författare :Ming Xiao; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; serially concatenated codes; Continuous phase modulation;

   Sammanfattning : Several concatenated and iterative decoding approaches are used toimprove the power efficiency of continuous phase modulation (CPM).First a symbol interleaver is used for serially concatenated CPM(SCCPM). Convergence of iterative decoding for this scheme can beearlier (lower SNR: Signal-to-Noise-Ratio) compared to bitinterleaved SCCPM. LÄS MER