NDLI: Near Optimality of Composite Multiple Description Source Codes

Content Provider	IEEE Xplore Digital Library
Author	Hanying Feng Effros, M.
Copyright Year	1963
Abstract	In this paper, new upper and lower bounds are first presented for the rate loss of multiple description source codes (MDSCs). For a two-description MDSC (2DSC), the rate loss of description i with distortion Di is defined as Li=Ri-R(Di), i ∈ {1,2}, where Ri is the rate of the ith description and R(D) is the rate-distortion function for the given source; the joint rate loss associated with decoding the two descriptions together to achieve central distortion D₀ is measured as L₀=R₁+R₂-R(D₀). Consider an arbitrary memoryless source with variance σ² and let the distortion measure be the mean squared error distortion measure. It is shown that for any optimal 2DSC, (a)0 ≤ L₀ ≤ 0.8802 and 0 ≤ L₁,L₂ ≤ 0.3802 if D₀ ≤ D₁+D₂-σ² ; (b) 0 ≤ L₁, L₂ ≤ 0.4401 if D₀ ≥ (1/D₁+1/D₂-1/σ²)^-1; (c) 0 ≤ L₁,L₂ ≤ 0.3802 and R(max{D₁,D₂})-1 ≤ L₀ ≤ R(max{D₁,D₂})+0.3802 for all other D₀ . A tighter bound on the distance between the El Gamal-Cover inner bound and the achievable region is also presented. Inspired by these new bounds, a low-complexity composite 2DSC design first developed by Lastras-Montaño and Castelli is extended and the resulting code is shown to be near-optimal for all memoryless sources and all distortions. These results are also extended to MDSCs with an arbitrary number of packets. Finally, Gaussian sources are analyzed in detail to verify these bounds and examine their tightness.
Sponsorship	IEEE Information Theory Society
Starting Page	3783
Ending Page	3795
Page Count	13
File Size	490826
File Format	PDF
ISSN	00189448
Volume Number	57
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-06-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	Markov processes Decoding Rate-distortion Distortion measurement Joints Random variables Upper bound successively refinable sources Balanced multiple description source code ECDQ lossy source coding Shannon bound
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

On the rate loss of multiple description source codes

On the Rate Loss of Multiple Sources Codes in the Wyner–Ziv Setting

Gaussian codes and Shannon bounds for multiple descriptions

The Lossy Common Information of Correlated Sources

Multiple description source coding with excess rate

LDGM-Based Multiple Description Coding for Finite Alphabet Sources

On common information and the encoding of sources that are not successively refinable

On the Role of Feedforward in Gaussian Sources: Point-to-Point Source Coding and Multiple Description Source Coding

Output Constrained Lossy Source Coding With Limited Common Randomness

Near Optimality of Composite Multiple Description Source Codes

Similar Documents

On the rate loss of multiple description source codes

On the Rate Loss of Multiple Sources Codes in the Wyner–Ziv Setting

Gaussian codes and Shannon bounds for multiple descriptions

The Lossy Common Information of Correlated Sources

Multiple description source coding with excess rate

LDGM-Based Multiple Description Coding for Finite Alphabet Sources

On common information and the encoding of sources that are not successively refinable

On the Role of Feedforward in Gaussian Sources: Point-to-Point Source Coding and Multiple Description Source Coding

Output Constrained Lossy Source Coding With Limited Common Randomness

Near Optimality of Composite Multiple Description Source Codes