2007
DOI: 10.1109/vetecf.2007.146
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Training Sequences for MIMO Channel Estimation with Spatial Correlation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
28
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 25 publications
(30 citation statements)
references
References 10 publications
2
28
0
Order By: Relevance
“…This approach will result in a different solution than the single target cell approach in [18]- [23], as an interfering user in one cell is the desired user in another. Since the matrices A i do not depend on the optimization variables W i and S i , minimizing ǫ is equivalent to maximization of i tr (B i C i B * i ), which yields the following optimization problem:…”
Section: Mmse Channel Estimationmentioning
confidence: 99%
See 3 more Smart Citations
“…This approach will result in a different solution than the single target cell approach in [18]- [23], as an interfering user in one cell is the desired user in another. Since the matrices A i do not depend on the optimization variables W i and S i , minimizing ǫ is equivalent to maximization of i tr (B i C i B * i ), which yields the following optimization problem:…”
Section: Mmse Channel Estimationmentioning
confidence: 99%
“…Different from previous approaches [27], [28] which considered T = I NRF and optimized (18) over W alone, here the optimization is carried out with respect to both W and T . To solve (18), an alternating minimization approach was suggested, referred to as MaGiQ. The benefit of MaGiQ, is that at each iteration, a closedform solution for both variables is available.…”
Section: B Magiq -Minimal Gap Iterative Quantizationmentioning
confidence: 99%
See 2 more Smart Citations
“…From [17], it can be proved that the optimal training sequences can be found by linear transformation of the FZC. If R hh = QΛ Λ ΛQ H is the eigenvalue decomposition of the hermitian matrix R hh and since Q is an orthogonal matrix, then:…”
Section: Optimal Training Patternsmentioning
confidence: 99%