Loading...

An alternating minimization method for sparse channel estimation

Niazadeh, R ; Sharif University of Technology | 2010

673 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-15995-4_40
  3. Publisher: 2010
  4. Abstract:
  5. The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions. In this paper, we have developed an algorithm based on Iterative Alternating Minimization technique which iteratively detects the location and the value of the channel taps. In fact, at each iteration we use an approximate Maximum A posteriori Probability (MAP) scheme for detection of the taps, while a least square method is used for estimating the values of the taps at each iteration. For approximate MAP detection, we have proposed three different methods leading to three variants for our algorithm. Finally, we experimentally compared the new algorithms to the Cramér-Rao lower bound of the estimation based on knowing the locations of the taps. We experimentally show that by selecting appropriate preliminaries for our algorithm, one of its variants almost reaches the Cramér-Rao bound for high SNR, while the others always achieve good performance
  6. Keywords:
  7. Alternating minimization ; Channel taps ; High SNR ; Least square methods ; Lower bounds ; MAP detection ; Maximum A posteriori probabilities ; Sparse channels ; Wireless transmissions ; Acoustic fields ; Algorithms ; Iterative methods ; Least squares approximations ; Location ; Optimization ; Signal detection ; Underwater acoustics ; Estimation
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 27 September 2010 through 30 September 2010, St. Malo ; Volume 6365 LNCS , 2010 , Pages 319-327 ; 03029743 (ISSN) ; 364215994X (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-15995-4_40