• DocumentCode
    1558014
  • Title

    Ranked Sparse Signal Support Detection

  • Author

    Fletcher, Alyson K. ; Rangan, Sundeep ; Goyal, Vivek K.

  • Author_Institution
    Dept. of Electr. Eng., Univ. of California, Santa Cruz, Santa Cruz, CA, USA
  • Volume
    60
  • Issue
    11
  • fYear
    2012
  • Firstpage
    5919
  • Lastpage
    5931
  • Abstract
    This paper considers the problem of detecting the support (sparsity pattern) of a sparse vector from random noisy measurements. Conditional power of a component of the sparse vector is defined as the energy conditioned on the component being nonzero. Analysis of a simplified version of orthogonal matching pursuit (OMP) called sequential OMP (SequOMP) demonstrates the importance of knowledge of the rankings of conditional powers. When the simple SequOMP algorithm is applied to components in nonincreasing order of conditional power, the detrimental effect of dynamic range on thresholding performance is eliminated. Furthermore, under the most favorable conditional powers, the performance of SequOMP approaches maximum likelihood performance at high signal-to-noise ratio.
  • Keywords
    iterative methods; maximum likelihood estimation; signal detection; SequOMP algorithm; SequOMP approaches; conditional powers; maximum likelihood performance; orthogonal matching pursuit; random noisy measurements; ranked sparse signal support detection; sequential OMP; signal-to-noise ratio; sparse vector; sparsity pattern; thresholding performance; Dynamic range; Heuristic algorithms; Matching pursuit algorithms; Maximum likelihood estimation; Signal to noise ratio; Vectors; Compressed sensing; convex optimization; lasso; maximum likelihood estimation; orthogonal matching pursuit; random matrices; sparse Bayesian learning; sparsity; thresholding;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/TSP.2012.2208957
  • Filename
    6241445