基于硬件SAT求解器的区域高效自动驾驶加速器

Yusuke Inuma, Yuko Hara-Azumi
{"title":"基于硬件SAT求解器的区域高效自动驾驶加速器","authors":"Yusuke Inuma, Yuko Hara-Azumi","doi":"10.1109/ICFPT56656.2022.9974200","DOIUrl":null,"url":null,"abstract":"Today's embedded systems applications consisting of a variety of tasks are becoming larger and more complex. Hence, when multiple tasks need to be accelerated, designing a dedicated accelerator for each task would be difficult on small devices due to large area overhead. In this study, we propose an efficient accelerator for autonomous driving, which is a theme of a design competition held at International Conference on Field Programmable Technology. Focusing on two key tasks (path planning and object detection), we formulate each of them as a satisfiability problem (SAT) and use a hardware SAT solver as a common accelerator for these tasks. We present efficient problem formulation methods for solving these tasks on a small FPGA. Experimental results show the effectiveness of our work for these tasks.","PeriodicalId":239314,"journal":{"name":"2022 International Conference on Field-Programmable Technology (ICFPT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hardware SAT Solver-based Area-efficient Accelerator for Autonomous Driving\",\"authors\":\"Yusuke Inuma, Yuko Hara-Azumi\",\"doi\":\"10.1109/ICFPT56656.2022.9974200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Today's embedded systems applications consisting of a variety of tasks are becoming larger and more complex. Hence, when multiple tasks need to be accelerated, designing a dedicated accelerator for each task would be difficult on small devices due to large area overhead. In this study, we propose an efficient accelerator for autonomous driving, which is a theme of a design competition held at International Conference on Field Programmable Technology. Focusing on two key tasks (path planning and object detection), we formulate each of them as a satisfiability problem (SAT) and use a hardware SAT solver as a common accelerator for these tasks. We present efficient problem formulation methods for solving these tasks on a small FPGA. Experimental results show the effectiveness of our work for these tasks.\",\"PeriodicalId\":239314,\"journal\":{\"name\":\"2022 International Conference on Field-Programmable Technology (ICFPT)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Field-Programmable Technology (ICFPT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFPT56656.2022.9974200\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Field-Programmable Technology (ICFPT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFPT56656.2022.9974200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

当今由各种任务组成的嵌入式系统应用程序正变得越来越大,越来越复杂。因此,当需要加速多个任务时,由于面积开销大,在小型设备上为每个任务设计专用加速器将是困难的。在这项研究中,我们提出了一种高效的自动驾驶加速器,这是在国际现场可编程技术会议上举行的设计竞赛的主题。重点关注两个关键任务(路径规划和目标检测),我们将每个任务都表述为可满足性问题(SAT),并使用硬件SAT求解器作为这些任务的通用加速器。我们提出了在小型FPGA上解决这些任务的有效问题表述方法。实验结果表明我们的工作对这些任务是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hardware SAT Solver-based Area-efficient Accelerator for Autonomous Driving
Today's embedded systems applications consisting of a variety of tasks are becoming larger and more complex. Hence, when multiple tasks need to be accelerated, designing a dedicated accelerator for each task would be difficult on small devices due to large area overhead. In this study, we propose an efficient accelerator for autonomous driving, which is a theme of a design competition held at International Conference on Field Programmable Technology. Focusing on two key tasks (path planning and object detection), we formulate each of them as a satisfiability problem (SAT) and use a hardware SAT solver as a common accelerator for these tasks. We present efficient problem formulation methods for solving these tasks on a small FPGA. Experimental results show the effectiveness of our work for these tasks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信