Optimal decoding of entropy coded memoryless sources over binary symmetric channels

K. P. Subbalakshmi, Jacques Vaisey

Research output: Contribution to journalConference articlepeer-review

13 Scopus citations

Abstract

A study was carried out to address the design of an optimal decoder (MAPD), in the maximum a posteriori (MAP) sense, for an entropy coded memoryless source transmitted over a binary symmetric channel (BSC) with channel cross over probability ε. A stream of 40,000 samples of a zero mean, unit variance, Gaussian source, quantized with uniform, N-level quantizers was Huffman encoded and the resulting bit stream was transmitted over a BSC. Experiments were performed for values of N ranging from 128 to 1024 and for four different random error patterns, obtained using a random number generator. The results demonstrate that the MAPD performs better than the HD on an average. A maximum reduction of 2.94% in the bits that are out of synchronization was achieved for the 1024 level quantizer.

Original languageEnglish
Pages (from-to)573
Number of pages1
JournalData Compression Conference Proceedings
StatePublished - 1998
EventProceedings of the 1998 Data Compression Conference, DCC - Snowbird, UT, USA
Duration: 30 Mar 19981 Apr 1998

Fingerprint

Dive into the research topics of 'Optimal decoding of entropy coded memoryless sources over binary symmetric channels'. Together they form a unique fingerprint.

Cite this