Search for dissertations about: "ldpc codes"
Showing result 1 - 5 of 12 swedish dissertations containing the words ldpc codes.
-
1. Sparse Codes on Graphs with Convolutional Code Constraints
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
-
2. Codes on Graphs and More
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
-
3. Early-Decision Decoding of LDPC Codes
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. Structured LDPC convolutional codes
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. Iteratively Decodable Convolutional Codes: Analysis and Implementation Aspects
Abstract : 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. READ MORE