We propose a variant of OMP algorithm named BROMP for sparse solution. In our algorithm, the update rule of MP algorithm is employed to reduce the number of least square calculations and the refining strategy is introduced to further improve its performance. Simulations show that the proposed algorithm performs better than the OMP algorithm with significantly lower complexity.
Ying JI
Nanjing University of Posts and Telecommunications
Xiaofu WU
Nanjing University of Posts and Telecommunications
Jun YAN
Nanjing University of Posts and Telecommunications
Wei-ping ZHU
Nanjing University of Posts and Telecommunications
Zhen YANG
Nanjing University of Posts and Telecommunications
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ying JI, Xiaofu WU, Jun YAN, Wei-ping ZHU, Zhen YANG, "Block-Refined Orthogonal Matching Pursuit for Sparse Signal Recovery" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 8, pp. 1787-1790, August 2014, doi: 10.1587/transfun.E97.A.1787.
Abstract: We propose a variant of OMP algorithm named BROMP for sparse solution. In our algorithm, the update rule of MP algorithm is employed to reduce the number of least square calculations and the refining strategy is introduced to further improve its performance. Simulations show that the proposed algorithm performs better than the OMP algorithm with significantly lower complexity.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1787/_p
Copy
@ARTICLE{e97-a_8_1787,
author={Ying JI, Xiaofu WU, Jun YAN, Wei-ping ZHU, Zhen YANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Block-Refined Orthogonal Matching Pursuit for Sparse Signal Recovery},
year={2014},
volume={E97-A},
number={8},
pages={1787-1790},
abstract={We propose a variant of OMP algorithm named BROMP for sparse solution. In our algorithm, the update rule of MP algorithm is employed to reduce the number of least square calculations and the refining strategy is introduced to further improve its performance. Simulations show that the proposed algorithm performs better than the OMP algorithm with significantly lower complexity.},
keywords={},
doi={10.1587/transfun.E97.A.1787},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Block-Refined Orthogonal Matching Pursuit for Sparse Signal Recovery
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1787
EP - 1790
AU - Ying JI
AU - Xiaofu WU
AU - Jun YAN
AU - Wei-ping ZHU
AU - Zhen YANG
PY - 2014
DO - 10.1587/transfun.E97.A.1787
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2014
AB - We propose a variant of OMP algorithm named BROMP for sparse solution. In our algorithm, the update rule of MP algorithm is employed to reduce the number of least square calculations and the refining strategy is introduced to further improve its performance. Simulations show that the proposed algorithm performs better than the OMP algorithm with significantly lower complexity.
ER -