Design Issues and Challenges of an FPGA-based Orthogonal Matching Pursuit Implementation for Compressive Sensing Reconstruction

Muhammad Muzakkir Mohd Nadzri, Afandi Ahmad, Z. Tukiran
{"title":"Design Issues and Challenges of an FPGA-based Orthogonal Matching Pursuit Implementation for Compressive Sensing Reconstruction","authors":"Muhammad Muzakkir Mohd Nadzri, Afandi Ahmad, Z. Tukiran","doi":"10.1109/SCOReD50371.2020.9250973","DOIUrl":null,"url":null,"abstract":"Compressive sensing (CS) is as an evolving research area in signal processing due to the advantages offered for signal compression. Based on the sparsity of signals, CS allows the sampling of sparse signals under the sub-Nyquist rate, and yet promises a reliable data recovery. To date, the implementation of practical applications of CS in hardware platforms, especially in real-time applications, still faces challenging issues due to the high computational complexity of its algorithms, hence leading to high power-consuming processes. There are several CS reconstruction approaches, and orthogonal matching pursuit (OMP) is one of the best and popular algorithms implemented. However, this algorithm faces two (2) major process issues: optimisation and the least square problem. Due to OMP’s significant contribution, this paper presents an overview of the design issues and challenges of OMP algorithm implementation for CS reconstruction. The field-programmable gate array (FPGA) as a viable hardware solution for OMP implementation is reviewed and discussed based on reconstruction time, signal size, number of measurements, sparsity and features.","PeriodicalId":142867,"journal":{"name":"2020 IEEE Student Conference on Research and Development (SCOReD)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Student Conference on Research and Development (SCOReD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCOReD50371.2020.9250973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Compressive sensing (CS) is as an evolving research area in signal processing due to the advantages offered for signal compression. Based on the sparsity of signals, CS allows the sampling of sparse signals under the sub-Nyquist rate, and yet promises a reliable data recovery. To date, the implementation of practical applications of CS in hardware platforms, especially in real-time applications, still faces challenging issues due to the high computational complexity of its algorithms, hence leading to high power-consuming processes. There are several CS reconstruction approaches, and orthogonal matching pursuit (OMP) is one of the best and popular algorithms implemented. However, this algorithm faces two (2) major process issues: optimisation and the least square problem. Due to OMP’s significant contribution, this paper presents an overview of the design issues and challenges of OMP algorithm implementation for CS reconstruction. The field-programmable gate array (FPGA) as a viable hardware solution for OMP implementation is reviewed and discussed based on reconstruction time, signal size, number of measurements, sparsity and features.
基于fpga的压缩感知重构正交匹配追踪实现的设计问题与挑战
压缩感知(CS)由于其在信号压缩方面的优势而成为信号处理领域的一个新兴研究领域。基于信号的稀疏性,CS允许在亚奈奎斯特速率下对稀疏信号进行采样,并保证可靠的数据恢复。迄今为止,CS在硬件平台上的实际应用,特别是在实时应用中,由于其算法的高计算复杂度,导致了高功耗的过程,仍然面临着挑战性的问题。有几种CS重建方法,正交匹配追踪(OMP)是目前实现的最好和最流行的算法之一。然而,该算法面临两(2)个主要过程问题:优化和最小二乘问题。鉴于OMP的重要贡献,本文概述了用于CS重建的OMP算法实现的设计问题和挑战。基于重构时间、信号大小、测量次数、稀疏性和特征,对现场可编程门阵列(FPGA)作为OMP实现的可行硬件解决方案进行了回顾和讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信