• Abstract

# Direct Design of Orthogonal Filter Banks and Wavelets

This paper presents a new method for the design of two-channel conjugate quadrature (CQ) filter banks in which halfband filter and spectrum factorization are not required. Instead, a CQ filter is directly optimized subject to the perfect reconstruction and possibly other constraints (such as number of vanishing moments (VM)). We develop a design strategy in that the solution is approached sequentially with each update confined to within a small vicinity of the current iterate where the problem at hand behaves like a convex one, thus the update can be obtained as a solution of a convex problem. Four design scenarios are considered, namely the least squares designs with or without VM requirement, and equiripple designs with or without VM requirement. The simulation studies demonstrate that the proposed method is reliable to design high-order CQ filters with improved performance.

SECTION I

## Introduction

Two-channel conjugate quadrature (CQ) filter banks, also known as power-symmetric filter banks [1], are among the most popular building blocks for multirate systems and wavelet-based coding systems as they offer perfect reconstruction (PR) and other desirable properties. Several algorithms for the design of CQ filters have been proposed since 1980's, see e.g., references [1], [2], [3], [4], [5], [6] and the relevant work cited therein. In addition, there are design techniques aimed at FIR compaction filters, that are also applicable to CQ filters [7], [8]. The dominating design technique in the literature is an indirect methodology in which the design is accomplished in two steps: construct a halfband filter (subject to certain nonnegativity constraint) followed by spectrum factorization of the halfband filter. In this paper, this design paradigm is altered with a direct method in which halfband filter and subsequent factorization are not required. Instead, a CQ filter is optimized directly subject to the PR and possibly other constraints (such as number of vanishing moments (VM)). The design so formulated turns out to be a nonconvex problem. We develop a design strategy in that the solution is approached sequentially with each update confined to within a small vicinity of the current iterate where the problem at hand behaves like a convex one, thus the update can be obtained as a solution of a convex problem. Four design scenarios are considered, namely the least squares designs with or without VM requirement, and equiripple designs with or without VM requirement. We show that these designs fit quite nicely into a convex QP framework, thus a single easy-to-access solver such as SeDuMi [9] can handle them all. The simulation studies demonstrate that the proposed method is reliable to design high-order CQ filters with improved performance.

SECTION II

## Notation and Background

A two-channel causal FIR CQ filter bank is characterized by a pair of analysis filters H0, H1 and a pair of synthesis filters G0 and G1 as shown in Fig. 1, where the four filters are related by ([2], p. 436) TeX Source \eqalignno{H_1 (z) &= -z^{-(N-1)}H_0(-z^{-1})\cr G_0 (z) &=H_1(-z)\cr G_1 (z) &=-H_0(-z)&\hbox{(1)}}where is a lowpass FIR transfer function of length-N with N even. With (1), the aliasing is removed, and the PR is achieved if H0(z) satisfies TeX Source $$H_0(z)H_0(z^{-1})+H_0(-z)H_0(-z^{-1}) = 2\eqno{\hbox{(2)}}$$

Fig. 1. A 2-channel CQ filter bank.

