Samah A. M. Ghanem, Member, IEEE, Abstract

Transcription

1 Multiple Access Gaussian Channels with Arbitrary Inputs: Optimal Precoding and Power Allocation Samah A. M. Ghanem, Member, IEEE, arxiv:4.0446v2 cs.it] 6 Nov 204 Abstract In this paper, we derive new closed-form expressions for the gradient of the mutual information with respect to arbitrary parameters of the two-user multiple access channel (MAC). The derived relations generalize the fundamental relation between the derivative of the mutual information and the minimum mean squared error (MMSE) to multiuser setups. We prove that the derivative of the mutual information with respect to the signal to noise ratio (SNR) is equal to the MMSE plus a covariance induced due to the interference, quantified by a term with respect to the cross correlation of the multiuser input estimates, the channels and the precoding matrices. We also derive new relations for the gradient of the conditional and non-conditional mutual information with respect to the MMSE. Capitalizing on the new fundamental relations, we investigate the linear precoding and power allocation policies that maximize the mutual information for the two-user MAC Gaussian channels with arbitrary input distributions. We show that the optimal design of linear precoders may satisfy a fixed-point equation as a function of the channel and the input constellation under specific setups. We show also that the non-mutual interference in a multiuser setup introduces a term to the gradient of the mutual information which plays a fundamental role in the design of optimal transmission strategies, particularly the optimal precoding and power allocation, and explains the losses in the data rates. Therefore, we provide a novel interpretation of the interference with respect to the channel, power, and input estimates of the main user and the interferer. Index Terms Estimation Theory; Gradient of conditional mutual information; Gradient of non-conditional mutual information; Gradient of joint mutual information; Information Theory; Interference; MAC; MMSE; Mutiuser I-MMSE; Mutual Information; Power Allocation; Precoding.

2 2 I. INTRODUCTION LNEAR precoding for mutually interfering channels corrupted with independent Gaussian noise can be used to maximize the mutual information under a total power constraint ]. In the multiple user setting, the mutual information is maximized by imposing a covariance structure on the Gaussian input vector that satisfies two conditions: First, transmitting along the right eigenvectors of the channel. Second, the power allocation follows the waterfilling based on the SNR in each parallel non-interacting sub-channel 2], 3]. The MAC channel stands as a special case of interference channels. With arbitrary inputs, the mutual information of the MAC channel is minimized due to the fact that at a certain point the inputs may lie in the null space of the channel, and this causes the mutual information to decay at such point. Therefore, the capacity-achieving strategies can be employed either at the transmitter side and/or the receiver side: by orthogonalizing the inputs using TDM/FDM techniques, or via using interference mitigation techniques, such as, dealing with interference as noise, rate splitting, successive interference cancellation, decoding interference, as well as receive diversity techniques 4], 5], 6], 7], 8], 9]. Precoding is another technique that can be used at the transmitter side to maximize the mutual information by exploiting the transmit diversity. On the one hand, precoding plays the role of power allocation diagonalizing the channel while, on the other hand, rotating the channel eigenvectors; thus shaping the constellation for better detection. Since practical considerations enforce the use of discrete constellations, such as PSK and QAM, which depart significantly from the optimal Gaussian distributions, it is of great importance to revisit the linear precoding problem under the constraint that each input follows a specified discrete constellation. In 3], 0], and ], the optimal power allocation for parallel non-interacting channels with arbitrary inputs, and the optimal precoding for multiple inputs multiple outputs (MIMO) channels with different setups were obtained exploiting the relation between the mutual information and the MMSE 0], 2]. The results in ] demonstrate that capacity-achieving strategies for Gaussian inputs may be suboptimal for discrete inputs. In 3] a general solution for the optimum precoder has been derived for the high and low-snr regimes capitalizing on first order expansions of the MMSE and relating

3 3 it to mutual information. The mercury/waterfilling solution for power allocation maximizes the mutual information compensating for the non-gaussianess for the discrete constellations 3]. However, linear precoding techniques introduce rescaling among the channel inputs that achieves cleaner detection of the received signals and thus higher information rates. Therefore, this paper addresses the optimal precoding and optimal power allocation problem for multiuser channels driven by arbitrary inputs, extending previous works presented in 4], and 5], 6]. Due to the lack of explicit closed form expressions of the mutual information for binary inputs, which were provided only for the BPSK for the single input signle output (SISO) case, 2], 7], 6], it is of particular importance to address connections between information theory and estimation theory to understand the communication framework under such inputs and to design optimal precoding and power allocation strategies that aim to maximize the reliable infromation rates. In this paper, we first revisit the connections between the mutual information and the MMSE for the multiuser setup, to derive relations that account for the existence of an interfer channel. Therefore, the known fundamental relation between the derivative of the mutual information and the MMSE defined for point to point channels with any noise or input distributions in 2], is generalized to the multiuser case. Moreover, the relations for linear vector Gaussian channels in 0] is generalized for the multiuser channels where we extend these relations to the per-user gradient of the mutual information with respect to the MMSE, channels and precoders (power allocation) matrices of the user and the interferers. We then propose a linear precoder structure that aims to maximize the input output mutual information for the two-user MAC setting with channel state information known at both receiver and transmitter sides. Throughout the paper, the following notation is employed, boldface uppercase letters denote matrices, lowercase letters denote scalars. The superscript, (.), (.) T, (.) T, and (.) denote inverse, transpose, conjugate and conjugate transpose operations. (.) denotes optimum. The ( ) denotes the gradient of a scalar function with respect to a variable. The E.] denotes the expectation operator. The. and Tr{.} Preliminary results of this work has been presented in WCSP 4].

4 4 denote the Euclidean norm, and the trace of a matrix, respectively. The paper is organized as follows; section II introduces the system model and the problem formulation and, section III introduces the new fundamental relations between the mutual information and the MMSE. Section IV introduces the optimal precoding with arbitrary inputs and under different user setups. Section V introduces analysis at the asymptotic regime of low SNR. Section VI introduces the power allocation with arbitrary inputs and specializes it to the mercury/waterfilling under specfic user setups. Section VII introduces simulation and analytical results where we introduce an interpretaion of the interference, similar to known interpretations of the optimal power allocation over user main channels. II. SYSTEM MODEL AND PROBLEM FORMULATION Consider the deterministic complex-valued vector channel, y = snr H P x + snr H 2 P 2 x 2 +n, () where then r dimensional vectory and then t dimensional vectorsx,x 2 represent, respectively, the received vector and the independent zero-mean unit-variance transmitted information vectors from each user input to the MAC channel. The distributions of both inputs are not fixed, not necessarily Gaussian nor identical. The n r n t complex-valued matrices H, H 2 correspond to the deterministic channel gains for both input channels (known to both encoder and decoder) and n CN(0,I) is the n r dimensional complex Gaussian noise with independent zero-mean unit-variance components. The optimization of the mutual information is carried out over all n t n t precoding matrices P, P 2 that do not increase the transmitted power. The precoding problem can be cast as a constrained non-linear optimization problem as follows: max I(x,x 2 ;y) (2) Subject to: { } Tr E x P x x P ] = Tr { P P } Q (3)

