TY - JOUR
T1 - On the joint source-channel decoding of variable-length encoded sources
T2 - The additive-Markov case
AU - Subbalakshmi, K. P.
AU - Vaisey, Jacques
PY - 2003/9
Y1 - 2003/9
N2 - 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.
AB - 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.
KW - Bursty channels
KW - Error-resilient communication
KW - Joint source-channel decoding (JSCC)
KW - Maximum a posteriori (MAP) decoding
KW - Variable-length codes
UR - http://www.scopus.com/inward/record.url?scp=0141920380&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0141920380&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2003.816944
DO - 10.1109/TCOMM.2003.816944
M3 - Letter
AN - SCOPUS:0141920380
SN - 0090-6778
VL - 51
SP - 1420
EP - 1425
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 9
ER -