Skip to main navigation Skip to search Skip to main content

Iterative Sparse Channel Estimator Based on SpaRSA Approach

Xiaolin Shi, Honglei Wang, Shu-Hung Leung

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

In this paper, an iterative sparse channel estimation for orthogonal frequency division multiplex (OFDM) communication system is investigated based on the sparse reconstruction by separable approximation (SpaRSA), which is regarded as one of the fastest algorithms for l2-lj problem and can obtain its global optimal solution. The proposed estimator comprised of thresholding is applied to detect channel taps. Then, a modified SpaRSA with adaptive regularization parameter is used to refine the estimation of nonzero channel taps. Simulation results for typical sparse channels show effectiveness of the proposed algorithm over other existing methods.
Original languageEnglish
Title of host publicationProceedings of 2017 6th International Conference on Computer Science and Network Technology - ICCSNT 2017
PublisherIEEE
Pages356-360
ISBN (Electronic)9781538604939
ISBN (Print)9781538604922
DOIs
Publication statusPublished - Oct 2017
Event6th International Conference on Computer Science and Network Technology (ICCSNT 2017) - Dalian, China
Duration: 21 Oct 201722 Oct 2017

Conference

Conference6th International Conference on Computer Science and Network Technology (ICCSNT 2017)
PlaceChina
CityDalian
Period21/10/1722/10/17

Research Keywords

  • OFDM
  • sparse channel estimator
  • sparse reconstruction by separable approximation

Fingerprint

Dive into the research topics of 'Iterative Sparse Channel Estimator Based on SpaRSA Approach'. Together they form a unique fingerprint.

Cite this