Performance analysis and design criteria for finite-alphabet source-channel codes


Efficient compression of finite-alphabet sources requires variable-length codes (VLCs). However, in the presence of noisy channels, error propagation in the decoding of VLCs severely degrades performance. To address this problem, redundant entropy codes and iterative source-channel decoding have been suggested, but to date, neither performance bounds nor… (More)
DOI: 10.1109/TCOMM.2004.836562


9 Figures and Tables