Referenced Items are not available for this document.
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 in:
Signal Processing, IEEE Transactions on
(Volume:58
,
Issue:
6
)
Date of Publication: June 2010
- Page(s):
- 2998 - 3007
- ISSN :
- 1053-587X
- INSPEC Accession Number:
- 11304815
- Digital Object Identifier :
- 10.1109/TSP.2010.2044841
- Product Type:
- Journals & Magazines
- Date of Publication :
- 04 March 2010
- Date of Current Version :
- 13 May 2010
- Issue Date :
- June 2010
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
