Principal component filter banks (PCFB's) sequentially compress most of the input signal energy into the first few subbands, and are mathematically defined using the notion of majorization. In a series of recent works, we have exploited connections between majorization and convexity theory to provide a unified explanation of PCFB optimality for numerous signal processing problems, involving compression, noise suppression and progressive transmission. However PCFB's are known to exist for all input spectra only for three special classes of orthonormal filter banks (FB's): Any class of two channel FB's, the transform coder class and the unconstrained class. This paper uses the developed theory to describe techniques to examine existence of PCFB's. We prove that the classes of DFT and cosine--modulated FB's do not have PCFB's for large families of input spectra. This result is new and quite different from most known facts on nonexistence of PCFB's, which usually involve very specific examples and proofs with numerical optimizations
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.