{"title":"The modified iterative detector/estimator algorithm for sparse channel estimation","authors":"Feng Wan, U. Mitra, A. Molisch","doi":"10.1109/OCEANS.2010.5664395","DOIUrl":null,"url":null,"abstract":"Underwater acoustic channels exhibit very long delay spreads, but with limited multipath. In this paper, a novel strategy for the estimation of sparse underwater channels is developed. A modified iterative detector/estimator (IDE) algorithm is proposed by replacing the parallel thresholding approach in a previously developed IDE algorithm by an approach wherein a single threshold is varied for each iteration of the algorithm. The new method offers improved performance over the original IDE algorithm as well as the current state-of-art compressed sensing-based methods, such as the iterative hard thresholding (IHT), the Haupt-Nowak (HN) and the orthogonal matching pursuit (OMP) algorithms. A preliminary mean-squared error analysis of the MIDE algorithm provides insight as to its improved performance. Numerical results are provided to compare and contrast the various sparse estimation strategies.","PeriodicalId":363534,"journal":{"name":"OCEANS 2010 MTS/IEEE SEATTLE","volume":"231 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"OCEANS 2010 MTS/IEEE SEATTLE","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OCEANS.2010.5664395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Underwater acoustic channels exhibit very long delay spreads, but with limited multipath. In this paper, a novel strategy for the estimation of sparse underwater channels is developed. A modified iterative detector/estimator (IDE) algorithm is proposed by replacing the parallel thresholding approach in a previously developed IDE algorithm by an approach wherein a single threshold is varied for each iteration of the algorithm. The new method offers improved performance over the original IDE algorithm as well as the current state-of-art compressed sensing-based methods, such as the iterative hard thresholding (IHT), the Haupt-Nowak (HN) and the orthogonal matching pursuit (OMP) algorithms. A preliminary mean-squared error analysis of the MIDE algorithm provides insight as to its improved performance. Numerical results are provided to compare and contrast the various sparse estimation strategies.