Please use this identifier to cite or link to this item:
|Title:||New sparse adaptive algorithms based on the natural gradient and the L 0-norm||Authors:||Pelekanakis, K.
|Keywords:||Acoustic echo cancellation
improved- proportionate normalized least mean square (IPNLMS)
improved-proportionate affine projection algorithm (IPAPA)
sparse recursive least squares (RLS)
underwater acoustic communications
|Issue Date:||2013||Citation:||Pelekanakis, K., Chitre, M. (2013). New sparse adaptive algorithms based on the natural gradient and the L 0-norm. IEEE Journal of Oceanic Engineering 38 (2) : 323-332. ScholarBank@NUS Repository. https://doi.org/10.1109/JOE.2012.2221811||Abstract:||A new algorithmic framework for sparse channel identification is proposed. Although the focus of this paper is on sparse underwater acoustic channels, this framework can be applied in any field where sequential noisy signal samples are obtained from a linear time-varying system. A suit of new algorithms is derived by minimizing a differentiable cost function that utilizes the underlying Riemannian structure of the channel as well as the L0-norm of the complex-valued channel taps. The sparseness effect of the proposed algorithms is successfully demonstrated by estimating a mobile shallow-water acoustic channel. The clear superiority of the new algorithms over state-of-the-art sparse adaptive algorithms is shown. Moreover, the proposed algorithms are employed by a channel-estimate-based decision-feedback equalizer (CEB DFE). These CEB DFE structures are compared with a direct-adaptation DFE (DA DFE), which is based on sparse and nonsparse adaptation. Our results confirm the improved error-rate performance of the new CEB DFEs when the channel is sparse. © 1976-2012 IEEE.||Source Title:||IEEE Journal of Oceanic Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/82756||ISSN:||03649059||DOI:||10.1109/JOE.2012.2221811|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.