By substituting into (2), we obtain a set of N/2 equality constraints in terms of impulse response {hi, i = 0,1,…,N−1} as TeX Source $$\sum^{N-1-2m}_{n=0}h_n\cdot h_{n+2m} = \delta_m\quad {\rm for}\ m=0,1,\ldots,(N-2)/2\eqno{\hbox{(3)}}$$where δm is the Dirac sequence with δ0 = 1 and δm = 0 for nonzero m. Equation (3) is known as the double shift orthogonality in the wavelet literature that explicitly characterizes the PR condition (2) in terms of the impulse response of H0(z). In addition to the PR conditions, CQ filters may be required to meet other constraints such as possessing certain number of VMs for constructing wavelets [3], [4], [5], [6]. It is known that the number of VMs of a CQ filter bank is equal to the number of zeros of H0(z) at ω = π. Because TeX Source $$\left.{d^lH_0(e^{jω}) \over dω^l}\right\vert_{ω=\pi}=(-j)^l\sum^{N-1}_{n=0}(-1)^n\cdot n^l\cdot h_n$$a CQ filter has L vanishing moments if TeX Source $$\sum^{N-1}_{n=0}(-1)^n\cdot n^l \cdot h_n = 0 \quad {\rm for}\ l=0,1,\ldots L-1\eqno{\hbox{(4)}}$$Thus a least squares (LS) design of CQ lowpass filter H0(z) having L VMs can be expressed as TeX Source \eqalignno{&{\rm minimize}\quad \int^{\pi}_{ω_a}\vert H_0 (e^{jω})\vert^2 dω\cr&{\rm subject\ to}{:}\ {\rm constraints}\ (3)\ {\rm and}\ (4)&\hbox{(5)}}where ωa is the normalized stopband edge of H0(z). It can readily verified that the LS objective function in (5) is the quadratic form hTQh where h = [h0 h1hN−1]T, and Q is a symmetric positive definite Toeplitz matrix characterized by its first row [π −ωa −sin ωa … −sin (N−1)ωa/(N−1)], hence the objective function is globally strictly convex. Because of the constraints in (3), however, the feasible region is nonconvex and hence (5) is a nonconvex problem. To deal with (3), we develop a design strategy in that the solution is approached sequentially, where each update is limited to within a local region so that the problem at hand is approximately convex and the update can be obtained as a solution of a convex problem. Suppose we are in the kth iteration to update the coefficient vector from h(k) to h(k+1) = h(k)+d achieve two things: to reduce the filter's stopband energy and to better satisfy the constraints in (3). If we write (3) at h(k+1) as TeX Source $$\sum_n h_n^{(k)}d_{n+2m} + \sum_n d_n h^{(k)}_{n+2m} + \sum_n d_n d_{n+2m} \equiv \delta_m\eqno{\hbox{(6)}}$$If the updating vector d is limited to be small in magnitude, then the last term on the right side of (6) is of second-order smallness and hence can be neglected. This yields TeX Source $$\sum_n h^{(k)}_n d_{n+2m}+ \sum_n d_n h^{(k)}_{n+2m} = \delta_m -\sum_n h^{(k)}_n h^{(k)}_{n+2m} = u^{(k)}_m\eqno{\hbox{(7)}}$$for m = 0, 1, … (N−2)/2. The N/2 linear equations in (7) can be expressed as TeX Source $$C^{(k)}d = u^{(k)}\eqno{\hbox{(8)}}$$where u(k) is a vector whose mth component is u(k)m, and C(k) is an N/2 × N matrix defined by the right side of (7) in terms of h(k). Concerning the constraints on VMs at h(k + l), (4) gives TeX Source $$Dh^{(k+1)} = D\left(h^{(k)} + d\right) = 0$$i.e., TeX Source $$Dd = - Dh^{(k)} \equiv v^{(k)}\eqno{\hbox{(9)}}$$where D is an L × N matrix whose lth row is generated as the (l−1)th power of vector 0: 1: (N − 1), then with alternate sign change. The smallness of updating vector d is controlled by imposing a small upper bound β for the magnitude of each component, i.e., | di| ≤ β for i = 1,2,…,N which can be put together as TeX Source $$Ad \le b\eqno{\hbox{(10)}}$$where With h(k+1 = h(k)+d the objective function becomes a quadratic function of d and the kth iteration of LS problem (5) now assumes the form TeX Source $$\matrix{{\rm minimize} &d^T Qd + 2 d^T q^{(k)} + κ\cr{\rm subject\ to} &Ad \le b\cr&\left[\matrix{C^{(k)}\cr D}\right]d = \left[\matrix{u^{(k)}\cr v^{(k)}}\right]}\eqno{\hbox{(11)}}$$with q(k) = Qh(k) and κ a constant. Problem (11) has taken the VM requirement (5) into account. If VM is not a part of the design specifications, then (11) is modified by simply replacing the equality constraint with (8). The two design scenarios are unified by modifying (11) to TeX Source $$\matrix{{\rm minimize} &d^T Qd+ 2d^T q^{(k)} + \kappa\cr{\rm subject\ to}{:} &Ad \le b\cr&F^{(k)}d = w^{(k)}}\eqno{\hbox{(12)}}$$where TeX Source \eqalignno{F^{(k)} &= \cases{\left[\matrix{C^{(k)}\cr D}\right] &{\rm with}\ {\rm VM}\cr C^{(k)} &{\rm without}\ {\rm VM}}&\hbox{(13a)}\cr\noalign{\rm and}w^{(k)} &= \cases{\left[\matrix{u^{(k)}\cr v^{(k)}}\right] &{\rm with}\ {\rm VM}\cr u^{(k)} &{\rm without}\ {\rm VM}}&\hbox{(13b)}}Depending on whether the VM requirement is included or not, there are N/2 + L or N/2 linear equality constraints in (12). These constraints can be eliminated from the QP problem by expressing all solutions of F(k) d = w(k) via the singular value decomposition (SVD) of F(k) = U(k)Σ(k) V(k)T as [10] TeX Source $$d = V^{(k)}_r x + d_s\eqno{\hbox{(14)}}$$where x is an (Nr)-dimensional free vector with r being the rank of F(k) so r = N/2 + L or N/2 depending on whether VM is required, ds is any solution of F(k) d = w(k) (e.g., ds = (F(k)) w(k) with † denoting pseudo-inverse), and V(k)r is the matrix consisting of the last Nr columns of V(k). With (14), problem (12) is reduced to TeX Source $$\matrix{{\rm minimize} & x^T Q^{(k)}x + 2 x^T p^{(k)}\cr{\rm subject\ to}{:} & A^{(k)}x \le \hat{b}}\eqno{\hbox{(15)}}$$where TeX Source \eqalignno{Q^{(k)} &= V^{(k)T}_r QV^{(k)}_r,\quad p^{(k)} = V^{(k)T}_r\left(q^{(k)} + Qd_s\right)\cr A^{(k)} &= AV^{(k)}_r,\quad \hat{b} = b - Ad_s}We note that (15) can be solved more efficiently relative to (12) because the number of design variables is now reduced to N/2 − L and also (15) involves less number of constraints. Note that the reduction in problem size is achieved at the cost of performing the SVD of matrix F(k) in each iteration. Problem (15) is a convex QP problem for which many efficient algorithms [10] and reliable software [9], [11] exist. Because Q(k) is positive definite, the solution, x(k), of (15) is a unique and globally optimal. By constructing d(k) = V(k)r x(k)+ ds (see (14)) and then h(k + 1) = h(k)+ d(k) the kth iteration is complete. The algorithm continues until the magnitude of the updating vector d(k) is less than a prescribed tolerance and h(k + 1) in this case is claimed to be the impulse response of H0(z). Filters H1(z), G0(z), and G1(z) are then constructed using (1).

