Trellis quantization of frames

We address the optimization of the quantization of overcomplete frames. The optimization problem is formulated as a quadratic integer programming problem. We develop a suboptimal dynamic programming solution that uses a scalable trellis expansion. The proposed solution offers significant improvement of the quantization error and it can be combined with projection-based quantization, e.g., sigma-delta quantization. The effectiveness of the algorithm is established using harmonic tight frames.