An improved greedy algorithm for sparse channel estimation

Geping Lin, Xiaochuan Ma, Shefeng Yan, Jincheng Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Sparse channel estimation has attracted much attention these years, especially in the area of under water acoustic communication. Compressed sensing methods are popular recently because of their efficiency and stability. In this paper, a stable and fast algorithm termed Selective Regularized Orthogonal Matching Pursuit (SROMP) is proposed based on Orthogonal Matching Pursuit (OMP). By numerical experiments, performance of this algorithm is shown in comparison to conventional LS(least square)algorithm, basic OMP and Stagewise OMP. Simulation results indicate that this methods can estimate sparse channel effectively and accurately outperforming LS and OMP.

Original languageEnglish
Title of host publicationProceedings of 6th International Conference on Intelligent Control and Information Processing, ICICIP 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages225-229
Number of pages5
ISBN (Electronic)9781479917174
DOIs
Publication statusPublished - 20 Jan 2016
Externally publishedYes
Event6th International Conference on Intelligent Control and Information Processing, ICICIP 2015 - Wuhan, Hubei, China
Duration: 26 Nov 201528 Nov 2015

Publication series

NameProceedings of 6th International Conference on Intelligent Control and Information Processing, ICICIP 2015

Conference

Conference6th International Conference on Intelligent Control and Information Processing, ICICIP 2015
Country/TerritoryChina
CityWuhan, Hubei
Period26/11/1528/11/15

Keywords

  • compressed sensing
  • selective regularized orthogonal matching pursuit
  • sparse channel estimation
  • water acoustic communication

Fingerprint

Dive into the research topics of 'An improved greedy algorithm for sparse channel estimation'. Together they form a unique fingerprint.

Cite this