An adaptive greedy algorithm with application to nonlinear communications

Published

Journal Article

Greedy algorithms form an essential tool for compressed sensing. However, their inherent batch mode discourages their use in time-varying environments due to significant complexity and storage requirements. In this paper two existing powerful greedy schemes developed in the literature are converted into an adaptive algorithm which is applied to estimation of a class of nonlinear communication systems. Performance is assessed via computer simulations on a variety of linear and nonlinear channels; all confirm significant improvements over conventional methods. © 2010 IEEE.

Full Text

Duke Authors

Cited Authors

  • Mileounis, G; Babadi, B; Kalouptsidis, N; Tarokh, V

Published Date

  • June 1, 2010

Published In

Volume / Issue

  • 58 / 6

Start / End Page

  • 2998 - 3007

International Standard Serial Number (ISSN)

  • 1053-587X

Digital Object Identifier (DOI)

  • 10.1109/TSP.2010.2044841

Citation Source

  • Scopus