扫雷:一种新的快速有序统计CFAR算法

Carl L. Colena, Michael J. Russell, Stephen A. Braun
{"title":"扫雷:一种新的快速有序统计CFAR算法","authors":"Carl L. Colena, Michael J. Russell, Stephen A. Braun","doi":"10.1109/HPEC43674.2020.9286140","DOIUrl":null,"url":null,"abstract":"A novel algorithm named ‘Minesweeper’ was developed for computing the Ordered Statistic Constant False Alarm Rate (CFAR) in a computationally efficient and novel way. OS-CFAR processing chains are used in radar applications for noise-floor estimation and target discrimination. Unlike other approaches, this algorithm aims to minimize data reuse by using training cell geometry and an accumulation matrix to compute the noise estimate. Computing the OS-CFAR in this manner affords some unique efficiencies that are novel for this application. This includes runtime invariance by bit-depth of the input data and by training geometry. Three implementations of Minesweeper were developed and benchmarked. The Optimized GPU Implementation (GPU-OPT) performed the best in both throughput and latency for large inputs. This algorithm has potential for use in real-time GPU-accelerated SDR applications.","PeriodicalId":168544,"journal":{"name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minesweeper: A Novel and Fast Ordered-Statistic CFAR Algorithm\",\"authors\":\"Carl L. Colena, Michael J. Russell, Stephen A. Braun\",\"doi\":\"10.1109/HPEC43674.2020.9286140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel algorithm named ‘Minesweeper’ was developed for computing the Ordered Statistic Constant False Alarm Rate (CFAR) in a computationally efficient and novel way. OS-CFAR processing chains are used in radar applications for noise-floor estimation and target discrimination. Unlike other approaches, this algorithm aims to minimize data reuse by using training cell geometry and an accumulation matrix to compute the noise estimate. Computing the OS-CFAR in this manner affords some unique efficiencies that are novel for this application. This includes runtime invariance by bit-depth of the input data and by training geometry. Three implementations of Minesweeper were developed and benchmarked. The Optimized GPU Implementation (GPU-OPT) performed the best in both throughput and latency for large inputs. This algorithm has potential for use in real-time GPU-accelerated SDR applications.\",\"PeriodicalId\":168544,\"journal\":{\"name\":\"2020 IEEE High Performance Extreme Computing Conference (HPEC)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE High Performance Extreme Computing Conference (HPEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPEC43674.2020.9286140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPEC43674.2020.9286140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种计算有序统计常数虚警率(CFAR)的新算法“扫雷”(Minesweeper)。OS-CFAR处理链在雷达应用中用于噪声本底估计和目标识别。与其他方法不同,该算法旨在通过使用训练单元几何和累积矩阵来计算噪声估计,从而最大限度地减少数据重用。以这种方式计算OS-CFAR为这个应用程序提供了一些独特的效率。这包括输入数据的位深度和训练几何的运行时不变性。开发了扫雷的三种实现并进行了基准测试。优化的GPU实现(GPU- opt)在大输入的吞吐量和延迟方面都表现最好。该算法具有在实时gpu加速SDR应用中使用的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minesweeper: A Novel and Fast Ordered-Statistic CFAR Algorithm
A novel algorithm named ‘Minesweeper’ was developed for computing the Ordered Statistic Constant False Alarm Rate (CFAR) in a computationally efficient and novel way. OS-CFAR processing chains are used in radar applications for noise-floor estimation and target discrimination. Unlike other approaches, this algorithm aims to minimize data reuse by using training cell geometry and an accumulation matrix to compute the noise estimate. Computing the OS-CFAR in this manner affords some unique efficiencies that are novel for this application. This includes runtime invariance by bit-depth of the input data and by training geometry. Three implementations of Minesweeper were developed and benchmarked. The Optimized GPU Implementation (GPU-OPT) performed the best in both throughput and latency for large inputs. This algorithm has potential for use in real-time GPU-accelerated SDR applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信