Sökning: "LDPC convolutional codes"

Hittade 5 avhandlingar innehållade orden LDPC convolutional codes.

1. 1. Structured LDPC convolutional codes

   Författare :Zhongwei Si; Mikael Skoglund; Ragnar Thobaben; Michael Lentmaier; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; SRA - ICT; SRA - Informations- och kommunikationsteknik;

   Sammanfattning : LDPC convolutional codes, also known as spatially coupled LDPC codes, have attracted considerable attention due to their promising properties. By coupling the protographs from different positions into a chain and terminating the chain properly, the resulting convolutional-like LDPC code ensemble is able to produce capacity-achieving performance in the limit of large parameters. LÄS MER

3. 2. Sparse Codes on Graphs with Convolutional Code Constraints

   Författare :Muhammad Umar Farooq; Kommunikationsteknologi; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Braided codes; Density evolution; Serially concatenated codes; Spatially coupled codes; Generalized LDPC codes; threshold saturation; Turbo codes;

   Sammanfattning : Modern coding theory is based on the foundation of the sparse codes on graphs, such as the low-density parity-check (LDPC) codes, and the turbo-like codes (TCs) with component convolutional codes. The success of the LDPC codes and the TCs lies in their ability to perform low-complexity iterative message passing decoding procedures. LÄS MER

4. 3. Iteratively Decodable Convolutional Codes: Analysis and Implementation Aspects

   Författare :Alberto Jimenez Feltström; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; systems theory; Informatics; Intersymbol Interference; BPSK; Product Codes; Braided Codes; Low-Density Parity-Check Codes; Convolutional Codes; Iterative Decoding; Informatik; systemteori; Systems engineering; computer technology; Data- och systemvetenskap;

   Sammanfattning : This thesis addresses the theory and implementation aspects of iteratively decodable codes. Iteratively decodable codes include, in particular, Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, turbo codes due to Berrou et. al. and expander codes. LÄS MER

5. 4. Codes on Graphs and More

   Författare :Florian Hug; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convolutional codes; woven graph codes; Low-density parity-check LDPC codes; tailbiting codes; bit error probability; MacWilliams Identity;

   Sammanfattning : Modern communication systems strive to achieve reliable and efficient information transmission and storage with affordable complexity. Hence, efficient low-complexity channel codes providing low probabilities for erroneous receptions are needed. LÄS MER

7. 5. Analysis and Design of Spatially-Coupled Codes with Application to Fiber-Optical Communications

   Författare :Christian Häger; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; bit mapper; generalized product codes; generalized low-density parity-check codes; bounded-distance decoding; density evolution; spatial coupling; staircase codes.; braided codes; Bit-interleaved coded modulation;

   Sammanfattning : The theme of this thesis is the analysis and design of error-correcting codes that are suitable for high-speed fiber-optical communication systems. In particular, we consider two code classes. The codes in the first class are protograph-based low-density parity-check (LDPC) codes which are decoded using iterative soft-decision decoding. LÄS MER