Sökning: "Braided Codes"

Visar resultat 1 - 5 av 6 avhandlingar innehållade orden Braided Codes.

  1. 1. Sparse Codes on Graphs with Convolutional Code Constraints

    Författare :Muhammad Umar Farooq; Kommunikationsteknologi; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Braided codes; Density evolution; Serially concatenated codes; Spatially coupled codes; Generalized LDPC codes; threshold saturation; Turbo codes;

    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. 2. Iteratively Decodable Convolutional Codes: Analysis and Implementation Aspects

    Författare :Alberto Jimenez Feltström; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; systems theory; Informatics; Intersymbol Interference; BPSK; Product Codes; Braided Codes; Low-Density Parity-Check Codes; Convolutional Codes; Iterative Decoding; Informatik; systemteori; Systems engineering; computer technology; Data- och systemvetenskap;

    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. 3. Analysis and Design of Spatially-Coupled Codes with Application to Fiber-Optical Communications

    Författare :Christian Häger; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; bit mapper; generalized product codes; generalized low-density parity-check codes; bounded-distance decoding; density evolution; spatial coupling; staircase codes.; braided codes; Bit-interleaved coded modulation;

    Sammanfattning : 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. LÄS MER

  4. 4. On the Construction and Analysis of Iteratively Decodable Codes

    Författare :Dmitri Truhachev; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Computer science; minimum distance; cycles; asymptotic performance; turbo codes; iterative decoding; low-density parity-check codes; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll;

    Sammanfattning : 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. LÄS MER

  5. 5. Spatially Coupled Turbo-Like Codes

    Författare :Saeedeh Moloudi; Kommunikationsteknologi; []
    Nyckelord :;

    Sammanfattning : 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. LÄS MER