On concentric spherical codes and permutation codes with multiple initial codewords
Author(s)
Nguyen, Ha Quy; Goyal, Vivek K.; Varshney, Lav Raj
DownloadNguyen-2009-On concentric spherical codes and permutation codes with multiple initial codewords.pdf (1006.Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure. In this paper, we provide an extension that preserves the computational simplicity but yields improved operational rate-distortion performance. The new class of vector quantizers has a codebook comprising several permutation codes as subcodes. Methods for designing good code parameters are given. One method depends on optimizing the rate allocation in a shape-gain vector quantizer with gain-dependent wrapped spherical shape codebook.
Date issued
2009-08Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of ElectronicsJournal
IEEE International Symposium on Information Theory, 2009. ISIT 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Nguyen, H.Q., V.K. Goyal, and L.R. Varshney. “On concentric spherical codes and permutation codes with multiple initial codewords.” Information Theory, 2009. ISIT 2009. IEEE International Symposium on. 2009. 2038-2042. ©2009 IEEE.
Version: Final published version
Other identifiers
INSPEC Accession Number: 10842414
ISBN
978-1-4244-4312-3