NDLI: Optimal decoding of entropy coded memoryless sources over binary symmetric channels

Content Provider	IEEE Xplore Digital Library
Author	Subbalakshmi, K.P. Vaisey, J.
Copyright Year	1998
Description	Author affiliation: Dept. of Eng. Sci., Simon Fraser Univ., Burnaby, BC, Canada (Subbalakshmi, K.P.)
Abstract	Summary form only given. Entropy codes (e.g. Huffman codes) are often used to improve the rate-distortion performance of codecs for most sources. However, transmitting entropy coded sources over noisy channels can cause the encoder and decoder to lose synchronization, because the codes tend to be of variable length. Designing optimal decoders to deal with this problem is nontrivial since it is no longer optimal to process the data in fixed-length blocks, as is done with fixed-length codes. This paper deals with 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 /spl epsiv/. The MAP problem is cast in a dynamic programming framework and a Viterbi like implementation of the decoder is presented. At each stage the MAPD performs two operations: the metric-update and the merger-check operations. 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, whenever /spl epsiv/ is comparable to the source probabilities. A maximum reduction of 2.94% in the bits that are out of synchronization, was achieved for the 1024 level quantizer.
File Size	42129
File Format	PDF
ISBN	0818684062
ISSN	10680314
DOI	10.1109/DCC.1998.672315
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-03-30
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Entropy Rate-distortion Codecs Dynamic programming Viterbi algorithm Tail Random number generation High definition video
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimal use of Markov models for DPCM picture transmission over binary symmetric channels

Joint source-channel turbo decoding of entropy coded sources

Rate-Distortion Optimal Video Summary Generation (2003)

Coded QAM using a binary convolutional code

Lossless compression of uniform binary sources with coded side-information

Rate-Distortion Optimal Video Summarization: A Dynamic Programming Solution (2004)

Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels

An Improved Decoding Algorithm for Distributed Video Coding

Soft-Decision Decoding of Fixed-Rate Entropy-Coded Trellis-Coded Quantizer Over a Noisy Channel

Optimal decoding of entropy coded memoryless sources over binary symmetric channels

Similar Documents

Optimal use of Markov models for DPCM picture transmission over binary symmetric channels

Joint source-channel turbo decoding of entropy coded sources

Rate-Distortion Optimal Video Summary Generation (2003)

Coded QAM using a binary convolutional code

Lossless compression of uniform binary sources with coded side-information

Rate-Distortion Optimal Video Summarization: A Dynamic Programming Solution (2004)

Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels

An Improved Decoding Algorithm for Distributed Video Coding

Soft-Decision Decoding of Fixed-Rate Entropy-Coded Trellis-Coded Quantizer Over a Noisy Channel

Optimal decoding of entropy coded memoryless sources over binary symmetric channels