Journal
IEEE COMMUNICATIONS LETTERS
Volume 18, Issue 10, Pages 1851-1854Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2014.2354392
Keywords
Compressed sensing; sparse signal recovery; greedy algorithms; Multipath Matching Pursuit (MMP)
Categories
Funding
- Seokyeong University
- National Research Foundation of Korea - Korea government (MEST) [2013056520]
Ask authors/readers for more resources
In this paper, we consider a detection problem of the underdetermined system when the input vector is sparse and its elements are chosen from a set of finite alphabets. This scenario is popular and embraces many of current and future wireless communication systems. We show that a simple modification of multipath matching pursuit (MMP), recently proposed parallel greedy search algorithm, is effective in recovering the discrete and sparse input signals. We also show that the addition of cross validation (CV) to the MMP algorithm is effective in identifying the sparsity level of input vector.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available