Please use this identifier to cite or link to this item:
|Title:||In search of the optimal searching sequence for VQ encoding|
Convergence of numerical methods
|Source:||IEEE transactions on communications, Dec. 1995, v. 43, no. 12, p. 2891-2893.|
|Abstract:||The codeword searching sequence is sometimes very vital to the efficiency of a vector quantization (VQ) encoding algorithm. In this paper, we evaluate some necessary criteria for the derivation of an optimal searching sequence and derive the optimal searching sequence based on such criteria.|
|Rights:||© 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||EE Journal/Magazine Articles|
Files in This Item:
|Optimal searching sequence_95.pdf||271.35 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.