Matrix analysis
Multirate systems and filter banks
Multirate systems and filter banks
Wavelets and subband coding
JPEG 2000: Image Compression Fundamentals, Standards and Practice
JPEG 2000: Image Compression Fundamentals, Standards and Practice
On the arbitrary-length M-channel linear phase perfect reconstruction filter banks
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Regularity-constrained pre- and post-filtering for block DCT-based systems
IEEE Transactions on Signal Processing
Lapped unimodular transform and its factorization
IEEE Transactions on Signal Processing
A class of M-channel linear-phase biorthogonal filter banks andtheir applications to subband coding
IEEE Transactions on Signal Processing
On M-channel linear phase FIR filter banks and application in imagecompression
IEEE Transactions on Signal Processing
The GenLOT: generalized linear-phase lapped orthogonal transform
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Symmetric extension methods for M-channel linear-phaseperfect-reconstruction filter banks
IEEE Transactions on Signal Processing
Linear phase cosine modulated maximally decimated filter banks withperfect reconstruction
IEEE Transactions on Signal Processing
Lapped transform via time-domain pre- and post-filtering
IEEE Transactions on Signal Processing
DCT-based general structure for linear-phase paraunitary filterbanks
IEEE Transactions on Signal Processing
Linear phase paraunitary filter banks: theory, factorizations anddesigns
IEEE Transactions on Signal Processing
Theory of regular M-band wavelet bases
IEEE Transactions on Signal Processing
Theory and factorization for a class of structurally regular biorthogonal filter banks
IEEE Transactions on Signal Processing
Hi-index | 0.08 |
The incompleteness of the existing lattice structures has been well established for M-channel FIR linear phase perfect reconstruction filter banks (LPPRFBs) with filter length L2M in the literature, and even the nonexistence of complete order-one lattice has been reported recently. Thus, a question arises naturally as to how large the space spanned by the existing lattice structure is, and about its closeness over some polynomial transformations. The study for such issue can reveal what sense of optimality the lattice based design for LPPRFBs possesses. Inspired from this perspective, this paper firstly studies the closeness of the space spanned by the existing lattice structures under the polynomial transformations for arbitrary equal-length LPPRFBs. We have shown that this space is closed under the popular polynomial transforms widely used in FB design, which establishes the suboptimality of the lattice based design methods for LPPRFBs. Furthermore, the explicit relationship between the lattice parameters before and after transformations has been shown for describing the closeness of the space spanned by those lattice structures.