5 { } Tr E x P 2 x 2 x 2 P 2 ] = Tr { P 2 P } 2 Q 2 (4) 5 To address the precoding and power allocation problems, we will revisit the fundamental relation between the mutual information and the MMSE with respect to the SNR for the multiuser case. The following section provides a set of new results that generalize of the known relations derived first by Guo, Shamai, and Verdu 2], and extends the results of linear vector channels by Palomar and Verdu 0] to the general case of multiuser channels. III. NEW FUNDAMENTAL RELATIONS BETWEEN THE MUTUAL INFORMATION AND THE MMSE The first contribution is given in the following theorem, which provides a generlization of the I-MMSE identity to the multiuser case and traverses back to the same identilty of the single user case. Theorem : The relation between the derivative of the mutual information with respect to the snr and the non-linear MMSE for a multiuser Gaussian channel satisfies: Where, di(snr) dsnr = mmse(snr)+ψ(snr) (5) mmse(snr) = Tr { H P E (H P ) } +Tr { H 2 P 2 E 2 (H 2 P 2 ) }, (6) ψ(snr) = Tr { H P E y E x yx y]e x2 yx 2 y] ](H 2 P 2 ) } Tr { H 2 P 2 E y E x2 yx 2 y]e x yx y] ](H P ) }, Proof: The proof has been done for the two-user MAC channel as an example of a multiuser channel. See Appendix A. The per-user MMSE is given respectively as follows: E = E y (x x )(x x ) ] (7) E 2 = E y (x 2 x 2 )(x 2 x 2 ) ]. (8) The input estimates of each user input is given respectively as follows: x = E x yx y] = x,x 2 x p y x,x 2 (y x,x 2 )p x (x )p x2 (x 2 ) p y (y) (9) x 2 = E x2 yx 2 y] = x 2 p y x,x 2 (y x,x 2 )p x (x )p x2 (x 2 ). (0) p x,x y (y) 2 The conditional probability distribution of the Gaussian noise is defined as: p y x,x 2 (y x,x 2 ) = snrh P x snrh 2 P 2 x 2 2 () π nre y

6 6 The probability density function for the received vector y is defined as: p y (y) = x,x 2 p y x,x 2 (y x,x 2 )p x (x )p x2 (x 2 ). (2) Henceforth, the system MMSE with respect to the SNR is given by: mmse(snr) = E y H P (x E x yx y]) 2] +E y H2 P 2 (x 2 E x2 yx 2 y]) 2], (3) { = Tr H P E (H P ) } { +Tr H 2 P 2 E 2 (H 2 P 2 ) } (4) as given in Theorem. Note that the term mmse(snr) is due to the users MMSEs, particularly, mmse(snr) = mmse (snr)+ mmse 2 (snr) and ψ(snr) are covariance terms that appear due to the covariance of the interferers. Those terms are with respect to the channels, precoders, and non-linear estimates of the user inputs. When the covariance terms vanish to zero, the mutual information with respect to the SNR will be equal to the mmse with respect to the SNR, this applies to the single user and point to point communications. Therefore, the result of Theorem is a generalization of previous result and boils down to the result of Guo et al, 2] under certain conditions which are: (i) when the cross correlation between the inputs estimates equals zero (ii) when interference can be neglected (i.e. interference is very weak, very strong, or aligned) and (iii) under the signle user setup. Such generalized fundamental relation between the change in the mutliuser mutual information and the SNR is of particular relevance. Firstly, such result allows us to understand the behavior of per-user rates with respect to the interference due to the mutual interference and the interference due to other users behaviour in terms of power levels and channel strengths. In addition, the result allows us to be able to quantify the losses incured due to the interference in terms of bits. Therefore, when the term ψ(snr) equals zero. The derivative of the mutual information with respect to the SNR equals the total mmse(snr): di(snr) dsnr = mmse(snr), (5) which matches the result by Guo et. al in 2].

7 7 A. Remark on Interference Channels The implication of the derived relation on the interference channel is of particular relevance. It is worth to note that we can capitalize on the new fundamental relation to extend the derivative with respect to the SNR to the conditional mutual information. To make this more clear, we capitalize on the chain rule of the mutual information which states the following: I(x,x 2 ;y) = I(x ;y)+i(x 2 ;y x ) (6) Therefore, through this observation we can conclude the following theorem. Theorem 2: The relation between the derivative of the conditional mutual information and the minimum mean squared error satisfies: di(x 2 ;y x ) dsnr = mmse 2 (snr)+ψ(snr) (7) Proof: Taking the derivative of both sides of (6), and subtracting the derivative of I(x ;y) which is equal to mmse (γsnr), γ is a scaling factor, due to the fact that x is decoded first considering the other users input x 2 as noise. Therefore, Theorem 2 has been proved. Note that the derivative of the conditional mutual information as well as the non-conditional mutual information can be scaled due to different SNRs in a two-user interference channel. However, the scaling is straightforward to apply. For further details, refer to 6], 8], and 9]. To solve the optimization problem in (2) subject to (3) and (4), we need to know the relation between the mutual information and the non-linear MMSE in the context of MAC channels. The following theorem puts forth a new fundamental relation between the mutual information and the non-linear MMSE for MIMO MAC channels 2. In particular, the gradient of the mutual information with respect to arbitrary parameters has been derived. First we will present the gradient of the mutual information, with respect to the channel in Theorem 3, then with respect to the precoder (or power allocation) in Theorem 4. 2 Noice that through the flow of the paper, we use MAC channel instead of MIMO MAC since such relations are general and apply even when users are transmitting over scalar channels.

