2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) 2010
DOI: 10.1109/spawc.2010.5670866
|View full text |Cite
|
Sign up to set email alerts
|

MIMO BC/MAC MSE duality with imperfect transmitter and perfect receiver CSI

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 16 publications
(15 citation statements)
references
References 22 publications
0
15
0
Order By: Relevance
“…it is possible to achieve identical MSEs for all the users in the BC as in the MAC, i.e., MSE BC k = MSE MAC k ∀k. Moreover, the average transmit power is preserved [35]. Note that even not always explicitly remarked in the notation, the MAC receive filters and precoders are functions of the partial CSIT v and the channel, respectively, as the corresponding BC precoders and receive filters.…”
Section: B Bc/mac Mse Dualitymentioning
confidence: 99%
See 1 more Smart Citation
“…it is possible to achieve identical MSEs for all the users in the BC as in the MAC, i.e., MSE BC k = MSE MAC k ∀k. Moreover, the average transmit power is preserved [35]. Note that even not always explicitly remarked in the notation, the MAC receive filters and precoders are functions of the partial CSIT v and the channel, respectively, as the corresponding BC precoders and receive filters.…”
Section: B Bc/mac Mse Dualitymentioning
confidence: 99%
“…1) N ≥ K: This is the case where the number of transmit antennas is greater than or equal to the number of users. We start searching for an upper bound for f k (ξ; ε), or equivalently, a lower bound for the inverse term in (35). To do so, we introduce the following matrices Bk = [ϕ i1 , .…”
Section: Appendix C Proof For the Condition (30)mentioning
confidence: 99%
“…3 The algorithm performs a preconditioned gradient descent step in each iteration, followed by an orthogonal projection onto the constraint set. The gradient descent step for the eigenvalue matrixΦ can be expressed as…”
Section: Gradient Projection Based Precoder Designmentioning
confidence: 99%
“…The details of the derivation are presented in Appendix B and the first order eigenvalue derivatives are given by [cf. 3 Alternatively, we could exploit (36) for a precoder based gradient projection method (e.g., see [20]) where the unit-norm eigenvectors u i and v i are defined via the eigenvalue decompositions of S and O, respectively. With (26) and Proposition 2, above matrix derivatives are…”
Section: Gradient Projection Based Precoder Designmentioning
confidence: 99%
See 1 more Smart Citation