会议专题

A Successive Linear Programming Algorithm for the Design of FIR Filters with Discrete Coefficients

Based on the semidefinite programming relaxation of the design of FIR digital filters with discrete coefficients, a suc-cessive linear programming algorithm is presented. Combining with a randomized method of Goemans and Williamson, and a suboptimal solution is obtained for the FIR filters design problem. Furthermore, its convergence result is given. Comparing with the semidefinite programming relaxation method, simulation results demonstrate that the successive linear programming algorithm often yields the similar BER performances for the FIR filter design problem, but the average CPU time of this method is significantly reduced.

Successive linear programming algorithm Semidefinite programming Randomized method

Yaling Zhang Xuewen Mu

Department of Computer Science Xian Science and Technology University Xian, 710054, China Department of Applied Mathematics Xidian University Xian 710071, China

国际会议

2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

太原

英文

231-235

2011-02-26(万方平台首次上网日期,不代表论文的发表时间)