8 8 The following theorems in addition to Theorem generalizes the connections between information theory and estimation theory to the multiuser case. Theorem 3: The relation between the gradient of the mutual information with respect to the channel and the non-linear MMSE for a two user-mac channel with arbitrary inputs () satisfies: H I(x,x 2 ;y) = H P E P H 2 P 2 E x 2 x ]P (8) H2 I(x,x 2 ;y) = H 2 P 2 E 2 P 2 H P E x x 2]P 2 (9) Proof: See Appendix B. Theorem 4: The relation between the gradient of the mutual information with respect to the precoding matrix and the non-linear MMSE for a two user-mac channel with arbitrary inputs () satisfies: P I(x,x 2 ;y) = H H P E H H 2P 2 E x 2 x ] (20) P2 I(x,x 2 ;y) = H 2H 2 P 2 E 2 H 2H P E x x 2] (2) Proof: See Appendix C. Theorems 3 and 4 provides intuitions about the change of the mutual information with respect to the changes in the channel or the precoding (power allocation). There is a strightforward connection between both changes when each gradient is scaled with respect to the changing arbitrary parameter, we can write this connection as follows: P I(x,x 2 ;y)p = H H I(x,x 2 ;y), (22) P2 I(x,x 2 ;y)p 2 = H 2 H 2 I(x,x 2 ;y), (23) Note that we can derive the gradient of the mutual information with respect to any arbitrary parameter following similar steps of the proof of the previous two theorems. Note also that the derived relations in (8), (9), (20), and (2) reduce to the relation between the gradient of the mutual information and the non-linear MMSE derived for the linear vector Gaussian channels 0] if the cross correlation between the input estimates is zero. This is possible when the users inputs are orthogonal or interference alignment

9 9 is performed. In addition, the derived relation between the gradient of the mutual information and the MMSE of the two-user MAC setting in Theorem 3 will lead to a new formulation of the input non-linear estimates, that is discussed in the following Theorem. Theorem 5: The estimates of the inputs x and x 2 of the two-user MAC channel with arbitrary inputs given the output y can be expressed as: H P E x yx y]+h 2 P 2 E x2 yx 2 y] = y+ yp y (y) p y (y) (24) Proof: See Appendix D. (24) can be solved numerically to obtain the estimates of the inputs. However, we can extract a special case of Theorem 5 in the following corrolary. Corollary : If the channel is a linear vector Gaussian channel, Theorem 5 leads to the following formulation: E x y x y] = ( y+ ) yp y (y) (HP) (25) p y (y) (25) can be manipulated in terms of its zero forcing linear counter measure, where the distance between a linear and a non-linear estimate is approximately equal to ǫ, where ǫ = ( ypy(y) p y(y) )(HP). Further, the non-linear estimates given in (9) and (0) give a statistical intuition to the problem. However, the most used in practical setups are linear estimation sub-optimal methods, where linear estimates can be found via the linear MMSE. In particular, the input estimates can be found by deriving the optimal Wiener receive filters solving a minimization optimization problem of the mean squared error (MSE). The following theorem provides the linear MMSE estimates. Theorem 6: The linear estimates of the inputs x, x 2 of the two-user MAC channel given the output y can be expressed as: x = P H (I+P H P H +P 2H 2P 2 H 2 ) y (26) x 2 = P 2H 2(I+P H P H +P 2H 2P 2 H 2 ) y (27) Proof: See Appendix E.

10 0 Worth to note that the linear estimation process of the inputs corresponds to multiplying the user Wiener MMSE receive filters to the received vector. Note that each receive filter contains the precoding (or power allocation), the user channel, in addition to a structure of the linear MMSE, that is, the inverse of the covariance structure of the received vector. B. Gradient of the Conditional and Non-Conditional Mutual Information Theorem 4 shows how much rate is lost due to the other user, this is due to the fact that some terms in the gradient of the mutual information preclude the effect of the mutual interference of the main links. Therefore, we can account for such quantified rate loss via optimal power allocation and optimal precoding. Then, in order to be able to understand the achieved rates of each user in a MAC channel, we capitalize on the chain rule of the mutual information to derive the conditional mutual information as follows, I(x,x 2 ;y) = I(x 2 ;y)+i(x ;y x 2 ) (28) and, I(x,x 2 ;y) = I(x ;y)+i(x 2 ;y x ) (29) Clearly, we know that I(x 2 ;y) is the mutual information when user 2 is decoded first considering user signal as noise. Therefore, we can write it as follows, I(x 2 ;y) = log p ] y x 2 (y x 2 ) p y (y) p y x2 (y x 2 ) = snrh2 P 2 x 2 ) (P π nre (y H H P +I) (y snrh 2 P 2 x 2 ) (30) (3) p y (y) = x 2 p y x2 (y x 2 )p x2 (x 2 ) (32) Based on such definition, we conclude the following theorem which provides a new fundamental relation between the gradient of the mutual information with respect to the precoder of the other user given that the other user will be secondly decoded.

11 Theorem 7: The gradient of the mutual information with respect to the precoder, for a scaled user power when the other user input is considered as noise is as follows, P I(x 2 ;y) = H 2 P 2 E 2 P 2H 2H H P (P H H P +I) (33) P2 I(x ;y) = H P E P H H 2 H 2 P 2 (P 2 H 2 H 2P 2 +I) (34) Proof: The proof follows similar steps of the proof of Theorem 4. When each user is transmitting over a single channel, the new relation in Theorem 7 will be more clearly understood in terms of the effect of the interference plus noise power scaling on the gradient, see 8]. Corollary 2: The gradient of the conditional mutual information will be as follows, P I(x ;y x 2 ) = P I(x,x 2 ;y) P I(x 2 ;y) (35) P2 I(x 2 ;y x ) = P2 I(x,x 2 ;y) P2 I(x ;y) (36) Proof: The proof of the corllary follows from the chain rule of mutual information and the gradient of the mutual information derived for the sum rate and non-conditional rates. IV. OPTIMAL PRECODING WITH ARBITRARY INPUTS Capitalizing on the relation between the gradient of the mutual information with respect to the precoding matrix and the MMSE, we can solve the optimization problem in (2) subject to (3) and (4). The following theorem provides the optimal precoding of the two-user MAC channel with arbitrary inputs which can be also specialized to Gaussian inputs, see 6], 8], 5]. Theorem 8: Let the distribution of the arbitrary inputs x, x 2 to the channel in () be p x (x ), p x2 (x 2 ), respectively. The optimal precoding matrices satisfy the following: P = ν H H P E ν H H 2 P 2 E x 2 x ] (37) P 2 = ν H 2H 2 P 2 E 2 ν H 2H P E x x 2] (38)

