Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (13): 72-74.DOI: 10.3778/j.issn.1002-8331.2009.13.021

• 研发、设计、测试 • Previous Articles     Next Articles

Branch-and-bound algorithm for design of FIR filters with discrete coefficients

JIANG Yao-wei,LIU San-yang,MU Xue-wen   

  1. Department of Applied Mathematics,Xidian University,Xi’an 710071,China
  • Received:2008-09-25 Revised:2008-11-24 Online:2009-05-01 Published:2009-05-01
  • Contact: JIANG Yao-wei

解离散系数滤波器设计问题的分支定界算法

蒋耀伟,刘三阳,穆学文   

  1. 西安电子科技大学 应用数学系,西安 710071
  • 通讯作者: 蒋耀伟

Abstract: In this paper,a quadratic programming method based on semidefinite programming is given to solve the design of FIR filters with discrete coefficients in the light of literature 6,which can give a better bound than a semidefinite programming relaxation method.Based on the model,the Branch-and-Bound algorithm is used to solve this problem.Compared with the conventional randomized method,this one can obtain a better sub-optimal performance.This method is very effective for the design of high-precision FIR digital filters.The simulations have proved it.

摘要: 基于离散系数滤波器设计问题已有的半定规划松弛模型,利用文献[6]的方法给出了该问题的二次规划松弛模型,该模型能给出比半定规划模型更好的界,然后运用分支定界方法求解该模型。与随机扰动方法相比,该方法能得到一个性能更好的次优解,对于精度要求较高的滤波器设计问题,这种方法非常有效,并通过了仿真实验的证实。