基于FPGA的稀疏贝叶斯到达方向学习

H. Groll, C. Mecklenbräuker, P. Gerstoft
{"title":"基于FPGA的稀疏贝叶斯到达方向学习","authors":"H. Groll, C. Mecklenbräuker, P. Gerstoft","doi":"10.1109/SSP.2018.8450684","DOIUrl":null,"url":null,"abstract":"A direction of arrival (DOA) estimator based on sparse Bayesian learning (SBL) is implemented as a fixed-point arithmetic prototype for an FPGA platform. The prototype is developed from a known algorithm mainly using high-level synthesis with C++ based model specifications. The specialized equations of the algorithm are reduced to arithmetic operations considering the signal flow within the iterative structure. Cholesky factorization is used to solve the matrix inverse problem. Scheduling of each module is done as soon as possible to make use of the parallel FPGA architecture. Different fixed-point word length assumptions are explained and implementation results are shown in terms of resources and latency. Finally, a representative DOA source scenario is simulated and tested with the implemented prototype hardware in the loop. The comparison with a floating-point reference implementation is found to have good agreement with the fixed-point implementation.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"439 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Sparse Bayesian Learning for Directions of Arrival on an FPGA\",\"authors\":\"H. Groll, C. Mecklenbräuker, P. Gerstoft\",\"doi\":\"10.1109/SSP.2018.8450684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A direction of arrival (DOA) estimator based on sparse Bayesian learning (SBL) is implemented as a fixed-point arithmetic prototype for an FPGA platform. The prototype is developed from a known algorithm mainly using high-level synthesis with C++ based model specifications. The specialized equations of the algorithm are reduced to arithmetic operations considering the signal flow within the iterative structure. Cholesky factorization is used to solve the matrix inverse problem. Scheduling of each module is done as soon as possible to make use of the parallel FPGA architecture. Different fixed-point word length assumptions are explained and implementation results are shown in terms of resources and latency. Finally, a representative DOA source scenario is simulated and tested with the implemented prototype hardware in the loop. The comparison with a floating-point reference implementation is found to have good agreement with the fixed-point implementation.\",\"PeriodicalId\":330528,\"journal\":{\"name\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"volume\":\"439 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSP.2018.8450684\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP.2018.8450684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

该原型是根据已知算法开发的,主要使用基于c++的模型规范进行高级综合。考虑到迭代结构中的信号流,将算法的专门化方程简化为算术运算。利用乔列斯基分解法求解矩阵逆问题。为了充分利用并行FPGA架构,在最短时间内完成各模块的调度。解释了不同的定点字长假设,并根据资源和延迟显示了实现结果。最后,对一个典型的DOA源场景进行了仿真,并在环路中使用实现的原型硬件进行了测试。通过与浮点参考实现的比较,发现其与定点实现有很好的一致性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sparse Bayesian Learning for Directions of Arrival on an FPGA
A direction of arrival (DOA) estimator based on sparse Bayesian learning (SBL) is implemented as a fixed-point arithmetic prototype for an FPGA platform. The prototype is developed from a known algorithm mainly using high-level synthesis with C++ based model specifications. The specialized equations of the algorithm are reduced to arithmetic operations considering the signal flow within the iterative structure. Cholesky factorization is used to solve the matrix inverse problem. Scheduling of each module is done as soon as possible to make use of the parallel FPGA architecture. Different fixed-point word length assumptions are explained and implementation results are shown in terms of resources and latency. Finally, a representative DOA source scenario is simulated and tested with the implemented prototype hardware in the loop. The comparison with a floating-point reference implementation is found to have good agreement with the fixed-point implementation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信