Quantization Noise Shaping on Arbitrary Frame Expansions
- 891 Downloads
Quantization noise shaping is commonly used in oversampled A/D and D/A converters with uniform sampling. This paper considers quantization noise shaping for arbitrary finite frame expansions based on generalizing the view of first-order classical oversampled noise shaping as a compensation of the quantization error through projections. Two levels of generalization are developed, one a special case of the other, and two different cost models are proposed to evaluate the quantizer structures. Within our framework, the synthesis frame vectors are assumed given, and the computational complexity is in the initial determination of frame vector ordering, carried out off-line as part of the quantizer design. We consider the extension of the results to infinite shift-invariant frames and consider in particular filtering and oversampled filter banks.
KeywordsInformation Technology Computational Complexity Quantum Information Cost Model Filter Bank
- 1.Daubechies I: Ten Lectures on Wavelets, CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia, Pa, USA; 1992.Google Scholar
- 2.Cvetkovic Z, Vetterli M: Overcomplete expansions and robustness. Proceedings of IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis, June 1996, Paris, France 325–328.Google Scholar
- 8.Boufounos PT, Oppenheim AV: Quantization noise shaping on arbitrary frame expansion. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '05), March 2005, Philadelphia, Pa, USA 4: 205–208.Google Scholar
- 10.Candy JC, Temes GC (Eds): Oversampling Delta-Sigma Data Converters: Theory, Design and Simulation. IEEE Press, New York, NY, USA; 1992.Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.