Multiple Description Coding of Discrete Ergodic Sources
- Creators
- Jalali, Shirin
- Weissman, Tsachy
Abstract
We investigate the problem of Multiple Description (MD) coding of discrete ergodic processes. We introduce the notion of MD stationary coding, and characterize its relationship to the conventional block MD coding. In stationary coding, in addition to the two rate constraints normally considered in the MD problem, we consider another rate constraint which reflects the conditional entropy of the process generated by the third decoder given the reconstructions of the two other decoders. The relationship that we establish between stationary and block MD coding enables us to devise a universal algorithm for MD coding of discrete ergodic sources, based on simulated annealing ideas that were recently proven useful for the standard rate distortion problem.
Additional Information
© 2009 IEEE. We thank Jun Chen for suggesting the current proof of Theorem 1, in lieu of our original proof which was more complicated.Attached Files
Published - Jalali2009p109252009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf
Files
Name | Size | Download all |
---|---|---|
md5:e818ca764841316ab19d95e565ae8456
|
217.0 kB | Preview Download |
Additional details
- Eprint ID
- 19281
- Resolver ID
- CaltechAUTHORS:20100804-151527757
- Created
-
2010-08-04Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 11135222