首页> 外文期刊>Journal of the Franklin Institute >A novel design method for optimal IIR system identification using opposition based harmony search algorithm
【24h】

A novel design method for optimal IIR system identification using opposition based harmony search algorithm

机译:基于对立和声搜索算法的IIR系统最优识别的新设计方法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this paper a population based evolutionary optimization methodology called Opposition based Harmony Search Algorithm (OHS) is applied for the optimization of system coefficients of adaptive infinite impulse response (IIR) system identification problem. The original Harmony Search (HS) algorithm is chosen as the parent one and opposition based approach is applied to it with an intention to exhibit accelerated near global convergence profile. During the initialization, for choosing the randomly generated population/solution opposite solutions are also considered and the fitter one is selected as apriori guess for having faster convergence profile. Each solution in Harmony Memory (HM) is generated on the basis of memory consideration rule, a pitch adjustment rule and a re-initialization process which gives the optimum result corresponding to the least error fitness in multidimensional search space. Incorporation of different control parameters in basic HS algorithm results in balancing of exploration and exploitation of search space. The proposed OHS based system identification approach has alleviated from inherent drawbacks of premature convergence and stagnation, unlike Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Differential Evolution (DE). The simulation results obtained for some well known benchmark examples justify the efficacy of the proposed OHS based system identification approach over GA, PSO and DE in terms of convergence speed, identifying the system plant coefficients and mean square error (MSE) fitness values produced for both same order and reduced order models of adaptive IIR filters.
机译:本文将基于种群的进化优化方法称为基于对立的和谐搜索算法(OHS),用于自适应无限冲激响应(IIR)系统识别问题的系统系数优化。选择原始的Harmony Search(HS)算法作为父算法,并在其上应用基于对立的方法,以展示加速的接近全局收敛性。在初始化期间,为了选择随机生成的总体/解决方案,还考虑了相反的解决方案,并且选择了一个更合适的解决方案作为先验猜测,以具有更快的收敛速度。和谐记忆(HM)中的每个解决方案都是根据记忆考虑规则,音调调整规则和重新初始化过程生成的,该过程给出了对应于多维搜索空间中最小错误适合度的最佳结果。在基本HS算法中纳入不同的控制参数,可以平衡探索空间和探索空间的利用。与基于遗传算法(GA),粒子群优化(PSO)和差分进化(DE)的方法不同,所提出的基于OHS的系统识别方法已缓解了过早收敛和停滞的固有缺陷。从一些众所周知的基准示例获得的仿真结果证明了基于OHS的系统识别方法在收敛速度,GA,PSO和DE方面的有效性,并确定了针对这两种方法产生的系统工厂系数和均方误差(MSE)适应度值自适应IIR滤波器的相同阶次和降阶模型。

著录项

  • 来源
    《Journal of the Franklin Institute》 |2014年第5期|2454-2488|共35页
  • 作者单位

    Department of Electronics and Communication Engineering, NIT Durgapur, West Bengal, India;

    Department of Electronics and Communication Engineering, NIT Durgapur, West Bengal, India;

    Department of Electronics and Communication Engineering, NIT Durgapur, West Bengal, India;

    Department of Electrical Engineering, NIT Durgapur, West Bengal, India;

    Department of Electrical Engineering, ISM, Dhanbad, India;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号