Role of anticausal inverses in multirate filter-banks. II. The FIR case, factorizations, and biorthogonal lapped transforms

For pt. I see ibid., vol.43, no.5, p.1090, 1990. In part I we studied the system-theoretic properties of discrete time transfer matrices in the context of inversion, and classified them according to the types of inverses they had. In particular, we outlined the role of causal FIR matrices with anticausal FIR inverses (abbreviated cafacafi) in the characterization of FIR perfect reconstruction (PR) filter banks. Essentially all FIR PR filter banks can be characterized by causal FIR polyphase matrices having anticausal FIR inverses. In this paper, we introduce the most general degree-one cafacafi building block, and consider the problem of factorizing cafacafi systems into these building blocks. Factorizability conditions are developed. A special class of cafacafi systems called the biorthogonal lapped transform (BOLT) is developed, and shown to be factorizable. This is a generalization of the well-known lapped orthogonal transform (LOT). Examples of unfactorizable cafacafi systems are also demonstrated. Finally it is shown that any causal FIR matrix with FIR inverse can be written as a product of a factorizable cafacafi system and a unimodular matrix

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

Factorability of lossless time-varying filters and filter banks

We study the factorability of linear time-varying (LTV) lossless filters and filter banks. We give a complete characterization of all, degree-one lossless LTV systems and show that all degree-one lossless systems can be decomposed into a time-dependent unitary matrix followed by a lossless dyadic-based LTV system. The lossless dyadic-based system has several properties that make it useful in the factorization of lossless LTV systems. The traditional lapped orthogonal transform (LOT) is also generalized to the LTV case. We identify two classes of TVLOTs, namely, the invertible inverse lossless (IIL) and noninvertible inverse lossless (NIL) TVLOTs. The minimum number of delays required to implement a TVLOT is shown to be a nondecreasing function of time, and it is a constant if and only if the TVLOT is IIL. We also show that all IIL TVLOTs can be factorized uniquely into the proposed degree-one lossless building block. The factorization is minimal in terms of the delay elements. For NIL TVLOTs, there are factorable and unfactorable examples. Both necessary and sufficient conditions for the factorability of lossless LTV systems are given. We also introduce the concept of strong eternal reachability (SER) and strong eternal observability (SEO) of LTV systems. The SER and SEO of an implementation of LTV systems imply the minimality of the structure. Using these concepts, we are able to show that the cascade structure for a factorable IIL LTV system is minimal. That implies that if a IIL LTV system is factorable in terms of the lossless dyadic-based building blocks, the factorization is minimal in terms of delays as well as the number of building blocks. We also prove the BIBO stability of the LTV normalized IIR lattice

Wavelets and multirate filter banks : theory, structure, design, and applications

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2004.Includes bibliographical references (p. 219-230) and index.Wavelets and filter banks have revolutionized signal processing with their ability to process data at multiple temporal and spatial resolutions. Fundamentally, continuous-time wavelets are governed by discrete-time filter banks with properties such as perfect reconstruction, linear phase and regularity. In this thesis, we study multi-channel filter bank factorization and parameterization strategies, which facilitate designs with specified properties that are enforced by the actual factorization structure. For M-channel filter banks (M =/> 2), we develop a complete factorization, M-channel lifting factorization, using simple ladder-like structures as predictions between channels to provide robust and efficient implementation; perfect reconstruction is structurally enforced, even under finite precision arithmetic and quantization of lifting coefficients. With lifting, optimal low-complexity integer wavelet transforms can thus be designed using a simple and fast algorithm that incorporates prescribed limits on hardware operations for power-constrained environments. As filter bank regularity is important for a variety of reasons, an aspect of particular interest is the structural imposition of regularity onto factorizations based on the dyadic form uvt. We derive the corresponding structural conditions for regularity, for which M-channel lifting factorization provides an essential parameterization. As a result, we are able to design filter banks that are exactly regular and amenable to fast implementations with perfect reconstruction, regardless of the choice of free parameters and possible finite precision effects. Further constraining u = v ensures regular orthogonal filter banks,(cont.) whereas a special dyadic form is developed that guarantees linear phase. We achieve superior coding gains within 0.1% of the optimum, and benchmarks conducted on image compression applications show clear improvements in perceptual and objective performance. We also consider the problem of completing an M-channel filter bank, given only its scaling filter. M-channel lifting factorization can efficiently complete such biorthogonal filter banks. On the other hand, an improved scheme for completing paraunitary filter banks is made possible by a novel order-one factorization which allows greater design flexibility, resulting in improved frequency selectivity and energy compaction over existing state of the art methods. In a dual setting, the technique can be applied to transmultiplexer design to achieve higher-rate data transmissions.by Ying-Jui Chen.Ph.D

Paraunitary Filter Banks over Finite Fields

real and complex fields, unitary and paraunitary (PU) matrices have found many applications in signal processing. There has recently been interest in extending these ideas to the case of finite fields. In this paper, we will study the theory of PU filter banks (FB’s) in GF(y) with y prime. Various properties of unitary and PU matrices in finite fields will be studied. In particular, a number of factorization theorems will be given. We will show that i) all unitary matrices in GF(y) are factorizable in terms of Householder-like matrices and permutation matrices, and ii) the class of first-order PU matrices (the lapped orthogonal transform in finite fields) can always be expressed as a product of degree-one or degree-two building blocks. If Q> 2, we do not need degree-two building blocks. While many properties of PU matrices in finite fields are similar to those of PU matrices in complex field, there are a number of differences. For example, unlike the conventional PU systems, in finite fields, there are PU systems that are unfuctorizable in terms of smaller building blocks. In fact, in the special case of 2 x 2 systems, all PU matrices that are factorizable in terms of degree-one building blocks are diagonal matrices. We will derive results for both the cases of GF(2) and GF(y) with q> 2. Even though they share some similarities, there are many differences between these two cases. I

Multirate digital filters, filter banks, polyphase networks, and applications: a tutorial

Multirate digital filters and filter banks find application in communications, speech processing, image compression, antenna systems, analog voice privacy systems, and in the digital audio industry. During the last several years there has been substantial progress in multirate system research. This includes design of decimation and interpolation filters, analysis/synthesis filter banks (also called quadrature mirror filters, or QMFJ, and the development of new sampling theorems. First, the basic concepts and building blocks in multirate digital signal processing (DSPJ, including the digital polyphase representation, are reviewed. Next, recent progress as reported by several authors in this area is discussed. Several applications are described, including the following: subband coding of waveforms, voice privacy systems, integral and fractional sampling rate conversion (such as in digital audio), digital crossover networks, and multirate coding of narrow-band filter coefficients. The M-band QMF bank is discussed in considerable detail, including an analysis of various errors and imperfections. Recent techniques for perfect signal reconstruction in such systems are reviewed. The connection between QMF banks and other related topics, such as block digital filtering and periodically time-varying systems, based on a pseudo-circulant matrix framework, is covered. Unconventional applications of the polyphase concept are discussed

Wavelets and Subband Coding

First published in 1995, Wavelets and Subband Coding offered a unified view of the exciting field of wavelets and their discrete-time cousins, filter banks, or subband coding. The book developed the theory in both continuous and discrete time, and presented important applications. During the past decade, it filled a useful need in explaining a new view of signal processing based on flexible time-frequency analysis and its applications. Since 2007, the authors now retain the copyright and allow open access to the book