Adaptive Greedy Algorithm With Application to Nonlinear Communications
| Title: | Adaptive Greedy Algorithm With Application to Nonlinear Communications |
| Author: |
Tarokh, Vahid; Mileounis, Garasimos; Babadi, Behtash; Kalouptsidis, Nicholas
Note: Order does not necessarily reflect citation order of authors. |
| Citation: | Mileounis, Garasimos, Behtash Babadi, Nicholas Kalouptsidis, and Vahid Tarokh. 2010. IEEE Transactions on Signal Processing 58(6): 5424024. |
| Full Text & Related Files: |
tsp_spadomp_2010.pdf (398.0Kb; PDF) 
|
| 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. |
| Published Version: | http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5424024 |
| Terms of Use: | This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP |
| Citable link to this page: | http://nrs.harvard.edu/urn-3:HUL.InstRepos:4687242 |
This item appears in the following Collection(s)
-
FAS Scholarly Articles [5137]
Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
Contact administrator regarding this item (to report mistakes or request changes)
