Jalali, Shirin and Weissman, Tsachy (2010) Multiple Description Coding of Discrete Ergodic Sources. In: 47th Annual Allerton Conference on Communication, Control and Computing. IEEE , pp. 1256-1261. ISBN 978-1-4244-5870-7 http://resolver.caltech.edu/CaltechAUTHORS:20100804-151527757
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20100804-151527757
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.
|Item Type:||Book Section|
|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.|
|Other Numbering System:|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||04 Aug 2010 23:25|
|Last Modified:||26 Dec 2012 12:17|
Repository Staff Only: item control page