Sökning: "EXIT chart"

Hittade 4 avhandlingar innehållade orden EXIT chart.

  1. 1. Convergence Analysis and Design of Multiple Concatenated Codes

    Författare :Fredrik Brännström; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; extrinsic information transfer EXIT function; convergence analysis; Multiple concatenated codes; code search; scheduling; parameter estimation; iterative decoding; EXIT chart; puncturing;

    Sammanfattning : The objective of this thesis is to develop a methodology for designing efficient multiple concatenated coding schemes, consisting of two or more constituent codes, concatenated in serial or in parallel. Extrinsic information transfer (EXIT) analysis is found to be a suitable and versatile analysis tool for such codes and thus, the design methodology is based almost entirely on this technique. LÄS MER

  3. 2. Iterative receivers with channel estimation for MIMO and multi-user OFDM systems

    Författare :Peter Hammarberg; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Iterative receiver; channel estimation; multi-user detection; OFDM; MIMO; IDMA; complexity; EXIT chart; channel measurements.;

    Sammanfattning : The traffic in wireless networks has been showing an exponential growth over the last decade. In order to meet the demand, and support a continuation of this growth, the scarce radio resources need to be efficiently used. LÄS MER

  4. 3. Analysis and Design of Rateless Codes

    Författare :Iqbal Hussain; Lars Kildehøj Rasmussen; Petar Popovski; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : The invention of turbo codes and the re-discovery of sparse graph codes constitute a milestone in error-correction codes designed for communication and storage systems. Sparse graph codes such as low-density parity-check codes can offer a performance that approaches the previously elusive Shannon capacity with reasonable practical computational complexity. LÄS MER

  5. 4. 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