Abstract
We propose an optimal joint source-channel maximum a posteriori probability decoder for variable-length encoded sources transmitted over a wireless channel, modeled as an additive-Markov channel. The state space introduced by the authors in a previous paper is used to take care of the unique challenges posed by variable-length codes. Simulations demonstrate that this decoder performs substantially better than the standard Huffman decoder for a simple test source and is robust to inaccuracies in channel statistics estimates. The proposed algorithm also compares favorably to a standard forward error correction-based system.
| Original language | English |
|---|---|
| Pages (from-to) | 1420-1425 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Communications |
| Volume | 51 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 2003 |
Keywords
- Bursty channels
- Error-resilient communication
- Joint source-channel decoding (JSCC)
- Maximum a posteriori (MAP) decoding
- Variable-length codes
Fingerprint
Dive into the research topics of 'On the joint source-channel decoding of variable-length encoded sources: The additive-Markov case'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver