Concentric permutation source codes
Files
Accepted manuscript
Date
2010-11
Authors
Nguyen, Ha Q.
Varshney, Lav R.
Goyal, Vivek K.
Version
Accepted manuscript
OA Version
Citation
Ha Q Nguyen, Lav R Varshney, Vivek K Goyal. 2010. "Concentric Permutation Source Codes." IEEE Transactions on Communications, Volume 58, Issue 11, pp. 3154 - 3164. https://doi.org/10.1109/tcomm.2010.101210.090535
Abstract
Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure based on sorting the scalar components. Using a codebook comprising several permutation codes as subcodes preserves the simplicity of encoding while increasing the number of rate-distortion operating points, improving the convex hull of operating points, and increasing design complexity. We show that when the subcodes are designed with the same composition, optimization of the codebook reduces to a lower-dimensional vector quantizer design within a single cone. Heuristics for reducing design complexity are presented, including an optimization of the rate allocation in a shape-gain vector quantizer with gain-dependent wrapped spherical shape codebook.