Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming

Authors:
Charlotte Yuk-Fan Ho;Bingo Wing-Kuen Ling;Lamia Benmesbah;Ted Chi-Wah Kok;Wan-Chi Siu;Kok-Lay Teo
Affiliations:
School of Mathematical Sciences, Queen Mary, University of London, London, U.K;School of Engineering, University of Lincoln, Lincoln, U.K;Department of Electronic Engineering, Division of Engineering, King's College London, Strand, London, U.K;Canaan Microelectronics, Kowloon, Hong Kong, China;Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Kowloon, Hong Kong, China;Department of Mathematics and Statistics, Curtin University of Technology, Perth, Australia
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 7
Cited 0

A class of filled functions for finding global minimizers of several variables

Journal of Optimization Theory and Applications
A filled function method for finding a global minimizer of a function of several variables

Mathematical Programming: Series A and B
Finding Global Minima with a Computable Filled Function

Journal of Global Optimization
A Hybrid Descent Method for Global Optimization

Journal of Global Optimization
A Novel Filled Function Method and Quasi-Filled Function Method for Global Optimization

Computational Optimization and Applications
A hybrid method for the design of oversampled uniform DFT filter banks

Signal Processing
Peak constrained least-squares QMF banks

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

In this correspondence, a two-channel linear phase finite-impulse-response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimization problem so that a weighted sum of the maximum amplitude distortion of the filter bank, the maximum passband ripple magnitude and the maximum stopband ripple magnitude of the prototype filter is minimized subject to specifications on these performances. A modified filled function method is proposed for finding the global minimum of the nonconvex optimiltation problem. Computer numerical simulations show that our proposed design method is efficient and effective.