Search for dissertations about: "block codes"
Showing result 1 - 5 of 50 swedish dissertations containing the words block 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. 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
-
4. Designing Space-Time Codes Using Orthogonal Designs
Abstract : This thesis deals with coding schemes for systems with multiple transmit antennas. The problem of finding optimal transmission schemes for the case when the transmitter knows the channel and the case when the transmitter does not know the channel are considered. READ MORE
-
5. 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