SECTION IV

## Minimax Designs

This section addresses the design of equiripple CQ filters. To this end we consider the minimization of the instantaneous power of lowpass filter H0(z) over its stopband subject to PR and VM constraints, namely, TeX Source $$\matrix{\mathop{\rm minimize}_h\ {\rm maximize}_{w_a \le w \le \pi}\ \vert H_0(e^{jw})\vert\cr{\rm subject\ to}{:}\ {\rm constraints}\ (3)\ {\rm and}\ (4)}\eqno{\hbox{(16)}}$$By defining c(ω) = [1  cosω ···  cos(N − 1)ω]T and s(ω) = [0  sin ω ··· sin (N − 1)ω]T, we can write TeX Source \eqalignno{\vert H_0 (e^{jω})\vert &= \sqrt{(h^T c(ω))^2 + (h^T s(ω))^2} =\left\Vert\left[\matrix{c(ω)^T\cr s(ω)^T}\right]\cdot h\right\vert\cr&\equiv \Vert T (ω) \cdot h \Vert}which in conjunction with the analysis in Section 3 leads (16) to TeX Source $$\matrix{\mathop{\rm minimize}_x\ \mathop{\rm maximize}_{ω_a \le ω \le \pi} &\left\Vert T(ω)\left(h^{(ω)}+V^{(k)}_rx+d_s\right)\right\Vert\cr{\rm subject\ to}{:} &A^{(k)} x \le \hat{b}}\eqno{\hbox{(17)}}$$By introducing an upper bound η (as an auxiliary variable) for the objective function in (17) over frequency grids Ω = {ωa = ω1, ω2,···,ωk = π} in the stopband, (17) can be reformulated as TeX Source $$\matrix{{\rm minimize} & \eta\cr{\rm subject\ to}{:} & \left\Vert T^{(k)}(ω)x + e^{(k)}(ω)\right\Vert\le \eta \quad {\rm for}\ ω \in \Omega\cr&A^{(k)}x \le \hat{b}}\eqno{\hbox{(18)}}$$where T(k)(ω) = T(ω)Vr(k), e(k)(ω) = T(ω)(h(k)+ds). With regard to variable {η, x}, (18) is a second-order cone programming problem (SOCP) [10]—a class of convex quadratic problems for which efficient solvers such as SeDuMi [9] exist. Note that the number of variables in (18) remains as low as N/2 − L + 1, but there are now K second-order cone constraints in addition to 2N linear constraints. With properly defined {F(k), w(k)} using (13), Vr(k) and ds in (14) are computed and the unique and global solution of problem (18), x(k), can be obtained. By constructing d(k) = Vr(k) x(k)+ds and then h(k+1) = h(k)+d(k), and the kth iteration is complete. Like in the LS designs, the algorithm continues until the magnitude of the updating vector d(k) is less than a prescribed tolerance and h(k + 1) is claimed to be the impulse response of H0(z).

SECTION IV

## Design Examples