12 2 Where ν are the received snr normalized by the Lagrange multipliers of the optimization problem in (2). Proof: The proof of Theorem 8 relies on the KKT conditions 20] and the relation between the gradient of the mutual information with respect to the precoding matrices and the MMSE, see Appendix F. There are unique P, P 2 that satisfy the KKT conditions when the problem is strictly concave, corresponding to the global maximum. Using Monte-Carlo method, we can compute the MMSE matrices (7) and (8) for discrete constellations. To obtain the solution of (37) and (38), we can use an iterative approach, similar to ], 3], and ]. It is very important to notice that the optimal precoders of (37) and (38) satisfies a fixed point equation under two specific setups: First, for the multiple-channels-per user in the two-user-mac if and only if the second term in the gradient of the mutual information with respect to the precoding matrix is zero, this occurs when both inputs are orthogonal, or in this case, we can think about it as if the second user multiple-inputs have no influence to the first user multiple inputs, therefore, each user precoding is over his mutually interfering channels only. If each user is using OFDM signaling, i.e., transmitting over parallel independent Gaussian channels, the problem breaks into two separate problems, and the precoding solution for each is a fixed point equation. Second, for the two-user-mac case with each user is mutually interfering with the other, in this case the relation between the gradient of the mutual information with respect to the precoding matrix can be manipulated as in 0], thus, the precoder structure is similar to the one introduced in 3], 5]. We define in the following theorem a general form of the optimal precoder s structure for the two-user MAC channel in (37) and (38) under the two specific setups where the precoder would satisfy a fixed point equation, therefore, the solution applies to the low-snr and high-snr regimes. However, it also reduces to the optimal power allocation solution when the precoding is precluded as will be shown later. Therefore, the precoder should admit a structure that performs matching of the strongest source modes to the weakest

13 3 noise modes, and this alignment enforces permutation process to appear in the diagonal power allocation setup. Theorem 9: The non-unique first-order optimal precoders that maximize the mutual information for a two-user MAC subject to per-user power constraint, and under the assumption that the second term in (37), and (38) equals zero, can be given as follows: P = U D R (39) P 2 = U 2 D 2 R 2 (40) With U, U 2 are unitary matrices, D, D 2 are diagonal matrices, and R, R 2 are rotation matrices. Proof: The theorem follows the relation between the gradient of the mutual information with respect to the precoding matrix and the decomposition of the components of the channel, precoder, and MMSE matrices, and is a direct consequence to Theorem, 5], see Appendix G. The optimal precoders are as follows, P = U D R and P 2 = U 2 D 2 R 2 with U = V H, U 2 = V H2, correspond to the per user channel right singular vectors, respectively. D = diag( p,,..., p,nt ) and D 2 = diag( p 2,,..., p 2,nt ) are power allocation matrices, such that p l,m is admitted by user l over sub/channel m; this in fact corresponds to the mercury/waterfilling. R = ΠU E and R 2 = ΠU E2 are rotation matrices that contain in their structure the eigenvectors of the user MMSE matrix which can be permuted and/or projected with Π based on the correlation of the inputs and their estimates. Therefore, the rotation matrix insures firstly, allocation of power into the strongest channel singular vectors, and secondly, diagonalizes the MMSE matrix to insure un-correlating the error or in other words independence between inputs, enforcing the setup defined in (37) and (38) for the two special setups discussed previously about each user inputs, i.e., when the interference from each user to the other is cancelled or precluded, and approximated by zero.

14 4 V. THE LOW-SNR REGIME We now consider the optimal precoding policy for the two-user MAC Gaussian channel with arbitrary input distributions in the regime of low-snr. Consider a zero-mean uncorrelated complex inputs, with Ex x ] = Ex 2x 2 ] = I, and Ex x T ] = Ex 2x T 2 ] = 0. We consider the low-snr expansion to the MMSE of equation (3). Note that it can be easily deduced that the Taylor expansion of the non linear MMSE in (3) will lead to the first order Taylor expansion of the linear MMSE for the Gaussian inputs setup. Thus, the low-snr expansion of the MMSE matrix can be expressed as: E = I (H P ) H P.snr (H 2 P 2 ) H 2 P 2.snr +O(snr 2 ), (4) with E = E +E 2. Consequently, { mmse(snr) = Tr H P E (H P ) } { +Tr H 2 P 2 E 2 (H 2 P 2 ) } (42) { = Tr H P (H P ) } +Tr {H 2 P 2 (H 2 P 2 ) } } } Tr {(H P (H P ) ) 2.snr Tr {(H 2 P 2 (H 2 P 2 ) ) 2.snr +O(snr 2 ). (43) Note that due to our new result of Theorem, we cannot apply immediately the fundamental relationship between mutual information and MMSE in 0], 2]. Therefore, applying our new result, the low-snr Taylor expansion of the mutual information is given by: { I(snr) = Tr H P (H P ) } {.snr +Tr H 2 P 2 (H 2 P 2 ) }.snr } } Tr {(H P (H P ) ) 2.snr 2 Tr {(H 2 P 2 (H 2 P 2 ) ) 2.snr 2 + { +Tr H P (H P ) H 2 P 2 (H 2 P 2 ) }.snr 2 { Tr H 2 P 2 (H 2 P 2 ) H P (H P ) }.snr 2 +O(snr 3 ) (44) The wideband slope which indicates how fast the capacity is achieved in terms of required bandwidth is inversely proportional to the second order terms of the mutual information in the low-snr Taylor expansion (44). Therefore, this term is a key low-power performance measure since the bandwidth required

15 5 to sustain a given rate with a given low power, i.e., minimal energy per bit, is inversely proportional to this term 2]. According to (44), for first-order optimality, subject to (3) and (4), the form of the optimal precoder follows from the low-snr expansions the form of optimal precoder for the complex Gaussian inputs settings. To prove this claim, lets re-define our optimization problem as follows: { max Tr H P (H P ) } {.snr +Tr H 2 P 2 (H 2 P 2 ) }.snr (45) Subject to: Tr { P P } (46) Tr { P 2 P 2 } (47) Lets do an eigen value decomposition such that: H H = U H H Λ H H U (48) H H, H 2 H 2 = U H2 H Λ 2 H2 H U 2 H 2 H 2 (49) Let: P = U H H P (50) P 2 = U H 2 H 2P 2 (5) Let Z 0 and Z 2 0 are positive semi-definite, such that: Z = P P Z 2 = P 2 P 2 (52) (53) Substitute (48) to (53) into (45), (46), and (47), the optimization problem can be re-written as: { } { } max Tr Z Λ H H.snr +Tr Z 2 Λ H2 H.snr (54) 2 Subject to: Tr{Z } (55)

16 6 Tr{Z 2 } (56) Solving the KKT conditions for the Lagrangian of the objective function (54) subject to (55) and (56) leads to: Z = λ Λ H H.snr, (57) Z 2 = λ Λ H2 H 2.snr (58) Where λ is the Lagrange multiplier of the optimization problem. The results in (57) and (58) prove that the optimal precoders in the low snr perform mainly two operations: Firstly, it aligns the transmit directions with the eigenvectors of each sub-channel. Secondly, it performs power allocation over the sub-channels. VI. OPTIMAL POWER ALLOCATION WITH ARBITRARY INPUTS To derive the optimal power allocation for MAC Gaussian channels driven by arbitrary inputs, we need to redefine the same objective function subject to the per user power constraints. The power allocation is a special case of the precoding which inherently includes a power allocation operation. However, the first reshapes the constellation by rotating or redefining the minimum distance between the points, while the second redistributes the power over the channels to guarantee a better utilization of the channel under the defined design criterion. Therefore, the power allocation problem can be cast as a constrained non-linear optimization problem as follows: max I(x,x 2 ;y) (59) Subject to: (P ) ij = p j, (P 2 ) ij = p 2j (60) n t j= n t j= p j, p j 0 j =,...,n t (6) p 2j, p 2j 0 j =,...,n t (62)

17 7 where p = diag( p,,..., p,nt ), and p 2 = diag( p 2,,..., p 2,nt ). Capitalizing on the relation between the gradient of the mutual information with respect to the power allocation matrix and the MMSE, we provide the optimal power allocation in the following theorem. Theorem 0: The optimal power allocation that solves (59) subject to (60) to (62) satisfies: ) p = γ (P H H P E P H H 2P 2 E y x 2 x ] j ( ) p 2 = γ2 P 2 H 2H 2 P 2 E 2 P 2 H 2H P E y x x 2] 2j (63) (64) Where γ and γ 2 are the Lagrange multipliers normalized by the received snr, of the optimization problem in (59). Proof: The proof of Theorem 0 relies on the KKT conditions 20] and the relation between the gradient of the mutual information with respect to the precoding matrices and the MMSE, see Appendix H. For the special case where we have a single channel per user in the two-user MAC, (63) and (64) can be simplified to the following: p = γ p j h j 2 E y (x x )(x x ) ] γ p 2j h j h 2j E y (x x )(x 2 x 2 ) ] (65) p 2 = γ 2 p 2j h 2j 2 E y (x 2 x 2 )(x 2 x 2 ) ] γ 2 p j h 2j h j E y (x 2 x 2 )(x x ) ] (66) In (65) and (66), due to the fact that the MSE is less than or equal to, and consider the special case where the second covariance term is zero, i.e., no user is interfering with the other, we can express the optimal power allocation with the single user mercury/waterfilling form 3] as follows: ( ) p = snr h j mmse γ 2 h j γ 2 < h j 2 (67) p = 0, γ h j 2 ( ) p 2 = snr h 2j mmse γ2 2 2 h 2j 2 γ 2 < h 2j 2 p 2 = 0, γ 2 h 2j 2 (68) There is a unique set p, p 2 that satisfy the KKT conditions when the problem is strictly concave, corresponding to the global maximum.

