Efficient Implementations for Orthogonal Matching Pursuit
Based on the efficient inverse Cholesky factorization, we propose an implementation of OMP (called as version 0, i.e., v0) and its four memory-saving versions (i.e., the proposed v1, v2, v3 and v4). In the simulations, the proposed five versions and the existing OMP implementations have nearly the s...
Main Authors: | Hufei Zhu, Wen Chen, Yanpeng Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-09-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/9/9/1507 |
Similar Items
-
Compressive sensing based PAPR reduction in OFDM systems: Modified orthogonal matching pursuit approach
by: Ghanbar Azarnia, et al.
Published: (2020-12-01) -
Dynamic Orthogonal Matching Pursuit for Sparse Data Reconstruction
by: Yun-Bin Zhao, et al.
Published: (2023-01-01) -
Reduced Computational Complexity Orthogonal Matching Pursuit Using a Novel Partitioned Inversion Technique for Compressive Sensing
by: Seonggeon Kim, et al.
Published: (2018-09-01) -
Recuperación de señales dispersas utilizando orthogonal matching pursuit (OMP)
by: Adriana Patricia Lobato Polo, et al.
Published: (2009-05-01) -
An Improved Orthogonal Matching Pursuit Algorithm for CS-Based Channel Estimation
by: Lu Si, et al.
Published: (2023-11-01)