首页> 外文期刊>Computers and Electrical Engineering >High-speed FPGA implementation of orthogonal matching pursuit for compressive sensing signal reconstruction
【24h】

High-speed FPGA implementation of orthogonal matching pursuit for compressive sensing signal reconstruction

机译:高速FPGA对压缩传感信号重建的正交匹配追求的实现

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, a reconfigurable, high-speed, low-power, and vendor-independent field-programmable gate array (FPGA) implementation of the orthogonal matching pursuit (OMP) algorithm is presented. Unlike existing previous work, the proposed architecture is reconfigurable, that is, the architecture can accept different signal sizes, different sparsity levels, and sampling matrix sizes. Furthermore, the Goldschmidt algorithm is used to implement the fixed point division unit that achieves state-of-the-art performance. To the best of our knowledge, the presented architecture demonstrates the fastest reconstruction times for the standard OMP algorithm on FPGA for high sparsity levels. The proposed design is able to recover a 128-length signal with K = 5 in 7.75 and 256-length signals with K = 8 and K = 12 in 23.27 mu s and 39.56 mu s respectively. The results also show that our design outperforms many other existing FPGA implementations in terms of power consumption.
机译:在本文中,介绍了可重构的,高速,低功耗和不合适的无关场可编程门(FPGA)实现的正交匹配追踪(OMP)算法。 与现有的以前的工作不同,所提出的架构是可重构的,即架构可以接受不同的信号大小,不同的稀疏度水平和采样矩阵大小。 此外,Goldschmidt算法用于实现实现最先进的性能的固定点分频单元。 据我们所知,所呈现的架构展示了用于高稀疏度水平的FPGA标准OMP算法的最快重建时间。 所提出的设计能够在7.75和256长信号中恢复128长信号,分别在23.27μs和39.56μs中,分别在7.75和256长信号中用k = 5。 结果还表明,我们的设计在功耗方面优于许多其他现有的FPGA实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号