18 8 VII. NUMERICAL RESULTS In this section we will introduce a set of illustrative results of the two-user MAC with arbitrary inputs. In particular, we will present the simplified case where the two user channels are transmitting over scalar channels or single channel per user. We used Monte-Carlo method to generate the results. Figure illustrates the decay in the mutual information at the 45 o when the two BPSK inputs cancel each other as they lie in the null space of the channel; called the Voronoi region, with the channels are such that h =, and h 2 =. If the channel gains or the total powers are different, the decay will be shifted into another line in the coordinate axis. However, we can easily check that if we induce orthogonality, for example if h = and h 2 = j, the mutual information will be the maximum achievable one without this decay region. SNR=0 2.5 I(x,x 2 ;y) p p.5 2 Figure. The two-user MAC mutual information with BPSK inputs. In Figure 2 we show the total MMSE for the two-user MAC. It is interesting to notice that the MMSE behavior corresponds to swapping the mutual information curve in Figure. This can let us visualize the

19 9 SNR=0 2.5 MMSE p p.5 2 Figure 2. The two-user MAC MMSE with BPSK inputs. relation between the gradient of the mutual information and the MMSE 0], 2]. Of particular relevance to observe that the decay in the mutual information saturates at.5 bits while the decay of the MMSE saturates at for equal power of both user s, e.g., (p,p 2 ) = (2,2) in Figure, and Figure 2, respectively. This is explained in the new fundamental relation which quantifies a loss of 0.5 bits in the data rates. For the case of Gaussian inputs the relation still holds, but the decay encountered in the arbitrary input setup will not exist. This can be easily verified theoretically and by simulation. For further analysis on Gaussian and mixed inputs, we refer the reader to 8]. Notice that the rate loss in the first user mutual information is due to the interference incurred by the second user. This can be understood via the negative second term in the gradient of the mutual information, similarly, for the other user. This term is a function of the main channel, the interferer channel, the main and interferer powers, and the input estimates.

20 20 Therefore, the interference from user to user 2 can be interpreted as: H H 2 P 2 E x 2 x ], (69) where we can re-write equation (69) for the single channel per user case in terms of the covariance of the interferer as follows: cov(snr h snr h h h 2p 2 ), (70) 2 Similarly, the interference from user 2 to user can be interpreted as: H 2 H P E x x 2 ], (7) Where we can re-write equation (7) for the single channel per user case in terms of the covariance of the interferer as follows: snr h 2 h cov(snr h 2h p ). (72) Figure 3 and Figure 4 illustrate the MMSE per user in the two-user MAC channel. MMSE and MMSE2 correspond to the mean-squared error of the first and second user respectively. It is worth to note that the sum of the two MMSEs leads to the total MMSE in Figure 2. Figure 5 illustrates the covariance of one interferer into the other user. We can see the negative term that leads to the loss incurred in the achieved mutual information. Finally, Figure 6 presents the optimal power allocation for the two-user MAC. When the total power for the first user is larger than that for the second user, the optimal power allocation for the first will be to allocate its total power, as far as the second user doesn t extremely interfere. However, for the second user, the optimal power allocation will start with an allocation of the total power, then iteratively optimize it by decreasing it. Therefore, precoding is of great importance to such cases where we can align the transmit directions - or caused interference - and maximize the information rates.

21 2 SNR=0 MMSE p p.5 2 Figure 3. MMSE for the first user of the two-user MAC with BPSK input. SNR=0 MMSE p p.5 2 Figure 4. MMSE2 for the second user of the two-user MAC with BPSK input.

22 22 SNR= covariance p p.5 2 Figure 5. Covariance for the first user of the two-user MAC with BPSK input. Optimal Power Allocation (MWF) 2.5 P * P 2 * SNR Figure 6. Optimal power allocation of the two user MAC with BPSK inputs.

