Sökning: "Turbo-like codes"

Hittade 4 avhandlingar innehållade orden Turbo-like codes.

  1. 1. 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

  2. 2. 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

  3. 3. Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design

    Författare :Mojtaba Mahdavi; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; VLSI Implementation; Hardware architectures; ASIC implementation; FPGA implementation; CMOS Technology; Baseband Processing; Massive MIMO; 5G New Radio; Beyond 5G; Co-Design; FFT processor; OFDM modulation; wireless communications; Massive MIMO Detection; Angular domain processing; Zero forcing; Systolic array; Non-linear detector; Channel Sparsity; Channel compression; Linear detector; Channel coding; Spatial coupling; Turbo-like codes; Spatially coupled serially concatenated codes; Threshold analysis; Decoder architecture; BCJR algorithm; MAP algorithm; Coupling memory; Window decoding; Complexity analysis; Performance Evaluation; Throughput; Decoding Latency; Silicon area; Design tradeoffs; Interleaver architecture; Memory requirements; Matrix multiplication; Channel state information CSI ; Cholesky decomposition; Tanner graph; Trellis codes; Convolutional encoder; Code design; Puncturing; Reordering circuit; wireless communication system; digital electronic;

    Sammanfattning : In recent years the number of connected devices and the demand for high data-rates have been significantly increased. This enormous growth is more pronounced by the introduction of the Internet of things (IoT) in which several devices are interconnected to exchange data for various applications like smart homes and smart cities. LÄS MER

  4. 4. Analysis of Relay Channels and Improved Iterative Decoders for Turbo-Coded Decode-and-Forward Relay Channels

    Författare :Khoa Huynh; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; detect-and-forward; maximum a posteriori; decode-and-forward; Maximum likelihood; iterative decoder.; relay channels; equivalent SNR; upper bound;

    Sammanfattning : Three-node relay channels which consist of a source, a relay and a destinationare considered in this thesis. In the first part, an uncoded relay channelis studied. LÄS MER