Similar documents
Citation Ieee Signal Processing Letters, 2001, v. 8 n. 6, p

Low-delay perfect reconstruction two-channel FIR/IIR filter banks and wavelet bases with SOPOT coefficients

Proceedings - Ieee International Symposium On Circuits And Systems, 2001, v. 2, p. II13-II16

Filter Banks with Variable System Delay. Georgia Institute of Technology. Atlanta, GA Abstract

Design of Biorthogonal FIR Linear Phase Filter Banks with Structurally Perfect Reconstruction

Lapped Unimodular Transform and Its Factorization

A Width-Recursive Depth-First Tree Search Approach for the Design of Discrete Coefficient Perfect Reconstruction Lattice Filter Bank

Basic Multi-rate Operations: Decimation and Interpolation

Phase Factor Influence on Amplitude Distortion and Aliasing of Pseudo-QMF Banks

Filter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany

Lifting Parameterisation of the 9/7 Wavelet Filter Bank and its Application in Lossless Image Compression

Linear-Phase Perfect Reconstruction Filter Bank: Lattice Structure, Design, and Application in Image Coding

Perfect Reconstruction Two- Channel FIR Filter Banks

Filter Banks for Image Coding. Ilangko Balasingham and Tor A. Ramstad

Multirate signal processing

EXTENDED LAPPED TRANSFORMS: PROPERTIES, APPLICATIONS, AND FAST ALGORITHMS

ONE-DIMENSIONAL (1-D) two-channel FIR perfect-reconstruction

Efficient signal reconstruction scheme for timeinterleaved

Filter Banks II. Prof. Dr.-Ing Gerald Schuller. Fraunhofer IDMT & Ilmenau Technical University Ilmenau, Germany

Digital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design

OPTIMIZED PROTOTYPE FILTER BASED ON THE FRM APPROACH

Organization of This Pile of Lecture Notes. Part V.F: Cosine-Modulated Filter Banks

DESIGN OF ALIAS-FREE LINEAR PHASE QUADRATURE MIRROR FILTER BANKS USING EIGENVALUE-EIGENVECTOR APPROACH

Fuzzy Bayesian inference

Two-Dimensional Orthogonal Filter Banks with Directional Vanishing Moments

Analysis of Momentum Adaptive Filtering Algorithms

Design of Orthonormal Wavelet Filter Banks Using the Remez Exchange Algorithm

Part 4: IIR Filters Optimization Approach. Tutorial ISCAS 2007

Multi-rate Signal Processing 7. M-channel Maximally Decmiated Filter Banks

Introduction p. 1 Compression Techniques p. 3 Lossless Compression p. 4 Lossy Compression p. 5 Measures of Performance p. 5 Modeling and Coding p.

Designs of Orthogonal Filter Banks and Orthogonal Cosine-Modulated Filter Banks

Sensitivity of hybrid filter banks A/D converters to analog realization errors and finite word length

LOSSLESS INTRA CODING IN HEVC WITH INTEGER-TO-INTEGER DST. Fatih Kamisli. Middle East Technical University Ankara, Turkey

Title without the persistently exciting c. works must be obtained from the IEE

On the Frequency-Domain Properties of Savitzky-Golay Filters

Vandermonde-form Preserving Matrices And The Generalized Signal Richness Preservation Problem

THE discrete sine transform (DST) and the discrete cosine

The basic structure of the L-channel QMF bank is shown below

Noise Reduction in Oversampled Filter Banks Using Predictive Quantization

Introduction to Wavelets and Wavelet Transforms

DFT/RDFT Filter Banks with Symmetric Zero- Phase Nonoverlapping Analysis/Synthesis Filters and Applications

EQUIVALENCE OF DFT FILTER BANKS AND GABOR EXPANSIONS. Helmut Bolcskei and Franz Hlawatsch

AN APPROACH TO PREVENT ADAPTIVE BEAMFORMERS FROM CANCELLING THE DESIRED SIGNAL. Tofigh Naghibi and Beat Pfister

Converting DCT Coefficients to H.264/AVC

MULTIRATE DIGITAL SIGNAL PROCESSING

New Design of Orthogonal Filter Banks Using the Cayley Transform

Design of Narrow Stopband Recursive Digital Filter

Lecture 10, Multirate Signal Processing Transforms as Filter Banks. Equivalent Analysis Filters of a DFT

