Data Compression Conference (DCC '04)
Fast Algorithms for Optimal Two-description Scalar Quantizer Design
Snowbird, Utah
March 23-March 25
ISBN: 0-7695-2082-0
New efficient algorithms are presented to design globally optimal two-description quantizers of fixed rate. The optimization objective is to minimize the expected distortion at the receiver side. We formulate the problem as one of shortest path in a directed acyclic graph. The fixed rate requirement puts constraints on the number and type of edges of the shortest path, which leads to an O(K1K2N3) time design algorithm, where N is the cardinality of the source alphabet, and K1, K2 are the number of codecells, respectively, of the two side quantizers. This complexity is reduced to O(K1K2N2) by exploiting a so-called Monge property of the objective function. Furthermore, if K1 = K2 = K and the two descriptions are subject to the same channel statistics, then the optimal description quantizer design problem can be solved in O(KN2) time.
Citation:
Sorina Dumitrescu, Xiaolin Wu, Gaurav Bahl, "Fast Algorithms for Optimal Two-description Scalar Quantizer Design," dcc, pp.42, Data Compression Conference (DCC '04), 2004