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)

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

Role of anticausal inverses in multirate filter-banks. I. System-theoretic fundamentals

In a maximally decimated filter bank with identical decimation ratios for all channels, the perfect reconstructibility property and the nature of reconstruction filters (causality, stability, FIR property, and so on) depend on the properties of the polyphase matrix. Various properties and capabilities of the filter bank depend on the properties of the polyphase matrix as well as the nature of its inverse. In this paper we undertake a study of the types of inverses and characterize them according to their system theoretic properties (i.e., properties of state-space descriptions, McMillan degree, degree of determinant, and so forth). We find in particular that causal polyphase matrices with anticausal inverses have an important role in filter bank theory. We study their properties both for the FIR and IIR cases. Techniques for implementing anticausal IIR inverses based on state space descriptions are outlined. It is found that causal FIR matrices with anticausal FIR inverses (cafacafi) have a key role in the characterization of FIR filter banks. In a companion paper, these results are applied for the factorization of biorthogonal FIR filter banks, and a generalization of the lapped orthogonal transform called the biorthogonal lapped transform (BOLT) developed

Generic Invertibility of Multidimensional FIR Filter Banks and MIMO Systems

We study the invertibility of M-variate Laurent polynomial N × P matrices. Such matrices represent multidimensional systems in various settings such as filter banks, multiple-input multiple-output systems, and multirate systems. Given an N × P Laurent polynomial matrix H(z1,..., zM) of degree at most k, we want to find a P × N Laurent polynomial left inverse matrix G(z) of H(z) such that G(z)H(z) = I. We provide computable conditions to test the invertibility and propose algorithms to find a particular inverse. The main result of this paper is to prove that H(z) is generically invertible when N −P ≥ M; whereas when N −P < M, then H(z) is generically noninvertible. As a result, we propose an algorithm to find a particular inverse of a Laurent polynomial matrix that is faster than current algorithms known to us

Iterative greedy algorithm for solving the FIR paraunitary approximation problem

In this paper, a method for approximating a multi-input multi-output (MIMO) transfer function by a causal finite-impulse response (FIR) paraunitary (PU) system in a weighted least-squares sense is presented. Using a complete parameterization of FIR PU systems in terms of Householder-like building blocks, an iterative algorithm is proposed that is greedy in the sense that the observed mean-squared error at each iteration is guaranteed to not increase. For certain design problems in which there is a phase-type ambiguity in the desired response, which is formally defined in the paper, a phase feedback modification is proposed in which the phase of the FIR approximant is fed back to the desired response. With this modification in effect, it is shown that the resulting iterative algorithm not only still remains greedy, but also offers a better magnitude-type fit to the desired response. Simulation results show the usefulness and versatility of the proposed algorithm with respect to the design of principal component filter bank (PCFB)-like filter banks and the FIR PU interpolation problem. Concerning the PCFB design problem, it is shown that as the McMillan degree of the FIR PU approximant increases, the resulting filter bank behaves more and more like the infinite-order PCFB, consistent with intuition. In particular, this PCFB-like behavior is shown in terms of filter response shape, multiresolution, coding gain, noise reduction with zeroth-order Wiener filtering in the subbands, and power minimization for discrete multitone (DMT)-type transmultiplexers

Exploiting parallelism within multidimensional multirate digital signal processing systems

The intense requirements for high processing rates of multidimensional Digital Signal Processing systems in practical applications justify the Application Specific Integrated Circuits designs and parallel processing implementations. In this dissertation, we propose novel theories, methodologies and architectures in designing high-performance VLSI implementations for general multidimensional multirate Digital Signal Processing systems by exploiting the parallelism within those applications. To systematically exploit the parallelism within the multidimensional multirate DSP algorithms, we develop novel transformations including (1) nonlinear I/O data space transforms, (2) intercalation transforms, and (3) multidimensional multirate unfolding transforms. These transformations are applied to the algorithms leading to systematic methodologies in high-performance architectural designs. With the novel design methodologies, we develop several architectures with parallel and distributed processing features for implementing multidimensional multirate applications. Experimental results have shown that those architectures are much more efficient in terms of execution time and/or hardware cost compared with existing hardware implementations