Min-Max Approximation of Transfer Functions With Application to Filter Design

被引:4
|
作者
Li, Xianwei [1 ]
Gao, Huijun [1 ,2 ]
机构
[1] Harbin Inst Technol, Res Inst Intelligent Control & Syst, Harbin 150080, Peoples R China
[2] King Abdulaziz Univ, Jeddah 21413, Saudi Arabia
基金
中国国家自然科学基金;
关键词
Model approximation; transfer function; infinite impulsive response (IIR); digital filter; INFINITY MODEL-REDUCTION; PHASE IIR FILTERS; BALANCED TRUNCATION; SYSTEMS; TIME; INEQUALITIES; FIR;
D O I
10.1109/TSP.2014.2364787
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the problem of frequency-specific (FS) model approximation of transfer functions using a min-max approach. The objective is to find an approximation model for a transfer function such that the maximum error gain over a specific frequency range is minimized. First, a linear matrix inequality condition characterizing the FS gain of a transfer function is derived by using the generalized Kalman-Yakubovich-Popov lemma, and then a simple iterative approach is proposed to optimize the approximation model. Numerical experiments show that the proposed approach can produce better approximation models over a specific frequency range than some existing approaches. Moreover, it is indicated how to apply the proposed approximation approach to the design problem of infinite impulsive response digital filters, and design examples clearly illustrate that the proposed design flow can generate filters comparable with the latest design method.
引用
收藏
页码:31 / 40
页数:10
相关论文
共 50 条
  • [1] Min-Max IIR Filter Design for Feedback Quantizers
    Ohno, Shuichi
    Tariq, M. Rizwan
    Nagahara, Masaaki
    2017 ASIA-PACIFIC SIGNAL AND INFORMATION PROCESSING ASSOCIATION ANNUAL SUMMIT AND CONFERENCE (APSIPA ASC 2017), 2017, : 938 - 942
  • [2] MIN-MAX CLASSIFIERS - LEARNABILITY, DESIGN AND APPLICATION
    YANG, PF
    MARAGOS, P
    PATTERN RECOGNITION, 1995, 28 (06) : 879 - 899
  • [3] APPROXIMATION BY ISOTONE FUNCTIONS - MIN-MAX FORM OF BEST APPROXIMATION - PRELIMINARY REPORT
    UBHAYA, VA
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (02): : A307 - A307
  • [4] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
    Aissi H.
    4OR, 2006, 4 (4) : 347 - 350
  • [5] Parallel Approximation of Min-Max Problems
    Gus Gutoski
    Xiaodi Wu
    computational complexity, 2013, 22 : 385 - 428
  • [6] Parallel Approximation of Min-Max Problems
    Gutoski, Gus
    Wu, Xiaodi
    COMPUTATIONAL COMPLEXITY, 2013, 22 (02) : 385 - 428
  • [7] Approximation of min-max and min-max regret versions of some combinatorial optimization problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 281 - 290
  • [8] On Topological Properties of Min-Max Functions
    Dominik Dorsch
    Hubertus Th. Jongen
    Vladimir Shikhman
    Set-Valued and Variational Analysis, 2011, 19 : 237 - 253
  • [9] On Topological Properties of Min-Max Functions
    Dorsch, Dominik
    Jongen, Hubertus Th.
    Shikhman, Vladimir
    SET-VALUED AND VARIATIONAL ANALYSIS, 2011, 19 (02) : 237 - 253
  • [10] The duality theorem for min-max functions
    Gaubert, S
    Gunawardena, J
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1998, 326 (01): : 43 - 48