{"title":"A Diversification Strategy for IIR Filter Design Using PSO","authors":"Y. Takase, K. Suyama","doi":"10.23919/APSIPA.2018.8659771","DOIUrl":null,"url":null,"abstract":"IIR (Infinite Impulse Response) filter design problem is a non-linear optimization problem. Because PSO (Particle Swarm Optimization) can enumerate solution candidates quickly, it is known as an effective method for such a problem. However, PSO has a drawback that tends to indicate a premature convergence due to a strong directivity. In this paper, PSS (Problem Space Stretch)-PSO is verified to avoid the local minimum stagnation. Several design examples are shown to present the effectiveness of the method.","PeriodicalId":287799,"journal":{"name":"2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/APSIPA.2018.8659771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
IIR (Infinite Impulse Response) filter design problem is a non-linear optimization problem. Because PSO (Particle Swarm Optimization) can enumerate solution candidates quickly, it is known as an effective method for such a problem. However, PSO has a drawback that tends to indicate a premature convergence due to a strong directivity. In this paper, PSS (Problem Space Stretch)-PSO is verified to avoid the local minimum stagnation. Several design examples are shown to present the effectiveness of the method.
无限脉冲响应滤波器设计问题是一个非线性优化问题。由于粒子群优化算法能够快速枚举候选解,因此被认为是解决这类问题的有效方法。然而,PSO有一个缺点,即由于强指向性,往往表明过早收敛。本文验证了PSS (Problem Space Stretch)-PSO算法可以避免局部最小停滞。算例表明了该方法的有效性。