Sökning: "trellis coding"
Visar resultat 1 - 5 av 13 avhandlingar innehållade orden trellis coding.
1. A state-space partitioning approach to trellis decoding
Sammanfattning : .... LÄS MER
2. Trellis Source Coding Methods for Low Rates and Short Blocks
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
3. Joint Source-Channel Coding using Trellis Coded CPM
Sammanfattning : The thesis investigates Joint Source and Channel Coding(JSCC) using combined Trellis Coded Quantization (TCQ) and coded modulation. First we investigate a JSCC scheme using combined TCQ/Trellis Coded CPM (TCQ/TCCPM). Based on the BCJR algorithm for trellis coded CPM, we derive an optimal soft decoding algorithm for the considered systems. LÄS MER
4. On Tailbiting Codes from Convolutional Codes
Sammanfattning : Tailbiting is a method to terminate convolutional codes into block codes. We call these block codes tailbiting codes. This thesis focuses on the encoding of tailbiting codes. The tailbiting method is carefully investigated. LÄS MER
5. Trellis Decoding: From Algorithm to Flexible Architectures
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