2016
DOI: 10.1109/tvt.2016.2554611
|View full text |Cite
|
Sign up to set email alerts
|

OFDM Receiver for Fast Time-Varying Channels Using Block-Sparse Bayesian Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 24 publications
0
11
0
Order By: Relevance
“…By defining number of iterations that the algorithm needs to converge as , total number of complex operations is approximately (16 ). Based on this result and keeping low computational requirement of DWHT algorithm in mind, it can be concluded that the proposed algorithm has low computational cost if compared to the existing works in the literature such as [13,25,26]. The computational load of the proposed SAGE algorithm is given here roughly; it is possible to find a bit more detailed analysis in [13].…”
Section: Complexity Analysismentioning
confidence: 89%
See 2 more Smart Citations
“…By defining number of iterations that the algorithm needs to converge as , total number of complex operations is approximately (16 ). Based on this result and keeping low computational requirement of DWHT algorithm in mind, it can be concluded that the proposed algorithm has low computational cost if compared to the existing works in the literature such as [13,25,26]. The computational load of the proposed SAGE algorithm is given here roughly; it is possible to find a bit more detailed analysis in [13].…”
Section: Complexity Analysismentioning
confidence: 89%
“…Some of the most remarkable of these studies can be found in [25][26][27][28]. Reference [25] presents an iterative receiver which uses two tolls: block-sparse-Bayesian learning and meanfield belief-propagation.…”
Section: Motivation and Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, we must build a new channel sparse recovery model. Because the ICI is very little in (13), it can be treated as noise. Assuming W (k P , k P + 1) = ICI kP − ICI kP +1 + W (k P ) − W (k P + 1), substituting (3) and (4) into (13), we can get…”
Section: A New Channel Sparse Recovery Methods 41 New Sparse Recoverymentioning
confidence: 99%
“…It is well known that the ICI is generated in the time-varying channel. A lot of schemes have been proposed to mitigate this kind of the ICI [20]- [23]. However, the schemes proposed in [20]- [23] cannot be directly applied to mitigate the ICI due to the gain adjustment in OFDM systems.…”
Section: Introductionmentioning
confidence: 99%