Sparse channel estimation via matching pursuit with application to equalization

Channels with a sparse impulse response arise in a number of communication applications. Exploiting the sparsity of the channel, we show how an estimate of the channel may be obtained using a matching pursuit (MP) algorithm. This estimate is compared to thresholded variants of the least squares (LS)...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 50; no. 3; pp. 374 - 377
Main Authors Cotter, S.F., Rao, B.D.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Broadband communication
Channel estimation
Channels
Delay estimation
Equalization
Estimates
HDTV
Impulse response
Least squares approximation
Least squares method
Matching
Matching pursuit algorithms
Pursuit algorithms
Throughput
Training
White noise
Online AccessGet full text

Cover

More Information
Summary:Channels with a sparse impulse response arise in a number of communication applications. Exploiting the sparsity of the channel, we show how an estimate of the channel may be obtained using a matching pursuit (MP) algorithm. This estimate is compared to thresholded variants of the least squares (LS) channel estimate. Among these sparse channel estimates, the MP estimate is computationally much simpler to implement and a shorter training sequence is required to form an accurate channel estimate leading to greater information throughput.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/26.990897