2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2011
DOI: 10.1109/icassp.2011.5946270
|View full text |Cite
|
Sign up to set email alerts
|

Compressive tracking of doubly selective channels in multicarrier systems based on sequential delay-Doppler sparsity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…Then, part of the support of u~false(rfalse), which is very likely to be accurate, can be regarded as the a priori knowledge of u in the ( r + 1)th round. The partially known support can be effectively exploited by modified‐OMP [10, 11] to reduce computational complexity. As one of the modified‐CS algorithms [20], modified‐OMP makes a change only in the initialisation step of OMP.…”
Section: Proposed Cs‐based Estimation Schemesmentioning
confidence: 99%
See 1 more Smart Citation
“…Then, part of the support of u~false(rfalse), which is very likely to be accurate, can be regarded as the a priori knowledge of u in the ( r + 1)th round. The partially known support can be effectively exploited by modified‐OMP [10, 11] to reduce computational complexity. As one of the modified‐CS algorithms [20], modified‐OMP makes a change only in the initialisation step of OMP.…”
Section: Proposed Cs‐based Estimation Schemesmentioning
confidence: 99%
“…In each iteration, the estimation result of the previous round is fed back to rebuild the measurement matrix. Moreover, using the recently introduced algorithm of modified orthogonal matching pursuit (modified-OMP) [10,11], we can effectively reduce the computational complexity.…”
Section: Introductionmentioning
confidence: 99%
“…p [m, i], θ ∈ Θ are (approximately) jointly ∆m∆i-sparse, as we just showed in Section IV-C, it follows by the same reasoning as in Section IV-B that their effective supports are jointly contained in at most N Λ blocks B b , where (cf. (23))…”
Section: Joint Group Sparsitymentioning
confidence: 99%
“…In particular, compressive channel estimation [17,18] uses CS techniques [2][3][4] to exploit an inherent sparsity of the channel that is related to the fact that doubly selective channels tend to be dominated by a relatively small number of clusters of significant propagation paths [19]. While compressive channel estimation within single-input single-output systems is well explored [17,18,[20][21][22][23][24][25][26][27][28][29], fewer works have addressed the MIMO case. Existing methods for MIMO channels either exploit sparsity in the delay-Doppler-angle domain [18,30] or joint sparsity of the component channels in the delay domain [31] or in the delay-Doppler [32] domain.…”
Section: Introductionmentioning
confidence: 99%
“…An advanced compressive estimation method was introduced in [16] for doubly dispersive channel estimation within a multicarrier OFDM system, where simulations using geometry based channel simulators outperforms the classical CS methods in terms of complexity. A recursive tracking of doubly selective channel based sequential delay-Doppler sparsity was exploited by [17] to improve estimation performance. The technique suggests the use of a modified version of orthogonal matching pursuit (OMP), where it demonstrates a substantial performance gain over conventional CS estimation in terms of computational complexity.…”
mentioning
confidence: 99%