Search for dissertations about: "Braided Codes"
Showing result 1 - 5 of 6 swedish dissertations containing the words Braided 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. 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
-
3. Analysis and Design of Spatially-Coupled Codes with Application to Fiber-Optical Communications
Abstract : 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. READ MORE
-
4. On the Construction and Analysis of Iteratively Decodable Codes
Abstract : 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. READ MORE
-
5. Spatially Coupled Turbo-Like Codes
Abstract : The focus of this thesis is on proposing and analyzing a powerful class of codes on graphs---with trellis constraints---that can simultaneously approach capacity and achieve very low error floor. In particular, we propose the concept of spatial coupling for turbo-like code (SC-TC) ensembles and investigate the impact of coupling on the performance of these codes. READ MORE