Search for dissertations about: "ldpc"

Showing result 1 - 5 of 14 swedish dissertations containing the word ldpc.

2. 1. Early-Decision Decoding of LDPC Codes

   Author : Anton Blad; Oscar Gustafsson; Erik G. Larsson; Linköpings universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; ECC; LDPC; communication; coding; decoding; low-power; Tanner; iterative algorithms; Electronics; Elektronik;

   Abstract : Since their rediscovery in 1995, low-density parity-check (LDPC) codes have received wide-spread attention as practical capacity-approaching code candidates. It has been shown that the class of codes can perform arbitrarily close to the channel capacity, and LDPC codes are also used or suggested for a number of important current and future communication standards. READ MORE

4. 2. Structured LDPC convolutional codes

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

   Abstract : 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. READ MORE

5. 3. Finite-Length Scaling Laws for Spatially-Coupled LDPC Codes

   Author : Roman Sokolovskii; Chalmers tekniska högskola; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; belief propagation decoding; spatially-coupled LDPC codes; window decoding; codes-on-graphs; finite-length code performance;

   Abstract : This thesis concerns predicting the finite-length error-correcting performance of spatially-coupled low-density parity-check (SC-LDPC) code ensembles over the binary erasure channel. SC-LDPC codes are a very powerful class of codes; their use in practical communication systems, however, requires the system designer to specify a considerable number of code and decoder parameters, all of which affect both the code’s error-correcting capability and the system’s memory, energy, and latency requirements. READ MORE

6. 4. Sparse Codes on Graphs with Convolutional Code Constraints

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

   Abstract : 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. READ MORE

7. 5. Codes on Graphs and More

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

   Abstract : 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. READ MORE