2011 IEEE 73rd Vehicular Technology Conference (VTC Spring) 2011
DOI: 10.1109/vetecs.2011.5956242
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Algorithm for Sparse Channel Estimation via Orthogonal Matching Pursuit

Abstract: Channels with a sparse impulse response arise in a variety of wireless communication applications, such as high definition television (HDTV) terrestrial transmission and underwater acoustic communications. By exploiting the sparsity of the channel, this paper proposes a fast algorithm for sparse channel estimation based on a greedy algorithm called orthogonal matching pursuit (OMP). The proposed fast OMP-based channel estimation algorithm has a low computational complexity of O (KN log N ) with K and N the cha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 19 publications
0
7
0
Order By: Relevance
“…The OMP based channel estimators have been used to estimate channels with sparse channel impulse response [8] as well as to estimate sparse channels in hybrid MIMO systems [3]. Different implementations of the OMP algorithms have been described in [9].…”
Section: Orthogonal Matching Pursuit Algorithmmentioning
confidence: 99%
“…The OMP based channel estimators have been used to estimate channels with sparse channel impulse response [8] as well as to estimate sparse channels in hybrid MIMO systems [3]. Different implementations of the OMP algorithms have been described in [9].…”
Section: Orthogonal Matching Pursuit Algorithmmentioning
confidence: 99%
“…We reduce the complexity of this process by a fast implementation of the sparse channel estimator, which is referred to as the FMP algorithm. Following the scheme in [27], we approximate the matrix-vector multiplication in the BMP through FFT operations. The BMP algorithm aims to find the sparsest solution to the linear system y y y = Ch Ch Ch + η η η, where y y y = [y(0), y(1), ..., y(N − 1)] T , h h h = [h(0), h(1), ..., h(L − 1)] T and the noise vector η η η = [η(0), η(1), ..., η(N − 1)] T .…”
Section: Channel Estimationmentioning
confidence: 99%
“…wideband antenna, wideband radio frequency front-end, and high speed Analog-to-Digital Converter (ADC). [12] and [13] developed the wideband antenna and the wideband filter efficiently but the development of ADC converter is relatively behind as the ADC currently have limited sampling rates, of the order of 1 GHz, which is not sufficient for wideband spectrum.…”
Section: Related Workmentioning
confidence: 99%