Sökning: "maximum likelihood decoder"

Visar resultat 1 - 5 av 12 avhandlingar innehållade orden maximum likelihood decoder.

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

  3. 2. On Bit-Wise Decoders for Coded Modulation

    Författare :Mikhail Ivanov; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; bit-error probability; L-values; labeling; Gray code; coded modulation; log-likelihood ratio; maximum likelihood decoder; Additive white Gaussian noise; quadrature amplitude modulation.; interleaver; flat fading channel; pairwise error probability;

    Sammanfattning : Coded modulation is a technique that emerged as a response to the growing demand for high data rates. It was devised to achieve high spectral efficiency with high reliability, potentially approaching Shannon’s capacity. The main idea of coded modulation consists in combining error-correcting coding with higher-order modulation. LÄS MER

  4. 3. Maximum likelihood detection for the linear MIMO channel

    Författare :Joakim Jaldén; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signal processing; Signalbehandling;

    Sammanfattning : this thesis the problem of maximum likelihood (ML) detection for the linear multiple-input multiple-output (MIMO) channel is considered. The thesis investigates two algorithms previously proposed in the literature for implementing the ML detector, namely semide nite relaxation and sphere decoding. LÄS MER

  5. 4. Tales of Tailbiting Codes

    Författare :Marc Handlery; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; maximum-likelihood decoding algorithm; minimum distance; active distance; woven convolutional code; tailbiting termination method; convolutional code; tailbiting code; Informatics; systems theory; Informatik; systemteori;

    Sammanfattning : Tailbiting codes are error correcting codes and can be used in digital transmission systems. They are obtained by terminating convolutional codes into block codes. This thesis consists of an introduction to convolutional and tailbiting codes, and the Papers A--G that include the main results. LÄS MER

  7. 5. Towards a Theory of Codes for Iterative Decoding

    Författare :Michael Lentmaier; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; bit error probability; low-density parity-check convolutional code; low-density parity-check code; turbo code; convolutional code; channel coding; iterative decoding; Informatics; systems theory; Informatik; systemteori;

    Sammanfattning : Channel codes in combination with iterative decoding techniques are a both powerful and efficient method to protect data against disturbances in digital communication systems. This thesis deals with various code constructions for block-wise and continuous transmission that have the potential to achieve low bit error rates with iterative decoding, even when operating close to the Shannon limit. LÄS MER