Adaptive Greedy Algorithm With Application to Nonlinear Communications
MetadataShow full item record
CitationMileounis, Garasimos, Behtash Babadi, Nicholas Kalouptsidis, and Vahid Tarokh. 2010. IEEE Transactions on Signal Processing 58(6): 5424024.
AbstractGreedy 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4687242
- FAS Scholarly Articles