Matrix analysis
Elements of information theory
Elements of information theory
Quantized Oversampled Filter Banks with Erasures
DCC '01 Proceedings of the Data Compression Conference
Real, Tight Frames with Maximal Robustness to Erasures
DCC '05 Proceedings of the Data Compression Conference
Optimal noise reduction in oversampled PR filter banks
IEEE Transactions on Signal Processing
Frame-Theory-Based Analysis and Design of Oversampled Filter Banks: Direct Computational Method
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Efficient reconstruction from frame-based multiple descriptions
IEEE Transactions on Signal Processing - Part II
Frame-theoretic analysis of oversampled filter banks
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Frame-theoretic analysis of DFT codes with erasures
IEEE Transactions on Signal Processing
Bounds on error amplification in oversampled filter banks for robust transmission
IEEE Transactions on Signal Processing
Noise reduction in oversampled filter banks using predictive quantization
IEEE Transactions on Information Theory
Filter bank frame expansions with erasures
IEEE Transactions on Information Theory
Efficient quantization for overcomplete expansions in RN
IEEE Transactions on Information Theory
Resilience properties of redundant expansions under additive noise and quantization
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 35.68 |
This paper presents the theoretic analysis for the robustness of filter bank (FB) frames in infinite dimensional Hilbert spacel2(z) to quantization and erasures as well as studies the design of such robust frames, from the perspective of both frame and FB theory. First, a characterization of the eigenstructure for the frame operator and the induced Gram matrix of general FB frames is presented. The robustness of FB frames to erasures is investigated in detail, especially on the necessary and sufficient condition. Maximally robust frames are further analyzed by explicitly constructive methods. Moreover, the stability and even the possible FIR reconstruction of the subframe by the pseudoinverse are studied thoroughly. Next, we examine the optimal quantized FB frames. Introducing a novel notion named as frame energy, the universal optimality of tight FB frames to quantization is established, in contrast to the optimality of only equal norm tight frames shown in previous works. The added design freedom obtained by removing the equal norm constraint is explained and illustrated with examples. Finally, the effect of erasures on the quantized FB frames is studied by incorporating the probability of erasures, which shows the universal optimality of uniform tight FB frames for one erasure. The optimal FB frame is usually not of equal norm and actually its norm distribution follows the reverse waterfilling principle. An example of two-state erasure channel model is shown to further explain our result, followed by an analysis of the successive reconstruction which shows its potential application to frame-based multiple description coding.