High‐throughput and low‐area implementation of orthogonal matching pursuit algorithm for compressive sensing reconstruction
| Autor: | Sang Yoon Park, Woo Hyun Son, Luong Tran Nhat Trung, Vu Quan Nguyen, Marek Parfieniuk |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
General Computer Science
Signal reconstruction Computer science distributed arithmetic (da) pipelined structure lcsh:Electronics lcsh:TK7800-8360 Orthogonal matching pursuit algorithm lcsh:Telecommunication Electronic Optical and Magnetic Materials Compressed sensing compressive sensing (cs) lcsh:TK5101-6720 signal reconstruction orthogonal matching pursuit (omp) Electrical and Electronic Engineering Throughput (business) Algorithm |
| Zdroj: | ETRI Journal, Vol 42, Iss 3, Pp 376-387 (2019) |
| ISSN: | 2233-7326 1225-6463 |
| DOI: | 10.4218/etrij.2019-0067 |
| Popis: | 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 for N = 256, M = 64, and m = 16, where N is the number of the original samples, M is the length of the measurement vector, and m is the sparsity level of the signal. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text