首页> 外文期刊>ETRI journal >High‐throughput and low‐area implementation of orthogonal matching pursuit algorithm for compressive sensing reconstruction
【24h】

High‐throughput and low‐area implementation of orthogonal matching pursuit algorithm for compressive sensing reconstruction

机译:压缩传感重建正交匹配追踪算法的高通量和低区域实现

获取原文
           

摘要

Massive computation of the reconstruction algorithm for compressive sensing (CS) has been a major concern for its real‐time application. In this paper, we propose a novel high‐speed architecture for the orthogonal matching pursuit (OMP) algorithm, which is the most frequently used to reconstruct compressively sensed signals. The proposed design offers a very high throughput and includes an innovative pipeline architecture and scheduling algorithm. Least‐squares problem solving, which requires a huge amount of computations in the OMP, is implemented by using systolic arrays with four new processing elements. In addition, a distributed‐arithmetic‐based circuit for matrix multiplication is proposed to counterbalance the area overhead caused by the multi‐stage pipelining. The results of logic synthesis show that the proposed design reconstructs signals nearly 19 times faster while occupying an only 1.06 times larger area than the existing designs forN ?=?256,M ?=?64, andm ?=?16, whereN is the number of the original samples,M is the length of the measurement vector, andm is the sparsity level of the signal.
机译:对压缩感应的重建算法(CS)的大规模计算是其实时应用的主要问题。在本文中,我们提出了一种用于正交匹配追踪(OMP)算法的新型高速架构,其最常用于重建压缩感测的信号。该建议的设计提供了非常高的吞吐量,包括一种创新的管道架构和调度算法。通过使用具有四个新处理元件的收缩阵列来实现需要在OMP中实现大量计算的最小二乘问题解决。另外,提出了一种基于矩阵乘法的基于算术的电路,以平衡由多级流水线引起的面积开销。逻辑合成的结果表明,所提出的设计重建了近19倍的信号,同时占据大面积仅比现有设计更大的1.06倍?=Δ256, m?64,以及 m?=?16,其中 n是原始样本的数量, m是测量向量的长度,并且 m是信号的稀疏水平。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号