23 23 VIII. CONCLUSIONS In this paper, we studied the two-user MAC Gaussian channels with arbitrary inputs. We provide a generlization of the fundamental relation between the mutual information and the MMSE to a new fundamental relation which applies to multiuser channel setups. Further, we proved our generlized framework deriving the relation between the gradient of the mutual information and the MMSE for any input setup. We build upon derivations for the optimal precoding and optimal power allocation. We specialize our results to different cases of the input users, where for the simple case when each user transmits over a SISO channel, the relations can be mapped to the ones by Guo et al. for point to point channels with general distributions 2], and by Palomar et al. for the linear vector Gaussian channels with mutually interfering inputs 0]. We have shown that the optimal precoder can follow a fixed point equation similar to 3] under certain conditions, where we identified the optimal precoder structure with respect to the power allocation, and the right and left signular vectors. Much simplification to the setup where both inputs don t interfere with each other leads to the mercury/waterfilling interpretation for the single user case with binary inputs 3]. This casts further insights to have an interpretation of the interference as discussed. Additionally, it casts further research questions in quantifying the losses incurred in the mutual information due to interference with and without precoding, and in conjunction with error correcting codes. Furthermore, we have analyzed the system at the low-snr regime, we have derived novel closed forms of the MMSE and the mutual information at the low SNR based on our new unveiled fundamental relation. The interference at the low-snr adds non-linear terms at the low SNR which decides on how fast the capacity can be acheived with respect to the SNR. Of particular relevance are the implications of our derived new fundamental relation in the study of the fundamental limits of cooperation, if a multi-cell processing framework is to be implemented between the BSs in a network. In particular, the interpretation of the interference in the studied two-user MAC, which is basically extracted from the gradient formula, can be extended to the k-user MAC channel where the impact of interference incurs higher losses into the information rates. Therefore, this have direct impact on

24 24 the optimal designs of power allocation and precoding. In fact, a global CSI and/or data sharing will not be possible, and this enforces a framework where muli-cell processing (MCP) should be implemented in clusters of known size. Furthermore, it is straightforward to think about setups where the cooperation and a clustered knowledge, i.e., a MCP with different levels of cooperation, can provide robust techniques to cancel or decode the interference at the transmitter/receiver sides and so improving the network spectral efficiency. In addition, its of particular relevance to understand the significance of our derivations on setups that include higher number of users accessing the network. For instance, the application of such formulas into scenarios where main users and cognitive users co-exist. The main users can design there optimal power allocation and optimal precoding subject to, the known interferer(s), i.e., the cognitive user interference, whether, they will be transmitting over SISO channels, or using OFDM modulation. Further, we have also she light on a new class of problems where a multi-tier precoding could exist, one example is massive MIMOs. In particular, a new formula can be utilized to express the signal to interference and noise ratio (SINR) based on the interpretation of the interference. IX. APPENDIX A: PROOF OF THEOREM The conditional probability density for the two-user MAC can be written as follows: Thus, the corresponding mutual information is: p y x,x 2 (y x,x 2 ) = snrh P x snrh 2 P 2 x 2 2 (73) π nre y I(x,x 2 ;y) = E log ( )] py x,x 2 (y x,x 2 ) p y (y) (74) I(x,x 2 ;y) = n r log(πe) Elog(p y (y))] (75) I(x,x 2 ;y) = n r log(πe) p y (y)log(p y (y))dy (76) Then, the derivative of the mutual information with respect to the SNR is as follows: di(x,x 2 ;y) dsnr = snr p y (y)log(p y (y))dy (77)

25 ( = p y (y) = ) p y (y) +log(p py (y) y(y)) dy (78) snr (+log(p y (y))) p y(y) dy (79) snr Where the probability density function of the received vector y is given by: 25 p y (y) = x,x 2 p y x,x 2 (y x,x 2 )p x,x 2 (x,x 2 ) (80) = E x,x 2 py x,x 2 (y x,x 2 ) ] (8) The derivative of the conditional output with respect to the SNR can be written as: p y x,x 2 (y x,x 2 ) = snr ( p y x,x 2 (y x,x 2 ) y snrh P x ) snrh 2 P 2 x 2 snr ( y snrh P x ) snrh 2 P 2 x 2 (82) = snr ( (H P x ) (H 2 P 2 x 2 ) )( y snrh P x snrh 2 P 2 x 2 ) p y x,x 2 (y x,x 2 ) (83) = snr ( (H P x ) (H 2 P 2 x 2 ) ) y p y x,x 2 (y x,x 2 ) (84) Therefore, we have: E x,x 2 snr p y x,x 2 (y x,x 2 ) ] = E x,x 2 ( (H P x ) (H 2 P 2 x 2 ) ) ] y p y x,x snr 2 (y x,x 2 ) (85) Substitute (85) into (79), we get: di(x,x 2 ;y) dsnr = snr (+log(p y (y)))e x,x 2 ( (H P x ) (H 2 P 2 x 2 ) ) = snr E x,x 2 ( y p y x,x 2 (y x,x 2 )]dy (86) (+log(p y (y))) ( )] (H P x ) (H 2 P 2 x 2 ) ) y p y x,x 2 (y x,x 2 )dy (87)

26 26 Using integration by parts applied to the real and imaginary parts of y we have: (+log(p y (y))) p y x,x 2 (y x,x 2 ) dt = t (+log(p y (y)))p y x,x 2 (y x,x 2 ) p y (y) p y (y) p y x,x t 2 (y x,x 2 )dt (88) The first term in (88) goes to zero as y. Therefore, di(x,x 2 ;y) dsnr di(x,x 2 ;y) dsnr di(x,x 2 ;y) dsnr However, = snr E x,x 2 = snr = snr y p y (y) = y E x,x 2 py x,x 2 (y x,x 2 ) ] ( ((H P x ) (H 2 P 2 x 2 ) ) p y x,x 2 (y x,x 2 ) p y (y) )] y p y (y)dy y p y (y)e x,x 2 ((H P x ) (H 2 P 2 x 2 ) ) p y x,x 2 (y x,x 2 ) p y (y) (89) ] dy (90) y p y (y)e x,x 2 ((H P ) E x yx y] (H 2 P 2 ) E x2 yx 2 y] ) dy (9) = E x,x 2 y p y x,x 2 (y x,x 2 ) ] = E x,x 2 py x,x 2 (y x,x 2 ) ( y snrh P x snrh 2 P 2 x 2 )] = E x,x 2 py (y) ( y snrh P x snrh 2 P 2 x 2 ) y ] = p y (y) ( y snrh P E x yx y] snrh 2 P 2 E x2 yx 2 y] ) (92) Substitute (92) into (9) we get: di(x,x 2 ;y) dsnr = snr p y (y) ( y snrh P E x yx y] snrh 2 P 2 E x2 yx 2 y] ) E x,x 2 ((H P ) E x yx y] (H 2 P 2 ) E x2 yx 2 y] ) dy (93) di(x,x 2 ;y) dsnr = snr E y yx ](H P ) snr E y yx 2 ](H 2P 2 ) E y H P E x yx y]e x yx y] (H P ) +E y H P E x yx y]e x2 yx 2 y] ](H 2 P 2 ) +E y H 2 P 2 E x2 yx 2 y]e x2 yx 2 y] (H 2 P 2 ) E y H 2 P 2 E x2 yx 2 y]e x yx y] ](H P ) (94)

