4.5 Optimum transmitter with individual QoS constraints.(4 Nonlinear Decision Feedback MIMO Transceivers)
Publication Date: 01-DEC-06
Publication Title: Foundations and Trends in Communications and Information Theory
Format: Online
Author: Palomar, Daniel P. ; Jiang, Yi

Read this article now
Try Goliath Business News - FREE!

You can view this article PLUS...

  • Over 5 million business articles
  • Hundreds of the most trusted magazines, newswires, and journals (see list)
  • Premium business information that is timely and relevant
  • Unlimited Access

Now for a Limited Time, try Goliath Business News
Free for 7 Days!

Tell Me More   Terms and Conditions

Purchase this article for $4.95

Description

This section deals with the problem formulation in (4.14) reproduced next for convenience:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (4.73)

The optimal DFE matrices W and B have already been derived in (4.21), with resulting SINRs given by SIN[R.sub.i] = [[R].sup.2.sub.ii] - 1 for 1 [less than or equal to] i [less than or equal to] L, where [[R].sub.ii] is the ith diagonal element of R given in the QR decomposition [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Hence, (4.73) may be reformulated as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (4.74)

Theorem 4.5. The solution to (4.74) must be of form:

P = [V.sub.H]diag([square root of p])[[OMEGA].sup.[dagger]],

where p is solved according to

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (4.75)

and [OMEGA] is chosen such that the diagonal element of R in [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] are [[R].sub.ii] = [square root of (1 + [gamma]i)], 1 [less than or equal to] i [less than or equal to] L.

Proof. The proof is not difficult given the proof of Theorem 4.3. We only give a sketch here. Readers are referred to [71] for the details.

First, observe that an optimal solution to (4.74) must satisfy [[R].sub.ii] = [square root of (1 + [gamma]i) for [for all]i. The reason is the following. Suppose [[R].sub.ii] > [squre root of (1 + [gamma]i)]. We can scale down the ith column of P until [[R].sub.ii] = [square root of (1 + [gamma]i)], and the overall input power Tr(P[P.sup.[dagger]]) is reduced. Meanwhile, the other diagonal entries of R do not decrease. Indeed, [[R].sub.jj], for j i, may even increase as the jth substream is now subject to weaker interference from the ith substream.

Second, denote P = [U.sub.P] diag([square root of p])[[OMEGA].sup.[dagger]] as its SVD. Then it can be proven that the constraint

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]...



More articles from Foundations and Trends in Communications and Information Theory
Majorization and matrix-monotone functions in wireless communications., December 15, 2006
1 Introduction.(Majorization and Matrix-Monotone Functions in Wireless..., December 15, 2006
2 Majorization theory.(Majorization and Matrix-Monotone Functions in W..., December 15, 2006
3 Matrix-monotone functions.(Majorization and Matrix-Monotone Function..., December 15, 2006
4 Application of majorization in wireless communications.(Majorization..., December 15, 2006

Looking for additional articles?
Click here to search our database of over 3 million articles.