基于遗传算法的领域可重构阵列引擎

Wing On Fung, T. Arslan, S. Khawam
{"title":"基于遗传算法的领域可重构阵列引擎","authors":"Wing On Fung, T. Arslan, S. Khawam","doi":"10.1109/AHS.2006.48","DOIUrl":null,"url":null,"abstract":"Domain-specific reconfigurable arrays have shown to provide an efficient trade-off between flexibility of FPGA and performance of ASIC circuit. Nonetheless, the design of these heterogeneous arrays is a labour intensive process. Furthermore, the manual creation of the array architecture could not have been fully optimised, hence limiting their performance. This paper presents a placement technique for mapping logic elements into heterogeneous reconfigurable arrays. At its core, it implements a genetic algorithm, which was used to reduce the span of all the interconnections as well as critical delay. It therefore minimises the amount of routing resource required in the architecture. The algorithm was tested on two arrays implementing DCT and speech coding. The resulting architecture achieves optimal close to that of an expert designer in a fraction of the time","PeriodicalId":232693,"journal":{"name":"First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Genetic Algorithm based Engine for Domain-Specific Reconfigurable Arrays\",\"authors\":\"Wing On Fung, T. Arslan, S. Khawam\",\"doi\":\"10.1109/AHS.2006.48\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Domain-specific reconfigurable arrays have shown to provide an efficient trade-off between flexibility of FPGA and performance of ASIC circuit. Nonetheless, the design of these heterogeneous arrays is a labour intensive process. Furthermore, the manual creation of the array architecture could not have been fully optimised, hence limiting their performance. This paper presents a placement technique for mapping logic elements into heterogeneous reconfigurable arrays. At its core, it implements a genetic algorithm, which was used to reduce the span of all the interconnections as well as critical delay. It therefore minimises the amount of routing resource required in the architecture. The algorithm was tested on two arrays implementing DCT and speech coding. The resulting architecture achieves optimal close to that of an expert designer in a fraction of the time\",\"PeriodicalId\":232693,\"journal\":{\"name\":\"First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06)\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AHS.2006.48\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AHS.2006.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

特定领域的可重构阵列在FPGA的灵活性和ASIC电路的性能之间提供了一种有效的权衡。尽管如此,这些异构阵列的设计是一个劳动密集型的过程。此外,阵列架构的手动创建无法完全优化,因此限制了它们的性能。本文提出了一种将逻辑元素映射到异构可重构阵列的放置技术。该算法的核心是实现遗传算法,该算法用于减少所有互连的跨度和临界延迟。因此,它最大限度地减少了体系结构中所需的路由资源。该算法在两个实现DCT和语音编码的阵列上进行了测试。最终的架构在很短的时间内达到了接近专家设计师的最佳效果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Genetic Algorithm based Engine for Domain-Specific Reconfigurable Arrays
Domain-specific reconfigurable arrays have shown to provide an efficient trade-off between flexibility of FPGA and performance of ASIC circuit. Nonetheless, the design of these heterogeneous arrays is a labour intensive process. Furthermore, the manual creation of the array architecture could not have been fully optimised, hence limiting their performance. This paper presents a placement technique for mapping logic elements into heterogeneous reconfigurable arrays. At its core, it implements a genetic algorithm, which was used to reduce the span of all the interconnections as well as critical delay. It therefore minimises the amount of routing resource required in the architecture. The algorithm was tested on two arrays implementing DCT and speech coding. The resulting architecture achieves optimal close to that of an expert designer in a fraction of the time
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信