Fast algorithm for pyramid vector quantization

This paper presents an efficient implementation of a pyramid vector quantization coding/decoding algorithm developed by Filip and Ruf (see Proc. IEEE Conf. GLOBECOM, Orlando, FL, USA, p.240-4, 1992), where the original classical calculation of pyramid numbers V/sub L,K/ is replaced by a sliding calc...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2001-04, Vol.8 (4), p.103-105
Main Authors: Mohorko, J., Planinsic, P., Zarko CuCej
Format: Article
Language:English
Subjects:
Acceleration
Algorithms
Audio coding
Coding
Computer simulation
Decoding
Iterative decoding
Lattices
Mathematical analysis
Measurement
Pattern recognition
Performance gain
Performance loss
Pyramids
Signal processing algorithms
Sliding
Vector quantization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an efficient implementation of a pyramid vector quantization coding/decoding algorithm developed by Filip and Ruf (see Proc. IEEE Conf. GLOBECOM, Orlando, FL, USA, p.240-4, 1992), where the original classical calculation of pyramid numbers V/sub L,K/ is replaced by a sliding calculation. The sliding calculation allows movement in any direction of a lattice so that the calculation of V/sub L,K/ in each algorithm iteration can be continued from the previous pyramid number. These properties can, under certain conditions, significantly (up to 25 times) accelerate the coding/decoding process. The condition under which the sliding calculation is more effective than the original one is also presented. The simulation results confirm the expected improvement over the original algorithm.
ISSN:1070-9908
1558-2361
DOI:10.1109/97.911470