NDLI: Asymptotic bounds on optimal noisy channel quantization via random coding

Content Provider	IEEE Xplore Digital Library
Author	Zeger, K. Manzella, V.
Copyright Year	1963
Abstract	Asymptotically optimal zero-delay vector quantization in the presence of channel noise is studied using random coding techniques. First, an upper bound is derived for the average rth-power distortion of channel optimized k-dimensional vector quantization at transmission rate R on a binary symmetric channel with bit error probability /spl epsiv/. The upper bound asymptotically equals 2/sup -rRg(/spl epsiv/,k,r/). where k/(k +r) [1 - log/sub 2/(l +2/spl radic/(/spl epsiv/(1-/spl epsiv/))] /spl les/g(/spl epsiv/,k,r)/spl les/1) for all /spl epsiv//spl ges/0, lim/sub /spl epsiv//spl rarr/0/g(/spl epsiv/,k,r)=1, and lim/sub k/spl rarr//spl infin//g(/spl epsiv/,k,r)=1. Numerical computations of g(/spl epsiv/,k,r) are also given. This result is analogous to Zador's (1982) asymptotic distortion rate of 2/sup -rR/ for quantization on noiseless channels. Next, using a random coding argument on nonredundant index assignments, a useful upper bound is derived in terms of point density functions, on the minimum mean squared error of high resolution, regular, vector quantizers in the presence of channel noise. The formula provides an accurate approximation to the distortion of a noisy channel quantizer whose codebook is arbitrarily ordered. Finally, it is shown that the minimum mean squared distortion of a regular, noisy channel VQ with a randomized nonredundant index assignment, is, in probability, asymptotically bounded away from zero.<>
Sponsorship	IEEE Information Theory Society
Starting Page	1926
Ending Page	1938
Page Count	13
File Size	1190170
File Format	PDF
ISSN	00189448
Volume Number	40
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-11-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vector quantization Upper bound Density functional theory Source coding Error probability Rate distortion theory Channel coding Memoryless systems Decoding Nearest neighbor searches
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

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

Tradeoff between source and channel coding

Codecell convexity in optimal entropy-constrained vector quantization

New Bounds on the Expected Length of Optimal One-to-One Codes

On the joint source-channel coding error exponent for discrete memoryless systems

Feedback in the Non-Asymptotic Regime

Polar Codes are Optimal for Lossy Source Coding

On Successive Refinement With Causal Side Information at the Decoders

Converse Coding Theorems for Identification via Channels

Distributed Scalar Quantization for Computing: High-Resolution Analysis and Extensions

Asymptotic bounds on optimal noisy channel quantization via random coding

Similar Documents

Tradeoff between source and channel coding

Codecell convexity in optimal entropy-constrained vector quantization

New Bounds on the Expected Length of Optimal One-to-One Codes

On the joint source-channel coding error exponent for discrete memoryless systems

Feedback in the Non-Asymptotic Regime

Polar Codes are Optimal for Lossy Source Coding

On Successive Refinement With Causal Side Information at the Decoders

Converse Coding Theorems for Identification via Channels

Distributed Scalar Quantization for Computing: High-Resolution Analysis and Extensions

Asymptotic bounds on optimal noisy channel quantization via random coding