2007 IEEE International Conference on Communications 2007
DOI: 10.1109/icc.2007.721
|View full text |Cite
|
Sign up to set email alerts
|

MIMO LMMSE Transceiver Design with Imperfect CSI at Both Ends

Abstract: Abstract-This paper presents a new result on minimum total mean squared error (MSE) joint transceiver design for multiple-input multiple-output (MIMO) systems, with imperfect channel state information (CSI) at both ends and subject to a total power constraint. The channel knowledge here is the channel mean and transmit correlation information. The joint design is formulated into an optimization problem, to which the closed-form optimum solution is found. The optimum precoder consists of a linear filter, a matr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…As in [2][5] [7], we cannot show that the iterative algorithm in Table I is guaranteed to achieve the globally optimum solution (except when K = 1 [15]), despite the fact that the global minimum exists. This is because the objective function in (1) is not convex in…”
Section: A An Iterative Algorithm For Solving (1) Based On the Kkt Cmentioning
confidence: 91%
“…As in [2][5] [7], we cannot show that the iterative algorithm in Table I is guaranteed to achieve the globally optimum solution (except when K = 1 [15]), despite the fact that the global minimum exists. This is because the objective function in (1) is not convex in…”
Section: A An Iterative Algorithm For Solving (1) Based On the Kkt Cmentioning
confidence: 91%
“…Correspondingly, the KKT conditions associated with (9) can be derived, as given by (24)- (27) (24) (25) (26) (27) It can be shown that Lemma 1 still holds here, i.e., for any solution which satisfies the KKT conditions (24)- (27). Define (28) Consider the following eigenvalue decomposition: (29) where the subscript "g" means the general case, the matrices , , , and are similarly defined as those in (15), and denotes the rank of the matrix in (29), i.e., . The diagonal entries of are arranged in decreasing order.…”
Section: The General Casementioning
confidence: 99%
“…However, the scalars , and need to be determined numerically, which can be a difficult task. Alternatively, (9) can be solved using an iterative algorithm developed from the KKT conditions [12], [13], [28], which is given in Table I. This algorithm converges according to [13].…”
Section: The General Casementioning
confidence: 99%
“…ese existing schemes, however, do not consider the scenario where there is ICSI. In the presence of ICSI, robust designs have been studied in [16], but this study does not consider the MSE decomposition and relaxation property [3].…”
Section: Introductionmentioning
confidence: 99%