蚁群算法在CSD系数FIR滤波器设计中的有效性

Tomohiro Sasahara, K. Suyama
{"title":"蚁群算法在CSD系数FIR滤波器设计中的有效性","authors":"Tomohiro Sasahara, K. Suyama","doi":"10.1109/ISPACS.2015.7432839","DOIUrl":null,"url":null,"abstract":"In this paper, a CSD (Canonic Signed Digit) coefficient FIR (Finite Impulse Response) filter design approach based on ACO (Ant Colony Optimization) is studied. This design problem is formulated as a combinatorial optimization problem. It requires high computation time to obtain an optimal solution. Instead, several heuristic approaches have been developed for solving this problem in a reasonable computation time. ACO is one of the promising approaches and is appropriate for solving the combinatorial optimization problem. Therefore, we proposed ACO approach for design of CSD coefficient FIR filters. In the design examples, our method is compared with the other heuristic approaches and it is shown that our method is effective for the design of CSD coefficient FIR filters. Furthermore, our method is applied to the binary coefficient FIR filter design. As s result, it is shown that our method is significantly suitable for the CSD coefficient FIR filter design.","PeriodicalId":238787,"journal":{"name":"2015 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An effectiveness of ACO approach in design of CSD coefficient FIR filters\",\"authors\":\"Tomohiro Sasahara, K. Suyama\",\"doi\":\"10.1109/ISPACS.2015.7432839\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a CSD (Canonic Signed Digit) coefficient FIR (Finite Impulse Response) filter design approach based on ACO (Ant Colony Optimization) is studied. This design problem is formulated as a combinatorial optimization problem. It requires high computation time to obtain an optimal solution. Instead, several heuristic approaches have been developed for solving this problem in a reasonable computation time. ACO is one of the promising approaches and is appropriate for solving the combinatorial optimization problem. Therefore, we proposed ACO approach for design of CSD coefficient FIR filters. In the design examples, our method is compared with the other heuristic approaches and it is shown that our method is effective for the design of CSD coefficient FIR filters. Furthermore, our method is applied to the binary coefficient FIR filter design. As s result, it is shown that our method is significantly suitable for the CSD coefficient FIR filter design.\",\"PeriodicalId\":238787,\"journal\":{\"name\":\"2015 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPACS.2015.7432839\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS.2015.7432839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了一种基于蚁群算法的CSD (Canonic Signed Digit)系数FIR (Finite Impulse Response)滤波器设计方法。这个设计问题被表述为一个组合优化问题。它需要很高的计算时间来获得最优解。为了在合理的计算时间内解决这个问题,已经开发了几种启发式方法。蚁群算法是求解组合优化问题的一种很有前途的方法。因此,我们提出了蚁群算法来设计CSD系数FIR滤波器。在设计实例中,将本文方法与其他启发式方法进行了比较,结果表明本文方法对于设计CSD系数FIR滤波器是有效的。并将该方法应用于二值系数FIR滤波器的设计中。结果表明,该方法明显适用于CSD系数FIR滤波器的设计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An effectiveness of ACO approach in design of CSD coefficient FIR filters
In this paper, a CSD (Canonic Signed Digit) coefficient FIR (Finite Impulse Response) filter design approach based on ACO (Ant Colony Optimization) is studied. This design problem is formulated as a combinatorial optimization problem. It requires high computation time to obtain an optimal solution. Instead, several heuristic approaches have been developed for solving this problem in a reasonable computation time. ACO is one of the promising approaches and is appropriate for solving the combinatorial optimization problem. Therefore, we proposed ACO approach for design of CSD coefficient FIR filters. In the design examples, our method is compared with the other heuristic approaches and it is shown that our method is effective for the design of CSD coefficient FIR filters. Furthermore, our method is applied to the binary coefficient FIR filter design. As s result, it is shown that our method is significantly suitable for the CSD coefficient FIR filter design.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信