The Implementation of the Improved OMP for AIC Reconstruction Based on Parallel Index Selection
The Implementation of the Improved OMP for AIC Reconstruction Based on Parallel Index Selection
复制标题
基于并行索引选择的改进OMP AIC重构的实现
DOI:
10.1109/tvlsi.2017.2765677
复制
发表时间:
2017
影响因子:
2.8
通讯作者:
Haojiang Wang
中科院分区:
文献类型:
--
作者:
Sujuan Liu;Ning Lyu;Haojiang Wang
Sparse signal recovery becomes extremely challenging for a variety of real-time applications. In this paper, we improve the orthogonal matching pursuit (OMP) algorithm based on parallel correlation indices selection mechanism in each iteration and Goldschmidt algorithm. Simulation results show that the improved OMP algorithm with a reduced number of iterations and low hardware complexity of matrix operations has higher success rate and recovery signal-to-noise-ratio (RSNR) for sparse signal recovery. This paper presents an efficient complex-valued system hardware architecture of the recovery algorithm for analog-to-information structure based on compressive sensing. The proposed architecture is implemented and validated on the Xilinx Virtex6 field-programmable gate array (FPGA) for signal reconstruction with <inline-formula> <tex-math notation="LaTeX">$N = 1024$ </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">$K = 36$ </tex-math></inline-formula>, and <inline-formula> <tex-math notation="LaTeX">$M = 256$ </tex-math></inline-formula>. The implementation results showed that the improved OMP algorithm achieved a higher RSNR of 31.04 dB compared with the original OMP algorithm. This synthesized design consumes a few percentages of the hardware resources of the FPGA chip with the clock frequency of 135.4 MHZ and reconstruction time of <inline-formula> <tex-math notation="LaTeX">$170~\mu \text{s}$ </tex-math></inline-formula>, which is faster than the existing design.