Study of Wavelet Functions of Discrete Wavelet Transformation in Image Watermarking

Design of Coprime DFT Arrays and Filter Banks

Twisted Filter Banks

Adaptive beamforming for uniform linear arrays with unknown mutual coupling. IEEE Antennas and Wireless Propagation Letters.

Module 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur

The mathematician Ramanujan, and digital signal processing

Filterbank Optimization with Convex Objectives and the Optimality of Principal Component Forms

Source Coding for Compression

Towards Global Design of Orthogonal Filter Banks and Wavelets

The Karhunen-Loeve, Discrete Cosine, and Related Transforms Obtained via the Hadamard Transform

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 47, NO. 2, FEBRUARY

Direct Conversions Between DV Format DCT and Ordinary DCT

Closed-Form Design of Maximally Flat IIR Half-Band Filters

Radix-4 Factorizations for the FFT with Ordered Input and Output

Tunable IIR Digital Filters

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 58, NO. 4, APRIL X/$ IEEE

The System of Linear Equations. Direct Methods. Xiaozhou Li.

Analysis and Synthesis of Weighted-Sum Functions

Lecture 9 Video Coding Transforms 2

Module 4. Multi-Resolution Analysis. Version 2 ECE IIT, Kharagpur

Wavelet Filter Transforms in Detail

Multi-rate Signal Processing 3. The Polyphase Representation

DISCRETE-TIME SIGNAL PROCESSING

4x4 Transform and Quantization in H.264/AVC

Computing running DCTs and DSTs based on their second-order shift properties

Fourier Series Representation of

THE IC-BASED DETECTION ALGORITHM IN THE UPLINK LARGE-SCALE MIMO SYSTEM. Received November 2016; revised March 2017

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

Design of Nonuniform Filter Banks with Frequency Domain Criteria

Performance analysis and design of FxLMS algorithm in broadband ANC system with online secondary-path modeling

POLYNOMIAL SINGULAR VALUES FOR NUMBER OF WIDEBAND SOURCES ESTIMATION AND PRINCIPAL COMPONENT ANALYSIS

A Generalized Output Pruning Algorithm for Matrix- Vector Multiplication and Its Application to Compute Pruning Discrete Cosine Transform

Elliptic Fourier Transform

THEORY OF MIMO BIORTHOGONAL PARTNERS AND THEIR APPLICATION IN CHANNEL EQUALIZATION. Bojan Vrcelj and P. P. Vaidyanathan

4214 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 11, NOVEMBER 2006

ONE OF THE main goals of signal analysis in recent

CONSTRUCTION OF AN ORTHONORMAL COMPLEX MULTIRESOLUTION ANALYSIS. Liying Wei and Thierry Blu

3-D Directional Filter Banks and Surfacelets INVITED

An Introduction to Filterbank Frames

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

POLYNOMIAL-BASED INTERPOLATION FILTERS PART I: FILTER SYNTHESIS*

On Symmetric Extensions, Orthogonal Transforms of Images, and Paraunitary Filter Banks

Symmetric Wavelet Tight Frames with Two Generators

Logarithmic quantisation of wavelet coefficients for improved texture classification performance

Closed Form Designs of Complex Orthogonal. Space-Time Block Codes of Rates (k + 1)=(2k) for

Estimation of the Optimum Rotational Parameter for the Fractional Fourier Transform Using Domain Decomposition

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Contents. Acknowledgments

A Bit-Plane Decomposition Matrix-Based VLSI Integer Transform Architecture for HEVC

FIR BAND-PASS DIGITAL DIFFERENTIATORS WITH FLAT PASSBAND AND EQUIRIPPLE STOPBAND CHARACTERISTICS. T. Yoshida, Y. Sugiura, N.

SNR-Maximizing Interpolation Filters for Band-Limited Signals with Quantization

Transcription:

Title Perfect reconstruction modulated filter banks with sum of powers-of-two coefficients Author(s) Chan, SC; Liu, W; Ho, KL Citation IEEE International Symposium on Circuits and Systems Proceedings, Geneva, Switzerland, 28-31 May 2000, v. 2, p. 73-76 Issue Date 2000 URL http://hdl.handle.net/10722/46174 Rights 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

