Design and multiplierless implementation of two-channel biorthogonal IIR filter banks with low system delay

An efficient method for the design of low-delay two-channel, perfect reconstruction IIR filter banks is proposed. The design problem is formulated in terms of minimax designs of a general stable IIR filter that can be obtained using semidefinite programming and an FIR filter that can be obtained using the Remez exchange algorithm. A multiplierless implementation on this filter bank is also proposed and investigated.published_or_final_versio

Design and multiplier-less implementation of a class of two-channel PR FIR filterbanks and wavelets with low system delay

In this paper, a new method for designing two-channel PR FIR filterbanks with low system delay is proposed. It is based on the generalization of the structure previously proposed by Phoong et al. Such structurally PR filterbanks are parameterized by two functions (β(z) and α(z)) that can be chosen as linear-phase FIR or allpass functions to construct FIR/IIR filterbanks with good frequency characteristics. The case of using identical β(z) and α(z) was considered by Phoong et al. with the delay parameter M chosen as 2N - 1. In this paper, the more general case of using different nonlinear-phase FIR functions for β(z) and α(z) is studied. As the linear-phase constraint is relaxed, the lengths of β(z) and α(z) are no longer restricted by the delay parameters of the filterbanks. Hence, higher stopband attenuation can still be achieved at low system delay. The design of the proposed low-delay filterbanks is formulated as a complex polynomial approximation problem, which can be solved by the Remez exchange algorithm or analytic formula with very low complexity. In addition, the orders and delay parameters can be estimated from the given filter specifications using a simple empirical formula. Therefore, low-delay two-channel PR filterbanks with flexible stopband attenuation and cutoff frequencies can be designed using existing filter design algorithms. The generalization of the present approach to the design of a class of wavelet bases associated with these low-delay filterbanks and its multiplier-less implementation using the sum of powers-of-two coefficients are also studied.published_or_final_versio

On the design and multiplierless realization of perfect reconstruction triplet-based FIR filter banks and wavelet bases

This paper proposes new methods for the efficient design and realization of perfect reconstruction (PR) two-channel finite-impulse response (FIR) triplet filter banks (FBs) and wavelet bases. It extends the linear-phase FIR triplet FBs of Ansari et al. to include FIR triplet FBs with lower system delay and a prescribed order of K regularity. The design problem using either the minimax error or least-squares criteria is formulated as a semidefinite programming problem, which is a very flexible framework to incorporate linear and convex quadratic constraints. The K regularity conditions are also expressed as a set of linear equality constraints in the variables to be optimized and they are structurally imposed into the design problem by eliminating the redundant variables. The design method is applicable to linear-phase as well as low-delay triplet FBs. Design examples are given to demonstrate the effectiveness of the proposed method. Furthermore, it was found that the analysis and synthesis filters of the triplet FB have a more symmetric frequency responses. This property is exploited to construct a class of PR M-channel uniform FBs and wavelets with M = 2 L, where L is a positive integer, using a particular tree structure. The filter lengths of the two-channel FBs down the tree are approximately reduced by a factor of two at each level or stage, while the transition bandwidths are successively increased by the same factor. Because of the downsampling operations, the frequency responses of the final analysis filters closely resemble those in a uniform FB with identical transition bandwidth. This triplet-based uniform M-channel FB has very low design complexity and the PR condition and K regularity conditions are structurally imposed. Furthermore, it has considerably lower arithmetic complexity and system delay than conventional tree structure using identical FB at all levels. The multiplierless realization of these FBs using sum-of-power-of-two (SOPOT) coefficients and multiplier block is also studied. © 2004 IEEE.published_or_final_versio

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

New design and realization techniques for a class of perfect reconstruction two-channel FIR filterbanks and wavelets bases

This paper proposes two new methods for designing a class of two-channel perfect reconstruction (PR) finite impulse response (FIR) filterbanks (FBs) and wavelets with K-regularity of high order and studies its multiplier-less implementation. It is based on the two-channel structural PR FB proposed by Phoong et al. The basic principle is to represent the K-regularity condition as a set of linear equality constraints in the design variables so that the least square and minimax design problems can be solved, respectively, as a quadratic programming problem with linear equality constraints (QPLC) and a semidefinite programming (SDP) problem. We also demonstrate that it is always possible to realize such FBs with sum-of-powers-of-two (SOPOT) coefficients while preserving the regularity constraints using Bernstein polynomials. However, this implementation usually requires long coefficient wordlength and another direct-form implementation, which can realize multiplier-less wavelets with K-regularity condition up to fifth order, is proposed. Several design examples are given to demonstrate the effectiveness of the proposed methods. © 2004 IEEE.published_or_final_versio

Unified Theory for Biorthogonal Modulated Filter Banks

