Fleming, Michael and Zhao, Qian and Effros, Michelle (2004) Network vector quantization. IEEE Transactions on Information Theory, 50 (8). pp. 1584-1604. ISSN 0018-9448 http://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit02
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit02
We present an algorithm for designing locally optimal vector quantizers for general networks. We discuss the algorithm's implementation and compare the performance of the resulting "network vector quantizers" to traditional vector quantizers (VQs) and to rate-distortion (R-D) bounds where available. While some special cases of network codes (e.g., multiresolution (MR) and multiple description (MD) codes) have been studied in the literature, we here present a unifying approach that both includes these existing solutions as special cases and provides solutions to previously unsolved examples.
|Additional Information:||© Copyright 2004 IEEE – All Rights Reserved Manuscript received January 22, 2002; revised July 31, 2003. Posted online: 2004-07-26. This material is based upon work supported by the F.W.W. Rhodes Memorial Scholarship, a Redshaw Award, the National Science Foundation under Grant CCR-9909026, the Lee Center for Advanced Networking at Caltech, and the Intel Technology for Education 2000 program. The material in this paper was presented in part at the IEEE Data Compression Conference, Snowbird, UT, 1999, 2000, 2001; the 2000 Conference on Information Sciences and Systems, Princeton, NJ, 2000; and the 33rd Asilomar Conference on Signals, Systems, and Computers, Asilomar, CA, 2000.|
|Subject Keywords:||Broadcast, generalized Lloyd algorithm, multiple access, multiterminal, side information, source coding|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||11 Jan 2006|
|Last Modified:||26 Dec 2012 08:43|
Repository Staff Only: item control page