ISCAS 2000 - IEEE International Symposium on Circuits and Systems, May 28-31, 2000, Geneva, Switzerland PERFECT RECONSTRUCTION MODULATED FILTER BANKS WITH SUM OF POWERS- OF-TWO COEFFICIENTS S. C. Chan, W. Liu and K. L. Ho Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong email: scchan @eee.hku.hk ABSTRACT In this paper, a new family of multiplier-less modulated filter banks, called the SOPOT MFB, is presented. The coefficients of the proposed filter banks consist of sum of powers-of-two coefficients (SOPOT), which require only simple shifts and additions for implementation. The modulation matrix and the prototype filter are derived from a fast DCT-IV algorithm of Wang [lo] and the lattice structure in [l]. The design of the SOPOT MFB is performed using the genetic algorithm(ga).,an 16- channel SOPOT MFB with 34 db stopband attenuation is given as an example, and its average number of terms per SOPOT coefficient is only 2.6. I. INTRODUCTION Perfect Reconstruction (PR) critically decimated filter banks have important applications in speech, audio and image processing. Fig. l(a) shows the block diagram of a critically decimated uniform M-channel filter banks. The theory and design of M-channel PR maximally decimated uniform filter bank has been extensively studied [l]. The cosine modulated filter banks (CMFB) [2] and the lapped transforms [3], [4], [5] are two efficient classes of filter banks with low implementation complexity and good performance. Recently, there is increasing interest in designing filter banks with low implementation complexity. Approaches based on the sum of power-of-two (SOPOT) coefficients [6,9] or integer coefficients [7] have been proposed. With the use of SOPOT, coefficient multiplications can be implemented with simple shifts and additions. In [7], a subspace approach was proposed to design the prototype filter of the CMFB with integer coefficients. Since integer coefficient filter banks require only integer arithmetic (additions and possibly multiplications), the implementation of the filter banks is greatly simplified. Also, if sufficient word length is used to represent the intermediate data, the round-off error can completely be eliminated. In this paper, a new family of modulated filter bank withsum of powers-of-two coefficients, called SOPOT-MFB, is developed. The SOPOT-MFE3 is based on our previous work in [SI, where it was shown that modulated filter banks with perfect reconstruction can be obtained by using modulations other than the conventional cosine modulation. Unfortunately, satisfactory design of the modulations have not been obtained. In this work, the SOPOT modulation matrix and prototype filter are 0-7803-5482-6/99/$10.0002000 IEEE 11-73 derived from a fast DCT-IV algorithm of Wang [lo] and the lattice structure in [l]. The design of the SOPOT MFB is performed using the genetic algorithm. An 16- channel SOPOT MFB with 34 db stopband attenuation is given as an example, and its average number of terms per SOPOT coefficient is 2.6. The rest of the paper is orgainized as follows : Section I1 is a brief overview of the theory of modulated filter banks. The construction of the SOPOT modulation matrix and the design of the SOPOT MFB will be described in Section I11 and IV, respectively. A design example is shown in Section V. A summary of the results is given in Section VI, the conclusion. 11. THEORY OF MFB In CMFB, the analysis filters f, (n) and synthesis filters g, (n) are derived from a prototype filter h(n) by cosine modulation c,,,, ( F,,,, ): f, (n> = h(n)c,,i g, (n) = h(nf,,,# k = 0,1,... M -1 ; n = 0,1,..., N -1, (1) where M is the number of channels and N=2mM is the length of the filter. Two different modulations can be used and without loss of generality, here we will consider the modulation proposed in [2] : Let 2.4-1 N-1 H(z) = ZP Hy(~2M ) be the type-i polyphase q=o decomposition of the prototype filter and F,(z) the z- transform of f, (n). It can be shown that 2M-I F,(z) = CC,,,Z-'H,(-Z~~). (3) 9'0 The analysis filter bank can be expressed in matrix form

E(z) is the polyphase matrix and CA is a (M x2m) modulation matrix given by kal.. = ck,". CA can be further partitioned as CA = (-U9 [A, m even and q=(m-1)/2 for m odd) [2]: A, = &C: (I, + (-l)m-' J, ), A,] (q=d2 for (54 A, = (-1)"-'JMC: (I, -(-l)m-i J,), (5b) where Cs (k,n) = "((k t 1/2)(n t 1/2)n/2M) is the type-iv DCT. It can be shown that the system is PR if the prototype filter satisfies H k (z)h,m-k-l (Z) + HM+k (Z)ff~-k-l =CZ-". (6) It has been shown in [8] that the PR condition of the modulated filter bank is still given by (6) if (7) where I, and J, are (MxM) identity and exchange matrices, respectively. The result in [8] was originally derived for orthogonal MFB but it is still valid for the the more general biorthogonal PR condition (6). The general solutions for A, and A, are (up to a scaling) for some unitary matrix U,. If the modulation is not orthogonal, (6) will still be valid if the analysis modulation matrix d, and synthesis modulation matrix satisfy Cs satisfy (9) R, = m e sine ] sine -cose (1 1:I If cos0 and sine are expressed directly in terms of SOPOT coefficients, say a and p. The inverse of are SOPOT coefficients, the term (a2 t p*)-' cannot in general be expressed as a SOPOT coefficient. The basic idea of the proposed multiplier-less modulation is based on the following factorization of Ro and its inverse Since the factorizations of R, and RBI involve the same set of coefficients, i.e. tan(8/2) and sine, they can be directly quantized to SOPOT coefficients. To get the SOPOT modulation, we start with the fast algorithm of Wang [lo], which factorizes the DCT-IV into a product of 2! +1 sparse matrices as follows: Cc = QMVM where [ :r: I (e) nkm (e- i)v, (P- i) H,,! =log, M, - (13 HM = ' M ('M I2 @'M /2).diug(PM /41 141 'M I41 'M 1414)... diug(p4,p,,...,p4,pa), N 24, 1 0...... 0...... 1 1 0..... 0 0..... O l 1............ where C, is the modulation matrix of the type-i polyphase decomposition of the synthesis filters: It can be shown that CA and C, are given by (up to a scaling) CA = &U, [I, * JM?*(I, T J, )I 7 (loa) C, =JM(Ui')TIIM *JM,*(IM TJM)IJ,, 7 (lob) where U, is now an arbitrary nonsingular matrix. Without loss of generality, we will consider the case where CA =&GUM [I, + JM,(I, - J M >I 7 c, = &(uii)tiim + JM - JM IIJzM. 111. SOPOT MODULATION To derive the SOPOT modulation, the simplest way is to quantize the coefficients in the type-iv DCT. The inverse of the quantized matrix, however, cannot in - general be expressed in terms of SOPOT coefficients. Let's consider the simple example: 11-74 0 1 0 0... 0 F, is obtained by reversing both the rows and columris of P,. QM is a permutation matrix that changes the odd-numbered components of the vector into a reversed order. K, (i), i = 1,2,..., e -1, are block diagonal matrices given by K, (i) =(l/jz).diug(b(i),b(i),..., B(i),B(i)), (14) I : : [ = where B(i) V, (e) is given by ('1 =diug(tl/,m >TJ/OM 9*"7T(2M-3)/4M) 9 (15) where T, =[ I cosrn sinrn. The other matrices sinm -cosrn V, (i), i = 1,2,..., - 1, are obtained by alternating the submatrices I,. and E(i) in the main diagonal as follows.v,(i) = diug(i,,,e(i),i,,;..,e(i)) (16) where E(i) = diug(tii,c+l,ts12r+1,~~~,t~2~+t-3~iz~+l ).

Replacing T, by S, = [A -:I:, :], with a, and 0, SOPOT coefficients, the desired SOPOT modulation matrix is obtained. Let R, (i) be the matrix obtained by replacing T, in V,(i) by S,. Because S,? = S,, Rz(i) = R, (i). The SOPOT modulation matrix U, and its inverse are given by: [ :r: E. U, =Q,R,(O nkm@-i)rm(t-i) M (17) [: 1 and Uil =HE nrm (i)k, (i) R, (!)Q, IV. DESIGN OF THE MFB (18) To design the prototype filter with SOPOT coefficients, we use the lossless lattice structure proposed in [ 11 (Figure 2). The lattice coefficients are represented as: Pn aq,n = X U k 2" k=l a, E [-l,l} b, E { I,..., l,o,-1,...,-i). (19) 1 is a positive integer, which determines the range of the coefficient. p, is the number of terms used in each coefficient. The minimax objective function is used in the design of the prototype filter: D,, = max 1) H(e'" ) I - 1 H,(e'<") 11, (20) where H(z) and Hd(z) are respectively the actual and ideal frequency responses of the prototype filter. The modulation matrix is designed using a similar minimax objective function D,,, my-/^^ = max 11 4 (e'") I - I t(ef") III, (21) where F~ (e'") and kk (e'") are respectively the actual and ideal frequency responses of the k-th analysis filter of the SOPOT MFB.The SOPOT coefficients are found by minizing D, and D, using the Genetic Algorithm. V. DESIGN EXAMPLES Fig. 3(a) and 3(b) show, respectively, the frequency responses of the prototype and the analysis filters of an 16-channel SOPOT MFB. The cutoff frequency of the prototype filter is a, =O.O75n and its stopband attenuation is 37 db. Because of the linear-phase property of the prototype filter, there are altogether eight different lattices. Polyphase components H, (z) and H,+,,(z) are derived from the q-th lattice, and all of them have two lattice coefficients aq,l,aq 2, i.e. (m=2). I I I 4. 2 I (x=1/16, 5/16, lb), S,,,,, S,,,,,, and s5/,6 can be derived from S,,,,, and SI,,, respectively. The number of variables is therefore reduced and their details are as follows: 21/64 25/64 29/64 1/16 5/16 118 114 20-2-3-2-7 2-1 +24-2-7 2O - 2' 20-2-7 2-3 + 24 + 2" t 2-7 2-1 + 2-2 t 2' 2-1 + 2-3 2-1 + 2-2 - 24 + 2 4 2-1 + 2-1 -2-5 20-2-3-24 2-3 -2" 2-1 t 2' 2-3 + 24 t 2-1 + 2-8 2-1 - 2-4 - 24-2-7

[2] R. D. Koilpillai and P. P. Vaidyanathan, "Cosine- Modulated FIR filter banks satisfying perfect reconstruction," IEEE Trans. ASSP-40, April 1992, pp. 770-783. (31 H. S. Malvar, "Extended Lapped Transforms: Properties, Applications, and Fast Algorithms," IEEE Trans. SP, Vo1.40, NOV. 1992, pp. 2703-2714. 141 H. S. Malvar, "Lapped transforms for efficient transfodsubband coding," IEEE Trans. ASSP-38, June 1990, pp. 969-978. [5] R. L. de Queiroz, and T. Q. Nguyen " The GenLOT: Generalized Linear Phase lapped orthogonal Transform", IEEE Trans. SP, Vol. 44, March 1996, pp. 497-507. [6] S. Sriranganathan, D. R. Bull, D. W. Redmill, "The design of Low Complexity Two-Channel Lattice- Structure Perfect-Reconstruction Filter Banks Using Genetic Algorithm". Proc. of ISCAS '97., vo1.4, pp.2393-2396, June 1997. [7] A. Mertins, "Discrete-coefficients Linear-phase Prototypes For PR Cosine-Modulated Filter Banks",Proc of ICASSP' 98, Vo1.3, pp.1433-1436, May 1998. [8] S. C. Chan and C. W. Kok, "Perfect Reconstruction Modulated Filter Banks without Cosine Constraints," Proc. 1993 IEEE Int'l Con$ Acoustic Speech Signal Processing, pp. 111. 189-192, April 27-29, Minneapolis, Minnesota, USA. [9] B. R. Homg, H. Samueli and A. N. Willson, 'The design of Two-Channel Lattice-Structure Perfect- Reconstruction Filter banks Using Powers-of-Two Coefficients"" IEEE Trans. CAS, Vol. 40, No 7, July 1993. [IO] 2. Wang, " Fast algorithms for the discrete W transform and for the discrete Fourier transform", Trans. ASSP-32, August 1984, pp. 803-816. IEEE Fig. 1. Block diagrams of (a) M-channel uniform filter banks, (b) polyphase implementation of the cosine-modulated analysis filter bank. Fig. 2. Lossless lattice structure of the prototype filter in [I] 111 (hq =n(l+a:,jos). $4-1 0 0 ~ " " " " " 0 005 01 015 02 025 03 035 04 045 05 (a),,, I, I I I I - e n " " " " ' 0 005 01 015 02 025 03 035 04 045 05 (b) Fig. 3. Frequency responses of the 16-channel SOPOT MFB: (a) prototype filter (length=64, as = 0.075~, A, = 37dB ), (b) analysis filters, A, = 34dB. 11-76