27 27 Therefore, di(x,x 2 ;y) dsnr = H P E x x x ](H P ) H P E y E x yx y]e x yx y] (H P ) +H P E y E x yx y]e x2 yx 2 y] ](H 2 P 2 ) H 2 P 2 E x2 x 2 x 2](H 2 P 2 ) +H 2 P 2 E y E x2 yx 2 y]e x2 yx 2 y] (H 2 P 2 ) H 2 P 2 E y E x yx y]e x2 yx 2 y] ](H P ) di(x,x 2 ;y) dsnr = H P E (H P ) H 2 P 2 E 2 (H 2 P 2 ) +H P E y E x yx y]e x2 yx 2 y] ](H 2 P 2 ) H 2 P 2 E y E x2 yx 2 y]e x yx y] ](H P ) Therefore, due to the fact that the expectation remains the same ify CN( snrh P x + snrh 2 P 2 x 2,I) ory CN( snrh P x snrh 2 P 2 x 2,I), therefore,ex x ] = Ex x ] andeex y]ex y] ] = EEx y]ex y] ], and similarly for the other input, the derivative of the mutual information with respect to the SNR and the per users mmse and input estimates (or covariances) is as follows: di(x,x 2 ;y) dsnr } = mmse (snr)+mmse 2 (snr)+tr {H P E y x x 2 ](H 2P 2 ) } Tr {H 2 P 2 E y x 2 x ](H P ) Therefore, we can write the derivative of the derivative of the mutual information with respect to the snr as follows: di(snr) dsnr = mmse(snr) + ψ(snr) (95) Therefore, Theorem has been proved as a generalization of the one by Guo, Shamai, Verdu in 2] to the multiuser case.

28 28 X. APPENDIX B: PROOF OF THEOREM 3 The conditional probability density for the two-user MAC can be written as follows: p y x,x 2 (y x,x 2 ) = snrh P x snrh 2 P 2 x 2 2 (96) π nre y Thus, the corresponding mutual information is: I(x,x 2 ;y) = E log ( )] py x,x 2 (y x,x 2 ) p y (y) (97) I(x,x 2 ;y) = n r log(πe) Elog(p y (y))] (98) Then, the gradient of the mutual information with respect to the channel of user on the two-user MAC is as follows: I(x,x 2 ;y) H = H p y (y)log(p y (y))dy (99) ( = p y (y) = ) p y (y) +log(p py (y) y(y)) dy (00) H (+log(p y (y))) p y(y) dy (0) H Where the probability density function of the received vector y is given by: p y (y) = x,x 2 p y x,x 2 (y x,x 2 )p x,x 2 (x,x 2 ) (02) = E x,x 2 py x,x 2 (y x,x 2 ) ] (03) The derivative of the conditional output can be written as: p y x,x 2 (y x,x 2 ) H = p y x,x 2 (y x,x 2 ) ( y snrh P x ) snrh 2 P 2 x 2 H ( y snrh P x snrh 2 P 2 x 2 ) (04) = p y x,x 2 (y x,x 2 ) ( y snrh P x snrh 2 P 2 x 2 ) snrx P (05)

29 29 = y p y x,x 2 (y x,x 2 ) snrx P (06) Therefore, we have: ] E x,x 2 H p y x,x 2 (y x,x 2 ) = E x,x2 y p y x,x 2 (y x,x 2 ) ] snrx P (07) Substitute (07) into (0), we get: I(x,x 2 ;y) = H (+log(p y (y)))e x,x 2 y p y x,x 2 (y x,x 2 ) = E x,x 2 ( snrx P ]dy (08) ) ] snrx (+log(p y (y))) y p y x,x 2 (y x,x 2 )dy P (09) Using integration by parts applied to the real and imaginary parts of y we have: (+log(p y (y))) p y x,x 2 (y x,x 2 ) dt = t (+log(p y (y)))p y x,x 2 (y x,x 2 ) p y (y) p y (y) p y x,x t 2 (y x,x 2 )dt (0) The first term in (0) goes to zero as y. Therefore, ( ) ] I(x,x 2 ;y) py x,x = E H x,x 2 2 (y x,x 2 ) snrx y p y (y)dy p y (y) P () ] I(x,x 2 ;y) py x,x = H y p y (y)e 2 (y x,x 2 ) x,x 2 snrx p y (y) P dy (2) I(x,x 2 ;y) = snr y p y (y)e x yx y] P dy (3) However, H y p y (y) = y E x,x 2 py x,x 2 (y x,x 2 ) ] = E x,x 2 y p y x,x 2 (y x,x 2 ) ] = E x,x 2 py x,x 2 (y x,x 2 ) ( y snrh P x snrh 2 P 2 x 2 )] = E x,x 2 py (y) ( y snrh P x snrh 2 P 2 x 2 ) y ] = p y (y) ( y snrh P E x yx y] snrh 2 P 2 E x2 yx 2 y] ) (4)

30 30 Substitute (4) into (3) we get: I(x,x 2 ;y) H = p y (y) ( y snrh P E x yx y] snrh 2 P 2 E x2 yx 2 y] ) snrex yx y] P dy (5) I(x,x 2 ;y) H = snre y yx ]P snre y H P E x yx y]e x yx y] P snre y H 2 P 2 E x2 yx 2 y]e x2 yx y] ]P Therefore, I(x,x 2 ;y) H = snrh P E x x x ]P snrh P E y E x yx y]e x yx y] P snrh 2 P 2 E y E x2 yx 2 y]e x yx y] ]P I(x,x 2 ;y) H = snrh P E P snrh 2 P 2 E y E x2 yx 2 y]e x yx y] ]P (6) Similarly, we can derive the gradient of the mutual information in terms of the channel matrix that corresponds to the second user in the two-user MAC. I(x,x 2 ;y) H 2 = snrh 2 P 2 E 2 P 2 snrh P E y E x yx y]e x2 yx 2 y] ]P 2 (7) Therefore, the gradient of the mutual information with respect to per user channel and the per user MMSE and input estimates (or covariances) is as follows: H I(x,x 2 ;y) = snrh P E P snrh 2 P 2 E x 2 x ]P (8) H2 I(x,x 2 ;y) = snrh 2 P 2 E 2 P 2 snrh P E x x 2 ]P 2 (9) Therefore, Theorem 3 has been proved.

