DocumentCode :
745897
Title :
Multiple description quantization by deterministic annealing
Author :
Koulgi, Prashant ; Regunathan, Shankar L. ; Rose, Kenneth
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, Santa Barbara, CA, USA
Volume :
49
Issue :
8
fYear :
2003
Firstpage :
2067
Lastpage :
2075
Abstract :
The design of vector quantizers for diversity-based communication over two or more channels of possibly differing capacities and failure probabilities, is considered. The crucial dependence of current design techniques on initialization, especially of index assignment, is well recognized. Instead, we propose to pursue a deterministic annealing approach which is independent of initialization, does not assume any prior knowledge of the source density, and avoids many poor local minima of the cost surface. The approach consists of iterative optimization of a random encoder at gradually decreasing levels of randomness as measured by the Shannon entropy. At the limit of zero entropy, a hard multiple description (MD) quantizer is obtained. This process is directly analogous to annealing processes in statistical physics. Via an alternative derivation, we show that it may also be interpreted as approximating the minimum rate sums among points on the convex hull of the MD achievable rate-distortion region of El Gamal and Cover, subject to constraints on the sizes of the reproduction alphabets. To illustrate the potential of our approach, we present simulation results that show substantial performance gains over existing design techniques.
Keywords :
channel capacity; diversity reception; entropy; rate distortion theory; vector quantisation; Shannon entropy; capacities; deterministic annealing; diversity-based communication; failure probabilities; hard multiple description; iterative optimization; local minima; minimum rate sums; multiple description quantization; random encoder; rate-distortion region; reproduction alphabets; vector quantizers; Algorithm design and analysis; Annealing; Capacity planning; Costs; Entropy; Iterative algorithms; Iterative methods; Materials science and technology; Quantization; Source coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2003.814493
Filename :
1214088
Link To Document :
بازگشت