Please use this identifier to cite or link to this item:
|Title:||Concentric Permutation Source Codes|
|Authors:||Nguyen, Ha Q.|
Varshney, Lav R.
Goyal, Vivek K
|Keywords:||Gaussian source;Group codes;Integer partitions;Order statistics;Permutation codes;Rate allocation|
|Publisher:||IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA|
|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 gaindependent wrapped spherical shape codebook.|
|Description:||TNS06117 ; IEEE TRANSACTIONS ON COMMUNICATIONS Volume: 58 Issue: 11 Pages: 3154-3164|
|Appears in Collections:||Bài báo của ĐHQGHN trong Web of Science|
Files in This Item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.