New design methods of FIR filters with signed power of two coefficients based on a new linear programming relaxation with triangle inequalities

2003 ◽  
Author(s):  
R. Ito ◽  
T. Fujie ◽  
K. Suyama ◽  
R. Hirabayashi
Keyword(s):  
Linear Programming ◽  
Design Methods ◽  
Linear Programming Relaxation ◽  
Fir Filters

scholarly journals A Deterministic Method for Solving the Sum of Linear Ratios Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Zhenping Wang ◽  
Yonghong Zhang ◽  
Paolo Manfredi
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Branch And Bound ◽  
Nonconvex Programming ◽  
Real Life ◽  
Branch And Bound Algorithm ◽  
Separation Technique ◽  
Linear Programming Relaxation ◽  
Deterministic Method ◽  
Linearization Technique

Since the sum of linear ratios problem (SLRP) has many applications in real life, for globally solving it, an efficient branch and bound algorithm is presented in this paper. By utilizing the characteristic of the problem (SLRP), we propose a convex separation technique and a two-part linearization technique, which can be used to generate a sequence of linear programming relaxation of the initial nonconvex programming problem. For improving the convergence speed of this algorithm, a deleting rule is presented. The convergence of this algorithm is established, and some experiments are reported to show the feasibility and efficiency of the proposed algorithm.

Low‐complexity minimax design of digital FIR filters utilising linear programming in BI‐DAC

2019 ◽  
Vol 55 (7) ◽  
pp. 408-411
Author(s):  
Xing Yang ◽  
Houjun Wang ◽  
Ke Liu ◽  
Yindong Xiao
Keyword(s):  
Linear Programming ◽  
Low Complexity ◽  
Fir Filters ◽  
Digital Fir Filters ◽  
Minimax Design
Sign in / Sign up

Export Citation Format

Share Document