Modulated filter banks (MFBs) are practical signal decomposition tools for M -channel multirate systems. They combine high subfilter selectivity with efficient realization based on polyphase filters and block transforms. Consequently, the O(M 2 ) burden of computations in a general filter bank (FB) is reduced to O(M log2 M ) - the latter being a complexity order comparable with the FFT-like transforms.Often hiding from the plain sight, these versatile digital signal processing tools have important role in various professional and everyday life applications of information and communications technology, including audiovisual communications and media storage (e.g., audio codecs for low-energy music playback in portable devices, as well as communication waveform processing and channelization). The algorithmic efficiency implies low cost, small size, and extended battery life, bringing the devices close to our skins.The main objective of this thesis is to formulate a generalized and unified approach to the MFBs, which includes, in addition to the deep theoretical background behind these banks, both their design by using appropriate optimization techniques and efficient algorithmic realizations. The FBs discussed in this thesis are discrete-time time-frequency decomposition/reconstruction, or equivalently, analysis-synthesis systems, where the subfilters are generated through modulation from either a single or two prototype filters. The perfect reconstruction (PR) property is a particularly important characteristics of the MFBs and this is the core theme of this thesis. In the presented biorthogonal arbitrary-delay exponentially modulated filter bank (EMFB), the PR property can be maintained also for complex-valued signals.The EMFB concept is quite flexible, since it may respond to the various requirements given to a subband processing system: low-delay PR prototype design, subfilters having symmetric impulse responses, efficient algorithms, and the definition covers odd and even-stacked cosine-modulated FBs as special cases. Oversampling schemes for the subsignals prove out to be advantageous in subband processing problems requiring phase information about the localized frequency components. In addition, the MFBs have strong connections with the lapped transform (LT) theory, especially with the class of LTs grounded in parametric window functions.<br/

Efficiency in audio processing : filter banks and transcoding

Audio transcoding is the conversion of digital audio from one compressed form A to another compressed form B, where A and B have different compression properties, such as a different bit-rate, sampling frequency or compression method. This is typically achieved by decoding A to an intermediate uncompressed form, and then encoding it to B. A significant portion of the involved computational effort pertains to operating the synthesis filter bank, which is an important processing block in the decoding stage, and the analysis filter bank, which is an important processing block in the encoding stage. This thesis presents methods for efficient implementations of filter banks and audio transcoders, and is separated into two main parts. In the first part, a new class of Frequency Response Masking (FRM) filter banks is introduced. These filter banks are usually characterized by comprising a tree-structured cascade of subfilters, which have small individual filter lengths. Methods of complexity reduction are proposed for the scenarios when the filter banks are operated in single-rate mode, and when they are operated in multirate mode; and for the scenarios when the input signal is real-valued, and when it is complex-valued. An efficient variable bandwidth FRM filter bank is designed by using signed-powers-of-two reduction of its subfilter coefficients. Our design has a complexity an order lower than that of an octave filter bank with the same specifications. In the second part, the audio transcoding process is analyzed. Audio transcoding is modeled as a cascaded quantization process, and the cascaded quantization of an input signal is analyzed under different conditions, for the MPEG 1 Layer 2 and MP3 compression methods. One condition is the input-to-output delay of the transcoder, which is known to have an impact on the audio quality of the transcoded material. Methods to reduce the error in a cascaded quantization process are also proposed. An ultra-fast MP3 transcoder that requires only integer operations is proposed and implemented in software. Our implementation shows an improvement by a factor of 5 to 16 over other best known transcoders in terms of execution speed

Digital Filters and Signal Processing

Digital filters, together with signal processing, are being employed in the new technologies and information systems, and are implemented in different areas and applications. Digital filters and signal processing are used with no costs and they can be adapted to different cases with great flexibility and reliability. This book presents advanced developments in digital filters and signal process methods covering different cases studies. They present the main essence of the subject, with the principal approaches to the most recent mathematical models that are being employed worldwide

Multidimensional Wave Digital Filters and Wavelets (Mehrdimensionale Wellendigitalfilter und Wavelets)

Das Kernziel dieser Dissertation ist der Entwurf von orthogonalen, mehrdimensionalen Wellendigitalfiltern für nichtseparierbare Abtastmatritzen (z.B. Quincunx-, Hexagonal-, BCCS-Matrix). Damit der Leser einen einfacheren Einstieg in den Filterentwurf hat, sind einige Grundlagen elektrischer Netzwerke und Filter vom analogen als auch vom digitalen Typ in Kapitel 2 angegeben. Wichtiges Beiwerk, welches digitale Filter mit der Wavelettransformation verknüpft, ist zusammengefaßt. Es wird weiterführende Literatur angegeben, die diesen Stoff ausführlicher behandelt. Weiterhin werden wichtige Abtastsätze präsentiert und ein angegebener Vergleich über die minimale Abtastrate zeigt einen interessanten Aspekt. Kapitel 3 zeigt Verbindungen von Wellendigitalfiltern zu ihren analogen Referenzfiltern. Desweiteren wird gezeigt, wie man eine perfekte Rekonstruktion mit Filterbänken erreicht ohne eine spektrale Faktorisierung durchführen zu müssen. Bekannte Wavelets, wie z.B. Meyer Wavelets, Sinc-Wavelet (Littlewood-Paley Wavelet), Haar Wavelet, Daubechies Wavelets und Butterworth Wavelets, sind in Kapitel 4 präsentiert. Weiterhin werden bekannte Filter gezeigt, die (sofern einige Einschränkungen eingehalten werden) benutzt werden können um neue orthonormale Wavelets, nämlich Cosinus-Rolloff Wavelets und Chebyshev Wavelets zu generieren. Es wird auch ein Filter präsentiert mit welchem eine Verschiebung der Abtastwerte um einen beliebigen reellen Wert effizient erfolgen kann. In den Kapiteln 5, 6 und 7 werden Entwurfsmethoden für mehrdimensionale Filter angegeben mit denen nichtseparierbare, orthogonale Wavelets (zwei- und dreidimensional) erzeugt werden können