An adaptive greedy algorithm with application to nonlinear communications

  • Authors:
  • Gerasimos Mileounis;Behtash Babadi;Nicholas Kalouptsidis;Vahid Tarokh

  • Affiliations:
  • Department of Informatics and Telecommunications, Division of Communications and Signal Processing, University of Athens, Greece;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA;Department of Informatics and Telecommunications, Division of Communications and Signal Processing, University of Athens, Greece;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2010

Quantified Score

Hi-index 35.68

Visualization

Abstract

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.