Open AccessA review of optimisation and least-square problem methods on field programmable gate array-based orthogonal matching pursuit implementations
Author(s) -
Muhammad Muzakkir Mohd Nadzri,
Afandi Ahmad
Publication year - 2022
Publication title -
indonesian journal of electrical engineering and computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.241
H-Index - 17
eISSN - 2502-4760
pISSN - 2502-4752
DOI - 10.11591/ijeecs.v25.i2.pp920-930
Subject(s) - matching pursuit , field programmable gate array , implementation , computer science , software implementation , gate array , matching (statistics) , computer engineering , compressed sensing , software , field (mathematics) , power (physics) , square (algebra) , algorithm , computer hardware , mathematics , statistics , physics , geometry , quantum mechanics , pure mathematics , programming language
Orthogonal matching pursuit (OMP) is the most efficient algorithm used for the reconstruction of compressively sampled data signals in the implementation of compressive sensing. OMP operates in an iteration-based nature, which involves optimisation and least-square problem (LSP) as the main processes. However, optimisation and LSP processes comprise complex mathematical operations that are computationally demanding, and software-based implementations are slow, power-consuming, and unfit for real-time applications. To fill the research gap, we reviewed the optimisation and LSP techniques implemented on the FPGA platform as the hardware accelerator. Aspects that contributed to the performance, algorithm, and methods involved in the implemented works were discussed and compared. The methods were found to be improved when modified or combined. However, the best approach still depends on the requirement of the system to be developed, and this review is significant as a reference.