Constructions for Variable-Length Error-Correcting Codes
Proceedings of the 5th IMA Conference on Cryptography and Coding
Utilizing Soft Information in Decoding of Variable Length Codes
DCC '99 Proceedings of the Conference on Data Compression
DCC '99 Proceedings of the Conference on Data Compression
Joint Source/Channel Coding for Variable Length Codes
DCC '98 Proceedings of the Conference on Data Compression
A Method for the Correction of Garbled Words Based on the Levenshtein Metric
IEEE Transactions on Computers
On Variable Length Codes for Iterative Source/Channel Decoding
DCC '01 Proceedings of the Data Compression Conference
Stochastic channel-adaptive rate control for wireless video transmission
Pattern Recognition Letters - Video computing
Joint source-channel decoding of variable-length codes with soft information: a survey
EURASIP Journal on Applied Signal Processing
Iterative list decoding of concatenated source-channel codes
EURASIP Journal on Applied Signal Processing
Progressive and error-resilient transmission strategies for VLC encoded signals over noisy channels
EURASIP Journal on Applied Signal Processing
Joint source and channel decoding for variable length encoded turbo codes
EURASIP Journal on Advances in Signal Processing
IEEE Transactions on Communications
Variable length codes with unequal error protection for wireless communication systems
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
| Hi-index | 0.00 |
In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of variable length codes (VLC). A bit-level soft-input/soft-output module is derived and is applied in an iterative decoding structure consisting of an outer variable length code and an inner convolutional code. Due to their inherent redundancy reversible variable length codes (RVLC) yield good results with this system.We present simulation results in terms of symbol error rate performance when the data is transmitted over a fully interleaved Rayleigh fading channel using BPSK modulation. As measure for the symbol error rate the Levenshtein distance is used which regards the self-synchronizing properties of variable length codes better than a simple symbol-by-symbol comparison.