Sökning: "codes"
Visar resultat 1 - 5 av 667 avhandlingar innehållade ordet codes.
1. Sparse Codes on Graphs with Convolutional Code Constraints
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
2. Codes on Graphs and More
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
3. Iteratively Decodable Convolutional Codes: Analysis and Implementation Aspects
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
4. On the Design of Turbo Codes
Sammanfattning : This thesis is about Turbo codes - codes constructed via parallel concatenation of two recursive convolutional encoders linked by an interleaver. The focus of the work is on the understanding and design of Turbo codes. LÄS MER
5. Designing Space-Time Codes Using Orthogonal Designs
Sammanfattning : 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. LÄS MER