复FIR数字滤波器幅值约束Chebyshev设计  

Chebyshev Design of Complex FIR Digital Filters with Magnitude Constraints

作　　者：赵瑞杰[1] 赖晓平[1] 

机构地区：[1]山东大学威海分校信息工程学院,山东威海264209

出　　处：《电子学报》2006年第9期1694-1699,共6页Acta Electronica Sinica

基　　金：国家自然科学基金项目(No.60275006);山东省自然科学基金项目(No.Y2005G11)

摘　　要：L.J.Karam和McC lellan最早得到了有关复数域Chebyshev逼近的复交错点组定理,并提出了以此定理为基础的复Remez算法用于复FIR数字滤波器的Chebyshev设计.本文首先给出并证明了复交错点组定理在带不等式约束条件下的扩展定理,之后,根据此扩展定理中对最优解极值频率点特性的描述,提出了一种有效的算法来解决带幅值不等式约束的复FIR数字滤波器的Chebyshev设计问题.这一新算法中还结合了复Remez算法及赖晓平提出的迭代Remez算法,并且如果问题的解存在则保证收敛到此解.作者把上述算法做成了MATLAB语言程序,并进行了大量的实例设计实验,仿真结果表明此算法有效而可靠.The complex Alternation Theorem proposed by L. J. Karam and McClellan is the foundation of the complex Remez algorithm for Chebyshev design of complex FIR filters. Herein, the complex Alternation Theorem is extended to the case with inequality constraints, and then a new algorithm is presented for the design of Chebyshev FIR filters with magnitude inequality constraints. The new algorithm combines the complex Remez algorithm and the iterative Remez algorithm proposed by X.P. Lai, and is guaranteed to converge to the optimal solution,if exists. A lot of design examples are to be given, and the results of simulation illustrate the performance of the algorithm.

关 键 词：复FIR滤波器 约束复交错点组定理 复Remez算法 迭代Remez算法 约束复Remez算法 

分 类 号：TN713[电子电信—电路与系统]