A new class of two-channel biorthogonal filter banks and wavelet bases

We propose a novel framework for a new class of two-channel biorthogonal filter banks. The framework covers two useful subclasses: i) causal stable IIR filter banks. ii) linear phase FIR filter banks. There exists a very efficient structurally perfect reconstruction implementation for such a class. Filter banks of high frequency selectivity can be achieved by using the proposed framework with low complexity. The properties of such a class are discussed in detail. The design of the analysis/synthesis systems reduces to the design of a single transfer function. Very simple design methods are given both for FIR and IIR cases. Zeros of arbitrary multiplicity at aliasing frequency can be easily imposed, for the purpose of generating wavelets with regularity property. In the IIR case, two new classes of IIR maximally flat filters different from Butterworth filters are introduced. The filter coefficients are given in closed form. The wavelet bases corresponding to the biorthogonal systems are generated. the authors also provide a novel mapping of the proposed 1-D framework into 2-D. The mapping preserves the following: i) perfect reconstruction; ii) stability in the IIR case; iii) linear phase in the FIR case; iv) zeros at aliasing frequency; v) frequency characteristic of the filters

Efficient reconstruction of band-limited sequences from nonuniformly decimated versions by use of polyphase filter banks

An efficient polyphase structure for the reconstruction of a band-limited sequence from a nonuniformly decimated version is developed. Theoretically, the reconstruction involves the implementation of a bank of multilevel filters, and it is shown that how all these reconstruction filters can be obtained at the cost of one Mth band low-pass filter and a constant matrix multiplier. The resulting structure is therefore more general than previous schemes. In addition, the method offers a direct means of controlling the overall reconstruction distortion T(z) by appropriate design of a low-pass prototype filter P(z). Extension of these results to multiband band-limited signals and to the case of nonconsecutive nonuniform subsampling are also summarized, along with generalizations to the multidimensional case. Design examples are included to demonstrate the theory, and the complexity of the new method is seen to be much lower than earlier ones

Vector space framework for unification of one- and multidimensional filter bank theory

A number of results in filter bank theory can be viewed using vector space notations. This simplifies the proofs of many important results. In this paper, we first introduce the framework of vector space, and then use this framework to derive some known and some new filter bank results as well. For example, the relation among the Hermitian image property, orthonormality, and the perfect reconstruction (PR) property is well-known for the case of one-dimensional (1-D) analysis/synthesis filter banks. We can prove the same result in a more general vector space setting. This vector space framework has the advantage that even the most general filter banks, namely, multidimensional nonuniform filter banks with rational decimation matrices, become a special case. Many results in 1-D filter bank theory are hence extended to the multidimensional case, with some algebraic manipulations of integer matrices. Some examples are: the equivalence of biorthonormality and the PR property, the interchangeability of analysis and synthesis filters, the connection between analysis/synthesis filter banks and synthesis/analysis transmultiplexers, etc. Furthermore, we obtain the subband convolution scheme by starting from the generalized Parseval's relation in vector space. Several theoretical results of wavelet transform can also be derived using this framework. In particular, we derive the wavelet convolution theorem

The role of integer matrices in multidimensional multirate systems

The basic building blocks in a multidimensional (MD) multirate system are the decimation matrix M and the expansion matrix L. For the D-dimensional case these are D×D nonsingular integer matrices. When these matrices are diagonal, most of the one-dimensional (ID) results can be extended automatically. However, for the nondiagonal case, these extensions are nontrivial. Some of these extensions, e.g., polyphase decomposition and maximally decimated perfect reconstruction systems, have already been successfully made by some authors. However, there exist several ID results in multirate processing, for which the multidimensional extensions are even more difficult. An example is the development of polyphase representation for rational (rather than integer) sampling rate alterations. In the ID case, this development relies on the commutativity of decimators and expanders, which is possible whenever M and L are relatively prime (coprime). The conditions for commutativity in the two-dimensional (2D) case have recently been developed successfully in [1]. In the MD case, the results are more involved. In this paper we formulate and solve a number of problems of this nature. Our discussions are based on several key properties of integer matrices, including greatest common divisors and least common multiples, which we first review. These properties are analogous to those of polynomial matrices, some of which have been used in system theoretic work (e.g., matrix fraction descriptions, coprime matrices, Smith form, and so on)

Linear phase cosine modulated maximally decimated filter banks with perfect reconstruction

We propose a novel way to design maximally decimated FIR cosine modulated filter banks, in which each analysis and synthesis filter has a linear phase. The system can be designed to have either the approximate reconstruction property (pseudo-QMF system) or perfect reconstruction property (PR system). In the PR case, the system is a paraunitary filter bank. As in earlier work on cosine modulated systems, all the analysis filters come from an FIR prototype filter. However, unlike in any of the previous designs, all but two of the analysis filters have a total bandwidth of 2π/M rather than π/M (where 2M is the number of channels in our notation). A simple interpretation is possible in terms of the complex (hypothetical) analytic signal corresponding to each bandpass subband. The coding gain of the new system is comparable with that of a traditional M-channel system (rather than a 2M-channel system). This is primarily because there are typically two bandpass filters with the same passband support. Correspondingly, the cost of the system (in terms of complexity of implementation) is also comparable with that of an M-channel system. We also demonstrate that very good attenuation characteristics can be obtained with the new system

Linear phase paraunitary filter banks: theory, factorizations and designs

M channel maximally decimated filter banks have been used in the past to decompose signals into subbands. The theory of perfect-reconstruction filter banks has also been studied extensively. Nonparaunitary systems with linear phase filters have also been designed. In this paper, we study paraunitary systems in which each individual filter in the analysis synthesis banks has linear phase. Specific instances of this problem have been addressed by other authors, and linear phase paraunitary systems have been shown to exist. This property is often desirable for several applications, particularly in image processing. We begin by answering several theoretical questions pertaining to linear phase paraunitary systems. Next, we develop a minimal factorizdion for a large class of such systems. This factorization will be proved to be complete for even M. Further, we structurally impose the additional condition that the filters satisfy pairwise mirror-image symmetry in the frequency domain. This significantly reduces the number of parameters to be optimized in the design process. We then demonstrate the use of these filter banks in the generation of M-band orthonormal wavelets. Several design examples are also given to validate the theory

On the eigenfilter design method and its applications: a tutorial

The eigenfilter method for digital filter design involves the computation of filter coefficients as the eigenvector of an appropriate Hermitian matrix. Because of its low complexity as compared to other methods as well as its ability to incorporate various time and frequency-domain constraints easily, the eigenfilter method has been found to be very useful. In this paper, we present a review of the eigenfilter design method for a wide variety of filters, including linear-phase finite impulse response (FIR) filters, nonlinear-phase FIR filters, all-pass infinite impulse response (IIR) filters, arbitrary response IIR filters, and multidimensional filters. Also, we focus on applications of the eigenfilter method in multistage filter design, spectral/spacial beamforming, and in the design of channel-shortening equalizers for communications applications