ITERATIVE REWEIGHTED LEAST-SQUARES DESIGN OF FIR FILTERS

被引:108
作者
BURRUS, CS
BARRETO, JA
SELESNICK, IW
机构
[1] RICE UNIV,COMPUTAT MATH LAB,HOUSTON,TX 77251
[2] RICE UNIV,DEPT ELECT & COMP ENGN,HOUSTON,TX 77251
基金
美国国家科学基金会;
关键词
D O I
10.1109/78.330353
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper develops a new iterative reweighted least squares algorithm for the design of optimal L(p) approximation FIR filters. The algorithm combines a variable p technique with a Newton's method to give excellent robust initial convergence and quadratic final convergence. Details of the convergence properties when applied to the L(p) optimization problem are given. The primary purpose of L(p) approximation for filter design is to allow design with different error criteria in pass and stopband and to design constrained L(2) approximation filters. The new method can also be applied to the complex Chebyshev approximation problem and to the design of 2-D FIR filters.
引用
收藏
页码:2926 / 2936
页数:11
相关论文
共 59 条
[1]  
Adams J. W., 1991, IEEE T CIRCUITS SYST, V39, P376
[2]   DESIGN OF ALMOST MINIMAX FIR FILTERS IN ONE-DIMENSION AND 2-DIMENSIONS BY WLS TECHNIQUES [J].
ALGAZI, VR ;
SUK, M ;
RIM, CS .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1986, 33 (06) :590-596
[3]   FREQUENCY WEIGHTED LEAST-SQUARE DESIGN OF FINITE DURATION FILTERS [J].
ALGAZI, VR ;
SUK, M .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1975, 22 (12) :943-953
[4]  
[Anonymous], 1981, PATHWAYS SOLUTIONS F
[5]   BEST APPROXIMATION IN L-INFINITY VIA ITERATIVE HILBERT-SPACE PROCEDURES [J].
BANI, MS ;
CHALMERS, BL .
JOURNAL OF APPROXIMATION THEORY, 1984, 42 (02) :173-180
[6]  
BARRETO JA, 1994, APR P IEEE INT C AC, P19
[7]  
BARRETO JA, 1994, NOV P IEEE INT C IM, P13
[8]  
BARRETO JA, 1992, THESIS RICE U HOUSTO
[9]  
BURRUS CS, 1992, 5TH PAP SUMM IEEE S
[10]  
BURRUS CS, 1992, MAY P IEEE INT S CIR, P545