Iterative Optimal Design for Fast Filter Bank with Low Complexity

Jinguang HAO; Wenjiang PEI; Kai WANG; Yili XIA; Cunlai PU

doi:10.1587/transfun.E99.A.639

Iterative Optimal Design for Fast Filter Bank with Low Complexity

Jinguang HAO, Wenjiang PEI, Kai WANG, Yili XIA, Cunlai PU

Full Text Views

0

Share
Cite this

Summary :

In this paper, an iterative optimal method is proposed to design the prototype filters for a fast filter bank (FFB) with low complexity, aiming to control the optimum ripple magnitude tolerance of each filter according to the overall specifications. This problem is formulated as an optimization problem for which the total number of multiplications is to be minimized subject to the constrained ripple in the passband and stopband. In the following, an iterative solution is proposed to solve this optimization problem for the purpose of obtaining the impulse response coefficients with low complexity at each stage. Simulations are conducted to verify the performance of the proposed scheme and show that compared with the original method, the proposed scheme can reduce about 24.24% of multiplications. In addition, the proposed scheme and the original method provide similar mean square error (MSE) and the mean absolute error (MAE) of the frequency response.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.2 pp.639-642

Publication Date: 2016/02/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E99.A.639

Type of Manuscript: LETTER

Category: Digital Signal Processing

Authors

Jinguang HAO
  Ludong University,Southeast University
Wenjiang PEI
  Southeast University
Kai WANG
  Southeast University
Yili XIA
  Southeast University
Cunlai PU
  Nanjing University of Science and Technology

Keyword

fast filter bank, optimization, low complexity, mean square error, mean absolute error

Cite this

Copy

Jinguang HAO, Wenjiang PEI, Kai WANG, Yili XIA, Cunlai PU, "Iterative Optimal Design for Fast Filter Bank with Low Complexity" in IEICE TRANSACTIONS on Fundamentals, vol. E99-A, no. 2, pp. 639-642, February 2016, doi: 10.1587/transfun.E99.A.639.
Abstract: In this paper, an iterative optimal method is proposed to design the prototype filters for a fast filter bank (FFB) with low complexity, aiming to control the optimum ripple magnitude tolerance of each filter according to the overall specifications. This problem is formulated as an optimization problem for which the total number of multiplications is to be minimized subject to the constrained ripple in the passband and stopband. In the following, an iterative solution is proposed to solve this optimization problem for the purpose of obtaining the impulse response coefficients with low complexity at each stage. Simulations are conducted to verify the performance of the proposed scheme and show that compared with the original method, the proposed scheme can reduce about 24.24% of multiplications. In addition, the proposed scheme and the original method provide similar mean square error (MSE) and the mean absolute error (MAE) of the frequency response.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.639/_p

Copy

@ARTICLE{e99-a_2_639,
author={Jinguang HAO, Wenjiang PEI, Kai WANG, Yili XIA, Cunlai PU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Iterative Optimal Design for Fast Filter Bank with Low Complexity},
year={2016},
volume={E99-A},
number={2},
pages={639-642},
abstract={In this paper, an iterative optimal method is proposed to design the prototype filters for a fast filter bank (FFB) with low complexity, aiming to control the optimum ripple magnitude tolerance of each filter according to the overall specifications. This problem is formulated as an optimization problem for which the total number of multiplications is to be minimized subject to the constrained ripple in the passband and stopband. In the following, an iterative solution is proposed to solve this optimization problem for the purpose of obtaining the impulse response coefficients with low complexity at each stage. Simulations are conducted to verify the performance of the proposed scheme and show that compared with the original method, the proposed scheme can reduce about 24.24% of multiplications. In addition, the proposed scheme and the original method provide similar mean square error (MSE) and the mean absolute error (MAE) of the frequency response.},
keywords={},
doi={10.1587/transfun.E99.A.639},
ISSN={1745-1337},
month={February},}

Copy

TY - JOUR
TI - Iterative Optimal Design for Fast Filter Bank with Low Complexity
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 639
EP - 642
AU - Jinguang HAO
AU - Wenjiang PEI
AU - Kai WANG
AU - Yili XIA
AU - Cunlai PU
PY - 2016
DO - 10.1587/transfun.E99.A.639
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2016
AB - In this paper, an iterative optimal method is proposed to design the prototype filters for a fast filter bank (FFB) with low complexity, aiming to control the optimum ripple magnitude tolerance of each filter according to the overall specifications. This problem is formulated as an optimization problem for which the total number of multiplications is to be minimized subject to the constrained ripple in the passband and stopband. In the following, an iterative solution is proposed to solve this optimization problem for the purpose of obtaining the impulse response coefficients with low complexity at each stage. Simulations are conducted to verify the performance of the proposed scheme and show that compared with the original method, the proposed scheme can reduce about 24.24% of multiplications. In addition, the proposed scheme and the original method provide similar mean square error (MSE) and the mean absolute error (MAE) of the frequency response.
ER -