As the first set of examples, the algorithm in Section 4 was utilized for the refinement of the three CQ filters of lengths 8, 16, 32 reported in [2]. Each of these filters was used as initial point for the algorithm. The number of frequency grids K and convergence tolerance ∊ were set to {K = 25, ∊ = 10−14}, {K = 28, ∊ = 10−14}, and {K = 50, ∊ = 10−17}, respectively, and the value of η in (18) was set to where N is the filter length. It took the algorithm 7, 12, and 23 iterations to converge, respectively. The coefficients of H0(z) with N = 32 are shown in Table I, where for comparison purposes the filter coefficients reported in [2] are also listed. The stopband edge as well as minimum attenuation (set to 40 dB) of each refined CQ filter were identical to that of the filter of same length from [2], and the performance of the filters are evaluated in terms of minimum stopband attenuation and satisfaction of the PR condition. The satisfaction of the PR condition was measured by the largest magnitude error among all N/2 equations in (3). Because all filters involved satisfy 40 dB minimum stopband attenuation, the evaluation results in Table II only list the largest equation errors of the three pairs of designs. Fig. 2 depicts the magnitude responses of the CQ filters H0 and H1 of length 32 from [2] (dashed lines) and their refined versions (solid lines). It is observed that the magnitude responses are practically identical, but the refined filter offers considerably improved satisfaction of the PR condition (see Table II).

Fig. 2. Magnitude responses of H0(z) and H1(z) of [2] (dashed lines) and this paper (solid lines), N = 32.
TABLE I Coefficients of H0(z) of Length 32
TABLE II Largest Equation Error for PR

As the second set of examples, the algorithms in Sections 3 and 4 were applied to accomplish six LS designs and six minimax designs with length N = 96, normalized stopband edge ωa = 0.56π, and VM number L = 0, 1,…, 5. The design results in terms of stopband energy (for LS designs), peak instantaneous power (for minimax designs), and largest equation error for PS conditions in (3) for various VMs are shown in Tables III and IV.

TABLE III Least Squares with N = 96, ωa = 0.56π
TABLE IV Minimax with N = 96, ωa = 0.56 π

As a representative design, Fig. 3 depicts the magnitude response of the equiripple CQ filters H0 and H1 of length N = 96 and L = 3.

Fig. 3. Magnitude response of H0(z) and H1(z) with N = 96, L = 3.
SECTION V

## Concluding Remarks

The simulation results in Section 5 indicate that the proposed design technique is able to produce highly satisfied CQ filters and is reliable for high-order designs. Our design idea is quite general and is in fact also applicable to M-channel filter banks, biorthogonal and cosine-modulated filter banks, and filter banks with additional requirements for phase response. These and other related design issues will be addressed in detail elsewhere.

## Footnotes

Wu-Sheng Lu is with the Dept. of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada V8W 3P6 Email: wslu@ece.uvic.ca

Takao Hinamoto is with the Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima, 739-8527, Japan Email: hinamoto@hiroshima-u.ac.jp

## References

1. Multirate Systems and Filter Banks

P. P. Vaidyanathan

Multirate Systems and Filter Banks, Prentice-Hall, 1993

2. Exact reconstruction techniques for tree-structured subband coders

M. J. T. Smith, T. P. Barnwell, III

IEEE Trans. Signal Processing, vol. 34, p. 434–441, 1986-06

3. A Remez exchange algorithm for orthonormal wavelets

O. Rioul, P. Duhamel

IEEE Trans. Circuits Syst., II, vol. 41, p. 550–560, 1994-08

4. Design of conjugate quadrature filters having specified zeros

W. Lawton, C. A. Michelli

Proc. ICASSP, 1997, vol. 3, 2069–2072

5. Zero-pinning the Bernstein polynomial: A simple design technique for orthogonal wavelets

D. B. H. Tay

IEEE Signal Processing Letters, vol. 12, issue (12), p. 835–838, 2005-12

6. Least squares design of orthogonal wavelets via the zero pinning technique

D. B. H. Tay

Proc. ICASSP, 2006, vol. 3, 213–216

7. Globally optimal two channel FIR orthonormal filter banks adapted to the input signal statistics

J. Tuqan, P. P. Vaidyanathan

Proc. ICASSP, 1998, 1353–1356

8. A low complexity SDP method for designing optimum compaction filters

B. Dumitrescu, C. Popeea

Proc. ICASSP, 2000, 516–519

9. SeDuMi version 1.1R3

http://sedumi.mcmaster.ca/, available at

10. Practical Optimization: Algorithms and Engineering Applications

A. Antoniou, W.-S. Lu

Practical Optimization: Algorithms and Engineering Applications, Springer, 2007

11. Optimization Toolbox Version 4.0 for MATLAB

Natick, MA, The MathWorks

## Cited By

No Citations Available

## Keywords

### INSPEC: Controlled Indexing

wavelet transforms, channel bank filters, least squares approximations

### INSPEC: Non-Controlled Indexing

No Keywords Available

### Authors Keywords

No Keywords Available

### More Keywords

No Keywords Available

No Corrections

## Media

No Content Available
This paper appears in:
International Symposium on Circuits and Systems
Issue Date:
2009
On page(s):
81 - 84
ISBN:
N/A
Print ISBN:
978-1-4244-3827-3
INSPEC Accession Number:
10760311
Digital Object Identifier:
10.1109/ISCAS.2009.5117690
Date of Current Version:
26 Jun, 2009