Quantized Frame Decompositions
Abstract
In this paper, we consider a certain type of decomposition of vectors in frames, in which the coefficients are already quantized and thus are ready for coding. This decomposition is a generalization for vectors of the usual binary expansion of real numbers, and the algorithm for obtaining it can be seen as a quantized version of the matching pursuits algorithm. We show that, in several cases, applying this algorithm is better than first finding the frame coefficients and then quantizing them.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 2000
- Accession Number
- ADP011982
Entities
People
- D. A. Fonini Jr.
- E. A. Da Silva
- M. Craizer
Organizations
- Federal University of Rio de Janeiro