31 3 XI. APPENDIX C: PROOF OF THEOREM 4 The gradient of the mutual information with respect to the precoding matrix of user on the two-user MAC is as follows: I(x,x 2 ;y) = p P P y (y)log(p y (y))dy (20) ( ) = p y (y) p y (y) +log(p py (y) y(y)) dy (2) P = (+log(p y (y))) p y(y) dy (22) P The derivative of the conditional output can be written as: p y x,x 2 (y x,x 2 ) P = p y x,x 2 (y x,x 2 ) ( y snrh P P x ) snrh 2 P 2 x 2 ( y snrh P x ) snrh 2 P 2 x 2 (23) = p y x,x 2 (y x,x 2 )H ( y snrh P x snrh 2 P 2 x 2 ) x (24) = snrh yp y x,x 2 (y x,x 2 )x (25) Therefore, we have: ] E x,x 2 P p y x,x 2 (y x,x 2 ) = E x,x2 ] snrh y p y x,x 2 (y x,x 2 )x (26) Substitute (26) into (22), we get: I(x,x 2 ;y) = P = E x,x 2 snrh snrh ] (+log(p y (y)))e x,x 2 yp y x,x 2 (y x,x 2 )x dy (27) ( Repeating the same steps as in (0), we have: I(x,x 2 ;y) P I(x,x 2 ;y) P ) ] (+log(p y (y))) y p y x,x 2 (y x,x 2 )dy x ( snrh py x,x = E x,x 2 2 (y x,x 2 ) p y (y) snrh = y p y (y)e x,x 2 py x,x 2 (y x,x 2 ) p y (y) ) ] y p y (y)dy x x (28) (29) ] dy (30)

32 I(x,x 2 ;y) P Substitute (4) into (3) we get: = snr H y p y (y)e x yx y] dy (3) 32 I(x,x 2 ;y) P = snrh p y (y) ( y snrh P E x yx y] snrh 2 P 2 E x2 yx 2 y] ) E x yx y] dy I(x,x 2 ;y) P = snrh E y yx ] snrh E y H P E x yx y]e x yx y] snrh E yh 2 P 2 E x2 yx 2 y]e x yx y] ] Therefore, I(x,x 2 ;y) P = snrh H P E x x x ] snrh H P E y E x yx y]e x yx y] snrh H 2P 2 E y E x2 yx 2 y]e x yx y] ] (32) I(x,x 2 ;y) P = snrh H P E snrh H 2 P 2 E y E x2 yx 2 y]e x yx y] ] (33) Similarly, we can derive the gradient of the mutual information in terms of the channel matrix that corresponds to the second user in the two-user MAC. I(x,x 2 ;y) P 2 = snrh 2H 2 P 2 E 2 snrh 2H P E y E x yx y]e x2 yx 2 y] ] (34) Therefore, the gradient of the mutual information with respect to per user precoding and the per user MMSE and input estimates (or covariances) is as follows: P I(x,x 2 ;y) = snrh H P E snrh H 2 P 2 E y x 2 x ] (35) P2 I(x,x 2 ;y) = snrh 2H 2 P 2 E 2 snrh 2H P E y x x 2] (36) Therefore, Theorem 4 has been proved.

33 33 XII. APPENDIX D: PROOF OF THEOREM 5 From the steps in Theorem 3, we can see that: p y (y) ( y snrh P E x yx y] snrh 2 P 2 E x2 yx 2 y] ) = E x,x 2 py x,x 2 (y x,x 2 ) ( y snrh P x )] snrh 2 P 2 x 2 (37) Therefore, snrh P E x yx y] snrh 2 P 2 E x2 yx 2 y] Thus, = y E x,x 2 py x,x 2 (y x,x 2 )(y snrh P x snrh 2 P 2 x 2 ) ] p y (y) = y+ E x,x 2 y p y x,x 2 (y x,x 2 ) ] p y (y) = y+ ye x,x 2 py x,x 2 (y x,x 2 ) ] snrh P Ex y] snrh 2 P 2 Ex 2 y] = y+ yp y (y) p y (y) p y (y) (38) (39) Therefore, Theorem 5 has been proved. XIII. APPENDIX E: PROOF OF THEOREM 6 The MMSE Wiener filters are known to be MSE minimizers. In fact, this kind of receive filters inherently include the linear MMSE matrix. Therefore, to start the proof of the theorem, lets first define the linear MMSE as: mmse(snr) = E y H P (x x ) 2] +E y H2 P 2 (x 2 x 2 ) 2], (40) }{{}}{{} MMSE MMSE2 with the linear estimates should be found by multiplying the received vector y by the receive filter H r, x = H r y (4) x 2 = H r2 y (42)

34 34 We break down the problem into two parts for each per user MMSE. Notice that we call it MMSE since our target is the minimum MSE, therefore, we first take the first part, i.e., MSE and break it down; it follows that: Ẽ = E y H P (x x ) 2] (43) = E y H P (x x )(x x ) (H P ) ] (44) = E y (H P x H P x )(H P x H P x ) ] (45) = E x H P x x (H P ) ] }{{} first term E x ] E x H P x x (H P ) }{{} second term ] H P x x (H P ) }{{} third term +E x H P x x (H P ) ] }{{} forth term (46) Lets work on each term in (46) separately. Notice that E x x x ] = E x 2 x 2 x 2 ] = I, E x x x T ] = E x2 x 2 x T 2 ] = 0, E x,x 2 x 2 x ] = E x,x 2 x x 2 ] = 0, E nnn ] = I, and E n nn T ] = 0. The first term is: E x (H P x x (H P ) ] = E x H P (H P ) ], (47) The second term is: E x H P x x (H P ) ] = E x H P x (H r y) (H P ) ] (48) E x H P x y H r(h P ) ] = E x H P x (H P x +H 2 P 2 x 2 +n) H r(h P ) ] = E x H P P H H r(h P ) ] (49) (50) The third term is: E x H P x x (H P ) ] = E x H P H r yx (H P ) ] (5) = E x H P H r H P (H P ) ] (52)