Sparsity analysis using a mixed approach with greedy and LS algorithms on channel estimation

Nilson Maciel De Paiva, Elaine Crespo Marques, Lirida Alves De Barros Naviner

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

Abstract

Various channels can be denoted by sparse channels and many algorithms have been proposed to exploit their sparsity. In this paper, we propose a mixed algorithm based on Greedy and LS algorithms for sparse channel estimation. Analyses of the proposed and commonly used algorithms in terms of performance and complexity are performed considering the channel's sparsity, the length of training sequence and the stopping criterion. Our results show that a suitable trade-off can be found and effective channel estimations can be obtained with a low-cost algorithm.

Original languageEnglish
Title of host publication2017 3rd International Conference on Frontiers of Signal Processing, ICFSP 2017
EditorsKrzysztof Szczypiorski
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages91-95
Number of pages5
ISBN (Electronic)9781538610374
DOIs
Publication statusPublished - 3 Nov 2017
Externally publishedYes
Event3rd International Conference on Frontiers of Signal Processing, ICFSP 2017 - Paris, France
Duration: 6 Sept 20178 Sept 2017

Publication series

Name2017 3rd International Conference on Frontiers of Signal Processing, ICFSP 2017

Conference

Conference3rd International Conference on Frontiers of Signal Processing, ICFSP 2017
Country/TerritoryFrance
CityParis
Period6/09/178/09/17

Keywords

  • compressive sensing
  • greedy algorithms
  • sparse channel estimation

Fingerprint

Dive into the research topics of 'Sparsity analysis using a mixed approach with greedy and LS algorithms on channel estimation'. Together they form a unique fingerprint.

Cite this