Sökning: "maximum-likelihood decoding algorithm"

Visar resultat 1 - 5 av 8 avhandlingar innehållade orden maximum-likelihood decoding algorithm.

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

  3. 2. Trellis Decoding: From Algorithm to Flexible Architectures

    Författare :Matthias Kamuf; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electronics; Signalbehandling; Signal processing; VLSI; Viterbi algorithm; trellis decoding; TCM; survivor path; flexibility; convolutional codes; ACS; ASIC; Elektronik; Telecommunication engineering; Telekommunikationsteknik;

    Sammanfattning : Trellis decoding is a popular method to recover encoded information corrupted during transmission over a noisy channel. Prominent members of this class of decoding algorithms are the Viterbi algorithm, which provides maximum likelihood estimates, and the BCJR algorithm, which is a maximum a posteriori estimator commonly used in iterative decoding. LÄS MER

  4. 3. Taming of the BEAST

    Författare :Maja Loncar; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Technological sciences; tree search; product codes; list distance; list decoding; list-based SISO decoding; ML decoding; MAP decoding; iterative decoding; ISI equalization; BEAST; block codes; Teknik; Signal processing; Signalbehandling;

    Sammanfattning : Modern communication systems are designed to enable reliable and fast information transfer. Therefore, efficient channel coding and decoding strategies are needed, which guarantee sufficiently low probability of erroneous reception with affordable receiver complexity. 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. Iterative decoding of product codes

    Författare :Omar Al-Askary; KTH; []
    Nyckelord :;

    Sammanfattning : Iterative decoding of block codes is a rather old subjectthat regained much interest recently. The main idea behinditerative decoding is to break up the decoding problem into asequence of stages, iterations, such that each stage utilizesthe output from the previous stages to formulate its ownresult. LÄS MER