Abstract

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 μs and 256-length signals with K = 8 and K = 12 in 23.27 μs and 39.56 μs respectively. The results also show that our design outperforms many other existing FPGA implementations in terms of power consumption.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call