Abstract
Multiple description coding aims at transmitting two mutually refinable descriptions of a signal on two different communication channels. It is successfully applied to transmission of sound and images on diversity systems or packet-switched networks. We present novel algorithms for the design of multiply descriptive tree-structured vector quantizers with linear encoding complexity that improve on our previously published methods. These algorithms allow for both the rates and distortions constraints in a natural way and are shown to yield quantizers that are competitive with full-search codes in terms of rate-distortion performance. We also present a generalization of the scheme to more than two channels.
Similar content being viewed by others
References
T.M. Cover and J.A. Thomas, Elements of Information Theory. Wiley Series in Telecommunications. NewYork,NY, USA: John Wiley & Sons, 1991.
A.A. El Gamal and T.M. Cover, "Achievable Rates for Multiple Descriptions," IEEE Trans. Inform. Theory, vol. 28, no. 6, 1982, pp. 851-857.
L. Ozarow, "On a Source Coding Problem with Two Channels and Three Receivers," Bell Syst. Tech. J., vol. 59, 1980, pp. 1909-1921.
R. Venkataramani, G. Kramer, and V.K. Goyal, "Successive Re-finement on Trees: A Special Case of a New MD Coding Region," in Proc. IEEE Data Compression Conf., 2001.
V.A. Vaishampayan and J. Domaszewicz, "Design of Entropy-Constrained Multiple Description Scalar Quantizers," IEEE Trans. Inform. Theory, vol. 40, no. 1, 1994, pp. 245-250.
H. Jafarkhani and V. Tarokh, "Multiple Description Trellis Coded Quantization," IEEE Trans. Communications, 1999.
M. Fleming and M. Effros, "Generalized Multiple Description Vector Quantization," in Proc. IEEE Data Compression Conf., 1999.
S.N. Diggavi, N.J.A. Sloane, and V.A. Vaishampayan, "Design of Asymmetric Multiple Description LatticeVector Quantizers," in Proc. IEEE Data Compression Conf., 2000.
H. Everett, "Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources," Operations Research, vol. 11, 1963, pp. 399-417.
Y. Linde, A. Buzo, and R.M. Gray, "An Algorithm for Vector Quantizer Design," IEEE Trans. Communications, vol. COM-28, no. 1, 1980, pp. 84-95.
A. Buzo, A.H. Gray, Jr., R.M. Gray, and J.D. Markel, "Speech Coding Based Upon Vector Quantization," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, no. 5, 1980, pp. 562-574.
P.A. Chou, T. Lookabaugh, and R.M. Gray, "Optimal Pruning with Applications to Tree-Structured Source Coding and Modeling," IEEE Trans. Inform. Theory, vol. 35, no. 2, 1989, pp. 299-315.
E.A. Riskin and R.M. Gray, "AGreedy Tree Growing Algorithm for the Design of Variable Rate Vector Quantizers," IEEE Trans. Signal Processing, vol. 39, no. 11, 1991, p. 2500.
M. Balakrishnan, W.A. Pearlman, and L. Lu, "Variable-Rate Tree-Structured Vector Quantizers," IEEE Trans. Inform. Theory, vol. 41, no. 4, 1995, pp. 917-930.
J. Cardinal, "Design of Tree-Structured Multiple Description Vector Quantizers," in Proc. IEEE Data Compression Conf., 2001, pp. 23-32.
L. Lu and W.A. Pearlman, "Conditional Entropy-Constrained Tree-Structured Vector Quantization with Applications to Sources with Memory," IEEE Trans. Inform. Theory, 1998 (in review).
A. Gersho and R.M. Gray, Signal Compression andVector Quantization. Dordrecht: Kluwer Academics, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cardinal, J. Tree-Structured Multiple Description Coding. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 33, 287–294 (2003). https://doi.org/10.1023/A:1022127930375
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1022127930375