Sökning: "BCJR algorithm"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden BCJR algorithm.

  1. 1. Trellis Decoding: From Algorithm to Flexible Architectures

    Detta är en avhandling från Department of Electroscience, Lund University

    Författare :Matthias Kamuf; [2007]
    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

  2. 2. Synchronization in Turbo Coded Systems

    Detta är en avhandling från Department of Electroscience, Lund University

    Författare :Bartosz Mielczarek; [2000]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; timing offset; Turbo codes; synchronization; maximum a-posteriori estimation; phase offset; BCJR algorithm.; maximum likelihood estimation;

    Sammanfattning : Turbo codes and their unusual properties have attracted significant attentionof the information theory community. There already exist many articlesand papers devoted to the theory of these codes. This thesis, however,focuses on practical implementation issues of turbo codes, with synchronizationproblems as the main topic. LÄS MER

  3. 3. Trellis Source Coding Methods for Low Rates and Short Blocks

    Detta är en avhandling från Department of Information Technology, Lund Univeristy

    Författare :Tomas Eriksson; [2005]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Elektronik och elektroteknik; Electronics and Electrical technology; systemteori; Informatik; systems theory; Informatics; image coding; tailbiting source codes; BCJR algorithm; linear congruential recursions; trellis coding; low rate quantization; rate-distortion theory; Systems engineering; computer technology; Data- och systemvetenskap; Signal processing; Signalbehandling;

    Sammanfattning : Trellis quantization is a finite state machine based method for data compression. It is mainly applied to quantizing noise-like sources. In this thesis new trellis codes suitable for low rate quantization are derived. LÄS MER

  4. 4. Reduced Receivers for Faster-than-Nyquist Signaling and General Linear Channels

    Detta är en avhandling från Tryckeriet i E-huset, Lunds universitet

    Författare :Adnan Prlja; [2013]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Digital data transmission; receivers; decoders; channel modeling; intersymbol interference; ISI; MIMO; Faster-than-Nyquist signaling; complexity reduction; observation models; BCJR algorithm; turbo equalization; iterative detection; channel shortening;

    Sammanfattning : Fast and reliable data transmission together with high bandwidth efficiency are important design aspects in a modern digital communication system. Many different approaches exist but in this thesis bandwidth efficiency is obtained by increasing the data transmission rate with the faster-than-Nyquist (FTN) framework while keeping a fixed power spectral density (PSD). LÄS MER

  5. 5. Turbo Codes and Channel Estimation in Wireless Systems

    Detta är en avhandling från Tryckeriet i E-huset, Lunds universitet

    Författare :Bartosz Mielczarek; [2002]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; adaptive coding; turbo codes; PSAM; timing offset; BCJR algorithm; synchronization; channel estimation; phase offset; Wiener filters; unequal error protection; OFDM;

    Sammanfattning : This thesis focuses on practical implementation issues of turbo codes with imperfectly estimated fading wireless channels and limited code length. Channel estimation can be divided into estimation of static parameters, such as constant timing and phase offset, and dynamic parameters, such as fading channel amplitudes. LÄS MER