DocumentCode
3049037
Title
Construction of low complexity regular quantizers for overcomplete expansions in RN
Author
Beferull-Lozano, Baltasar ; Ortega, Antonio
Author_Institution
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
fYear
2001
fDate
2001
Firstpage
193
Lastpage
202
Abstract
We study the construction of structured regular quantizers for overcomplete expansions in RN. Our goal is to design structured quantizers allowing simple reconstruction algorithms with low (memory and computational) complexity and having good performance in terms of accuracy. Most related work to date in quantized redundant expansions has assumed that uniform scalar quantization with the same stepsize was used on the redundant expansion and then has dealt with more complex methods to improve the reconstruction. Instead, we consider the design of scalar quantizers with different stepsizes for each coefficient of an overcomplete expansion in such a way as to produce an equivalent vector quantizer with periodic structure. The periodicity makes it possible to achieve good accuracy using simple reconstruction algorithms from the quantized coefficients of the overcomplete expansion
Keywords
computational complexity; signal reconstruction; vector quantisation; VQ; computational complexity; low complexity regular quantizers; memory complexity; overcomplete expansion; overcomplete expansions; performance; periodic structure; quantized coefficients; quantized redundant expansions; reconstruction algorithms; scalar quantizer design; stepsize; uniform scalar quantization; vector quantizer; Algorithm design and analysis; Computational complexity; Periodic structures; Quantization; Reconstruction algorithms; Systems engineering education; Table lookup; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2001. Proceedings. DCC 2001.
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-7695-1031-0
Type
conf
DOI
10.1109/DCC.2001.917150
Filename
917150
Link To Document