Avancerad sökning
Visar resultat 1 - 5 av 47 avhandlingar som matchar ovanstående sökkriterier.
1. On Woven Convolutional Codes
Sammanfattning : Concatenation of several conventional convolutional encoders is a both powerful and practical method to obtain encoding schemes that are attractive for use in communication systems where very low error probabilities are needed. This thesis is devoted to woven convolutional codes, a construction where the constituent codes are woven together in a manner that resembles the structure of a fabric. LÄS MER
2. 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
3. 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
4. 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
5. On Tailbiting Codes from Convolutional Codes
Sammanfattning : Tailbiting is a method to terminate convolutional codes into block codes. We call these block codes tailbiting codes. This thesis focuses on the encoding of tailbiting codes. The tailbiting method is carefully investigated. LÄS MER