论文信息 - Orthogonal matching pursuit with DCD iterations

Orthogonal matching pursuit with DCD iterations

Greedy algorithms are computationally efficient optimisation techniques for solving sparse recovery problems. Matching pursuit (MP) and orthogonal MP (OMP) are popular greedy algorithms; MP possesses the lowest complexity whereas OMP provides better performance. In this reported work, OMP is modified using dichotomous coordinate descent (DCD) iterations and an algorithm is arrived at that has performance close to that of OMP and complexity even lower than that of MP.

Yuriy Zakharov | Vitor H. Nascimento

[1] Jie Liu,et al. Promoting Access to White Rose Research Papers Low-complexity Rls Algorithms Using Dichotomous Coordinate Descent Iterations , 2022 .

[2] Mike E. Davies,et al. Gradient Pursuits , 2008, IEEE Transactions on Signal Processing.

[3] Bhaskar D. Rao,et al. Sparse channel estimation via matching pursuit with application to equalization , 2002, IEEE Trans. Commun..

[4] Jie Liu,et al. Architecture and FPGA Design of Dichotomous Coordinate Descent Algorithms , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5] T. Tozer,et al. Multiplication-free iterative algorithm for LS problem , 2004 .