正交镜滤波器组设计中的交叉优化算法

Sumika Chauhan, Manmohan Singh, Ashwani Kumar Agarwal
{"title":"正交镜滤波器组设计中的交叉优化算法","authors":"Sumika Chauhan, Manmohan Singh, Ashwani Kumar Agarwal","doi":"10.1109/ICCT46177.2019.8968779","DOIUrl":null,"url":null,"abstract":"During designing of two channel Quadrature Mirror Filter(QMF) bank, there occurs many errors such as peak reconstruction error, error in pass band, error in stop band, error in transition band and amplitude distortion. There are many meta-heuristic algorithms for the minimization of various errors of two channel QMF banks but they have drawbacks that either their convergence speed is slow or they have poor solution accuracy or premature convergence. In this paper, a concept of the Crisscross Optimization method for minimizing designing error of two channel linear phase QMF bank in frequency domain is introduced. This problem is taken as single objective function. The crisscross optimization algorithm makes use of two important operators that are horizontal crossover (HCX) and vertical crossover (VCX). The HCX operator works by dividing the problem space into simple hypercube with smaller search probability while VCX operator makes a way out for the stagnant dimensions which may be indifferentiable and cause premature convergence. The simulation results are compared with the modified particle swarm optimization, artificial bee colony, XSG and Levenberg Marquart method. From the comparison it is obvious that convergence speed and good solution accuracy.","PeriodicalId":118655,"journal":{"name":"2019 2nd International Conference on Intelligent Communication and Computational Techniques (ICCT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Crisscross Optimization Algorithm for the Designing of Quadrature Mirror Filter Bank\",\"authors\":\"Sumika Chauhan, Manmohan Singh, Ashwani Kumar Agarwal\",\"doi\":\"10.1109/ICCT46177.2019.8968779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"During designing of two channel Quadrature Mirror Filter(QMF) bank, there occurs many errors such as peak reconstruction error, error in pass band, error in stop band, error in transition band and amplitude distortion. There are many meta-heuristic algorithms for the minimization of various errors of two channel QMF banks but they have drawbacks that either their convergence speed is slow or they have poor solution accuracy or premature convergence. In this paper, a concept of the Crisscross Optimization method for minimizing designing error of two channel linear phase QMF bank in frequency domain is introduced. This problem is taken as single objective function. The crisscross optimization algorithm makes use of two important operators that are horizontal crossover (HCX) and vertical crossover (VCX). The HCX operator works by dividing the problem space into simple hypercube with smaller search probability while VCX operator makes a way out for the stagnant dimensions which may be indifferentiable and cause premature convergence. The simulation results are compared with the modified particle swarm optimization, artificial bee colony, XSG and Levenberg Marquart method. From the comparison it is obvious that convergence speed and good solution accuracy.\",\"PeriodicalId\":118655,\"journal\":{\"name\":\"2019 2nd International Conference on Intelligent Communication and Computational Techniques (ICCT)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 2nd International Conference on Intelligent Communication and Computational Techniques (ICCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT46177.2019.8968779\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 2nd International Conference on Intelligent Communication and Computational Techniques (ICCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT46177.2019.8968779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

在双通道正交镜滤波器组的设计过程中,存在峰值重构误差、通带误差、阻带误差、过渡带误差和幅度失真等多种误差。针对双通道QMF库的各种误差最小化问题,已有许多元启发式算法,但它们要么收敛速度慢,要么解精度差,要么过早收敛。本文提出了一种在频域上最小化双通道线性相位QMF组设计误差的交叉优化方法的概念。将该问题视为单目标函数。交叉优化算法利用了两个重要的算子:水平交叉(HCX)和垂直交叉(VCX)。HCX算子通过将问题空间划分为搜索概率较小的简单超立方体来工作,而VCX算子则为可能不可微且导致过早收敛的停滞维提供了出路。仿真结果与改进粒子群算法、人工蜂群算法、XSG算法和Levenberg Marquart算法进行了比较。比较表明,该方法具有较快的收敛速度和较好的求解精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Crisscross Optimization Algorithm for the Designing of Quadrature Mirror Filter Bank
During designing of two channel Quadrature Mirror Filter(QMF) bank, there occurs many errors such as peak reconstruction error, error in pass band, error in stop band, error in transition band and amplitude distortion. There are many meta-heuristic algorithms for the minimization of various errors of two channel QMF banks but they have drawbacks that either their convergence speed is slow or they have poor solution accuracy or premature convergence. In this paper, a concept of the Crisscross Optimization method for minimizing designing error of two channel linear phase QMF bank in frequency domain is introduced. This problem is taken as single objective function. The crisscross optimization algorithm makes use of two important operators that are horizontal crossover (HCX) and vertical crossover (VCX). The HCX operator works by dividing the problem space into simple hypercube with smaller search probability while VCX operator makes a way out for the stagnant dimensions which may be indifferentiable and cause premature convergence. The simulation results are compared with the modified particle swarm optimization, artificial bee colony, XSG and Levenberg Marquart method. From the comparison it is obvious that convergence speed and good solution accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信