Sökning: "BCJR algorithm"
Visar resultat 1 - 5 av 7 avhandlingar innehållade orden BCJR algorithm.
Sammanfattning : In recent years the number of connected devices and the demand for high data-rates have been signiﬁcantly 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
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
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
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
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