The use of quantized redundant expansions is useful in applications where the cost of having oversampling in the representation is much lower than the use of a high resolution quantization (e.g. oversampled A/D). Most work to date has assumed that simple uniform quantization was used on the redundant expansion and then has dealt with methods to improve the reconstruction. Instead, in this paper we consider the design of quantizers for overcomplete expansions. Our goal is to design quantizers such that simple reconstruction algorithms (e.g. linear) provide as good reconstructions as with more complex algorithms. We achieve this goal by designing quantizers with different stepsizes for each coefficient of the expansion in such a way as to produce a quantizer with periodic structure.
[1]
I. Daubechies.
Ten Lectures on Wavelets
,
1992
.
[2]
N. Sloane,et al.
On the Existence of Similar Sublattices
,
1999,
Canadian Journal of Mathematics.
[3]
N. T. Thao,et al.
QUANTIZED OVER COMPLETE EXPANSIONS IN RN: ANALYSIS
,
1998
.
[4]
Vivek K. Goyal,et al.
Quantized Overcomplete Expansions in IRN: Analysis, Synthesis, and Algorithms
,
1998,
IEEE Trans. Inf. Theory.
[5]
Martin Vetterli,et al.
Reduction of the MSE in R-times oversampled A/D conversion O(1/R) to O(1/R2)
,
1994,
IEEE Trans. Signal Process..