# Linear precoding in distributed MIMO systems with partial CSIT

- Chongbin Xu
^{1}Email author, - Jianwen Zhang
^{1}, - Fuchun Zheng
^{2}and - Li Ping
^{1}

**2013**:22

https://doi.org/10.1186/1687-6180-2013-22

© Xu et al.; licensee Springer. 2013

**Received: **21 June 2012

**Accepted: **5 January 2013

**Published: **19 February 2013

## Abstract

We study the transmission problem in a distributed multiple-input multiple-output (MIMO) system consisting of several distributed transmitters and a common receiver. Assuming partial channel state information at the transmitter (CSIT), we propose a low-cost weighted channel matching and scattering (WCMS) linear precoding strategy. The proposed precoder can be decomposed into two parallel modules: channel matching (CM) and energy scattering. The signals generated by the CM modules from different transmitters provide a *coherent* gain with improved power efficiency. The use of the scattering modules provides robustness against CSIT uncertainty. By properly combining these two modules, WCMS can achieve coherent gain proportional to the accuracy of the available CSIT as well as robustness against CSIT error. WCMS is simple and fully decentralized and thus is highly suitable for a distributed MIMO system. Numerical results demonstrate that WCMS indeed achieves significant gains in distributed MIMO environments with partial CSIT.

## Keywords

## 1. Introduction

Consider a distributed multiple-input multiple-output (MIMO) system involving several distributed transmitters and a common receiver [1–8]. All the transmitters share the same information to be transmitted. Every transmitter is equipped with multiple antennas, so is the receiver. Thus, the channel between a transmitter and the receiver forms a local MIMO link. The overall system consists of several such local links. Examples of this system can be found in the scenarios such as distributed MIMO systems [1–4] or parallel relays serving the same destination after recovering the data from the source in relaying systems [5–8].

If full channel state information at the transmitter (CSIT) for all the local links is available at every transmitter, the overall system can be regarded as an equivalent MIMO system and optimized using a centralized strategy [9, 10]. However, this full CSIT assumption can be very costly due to its heavy requirement on feedback links. The problem becomes very stringent when the total number of antennas involved is large (e.g., in a so-called large-scale MIMO setting [11, 12]).

Partial CSIT is a more realistic assumption. In particular, each transmitter can acquire the CSIT of its local reverse link (from the receiver) using channel estimation. With time division duplex (TDD) and based on channel reciprocity, such CSIT can also be used for the local forward link [13]. This can greatly reduce the burden on the feedback requirement, but then a decentralized transmission method is necessary. The problem becomes more complicated when the CSIT on each local link is not reliable, which can be caused by, e.g., channel variation due to high mobility [14]. Improving channel estimation accuracy alone cannot solve the problem completely.

The standard singular value decomposition (SVD)-based techniques [15] do not perform well when CSIT is not reliable. Conventional space–time coding techniques [16, 17], on the other hand, are not efficient in making use of the available CSIT. It is a challenging task to develop transmission techniques that are efficient in exploiting the advantage of partial CSIT and, in the meanwhile, robust against the CSIT error.

Linear precoding techniques have widely been studied for MIMO systems, mostly in centralized scenarios [14, 18–24]. Optimization techniques have been applied to provide robust performance in case of imperfect CSIT [14, 23, 24]. These precoding techniques usually involve complicated matrix operations, such as matrix inversion, QR decomposition, or SVD. The related complexity is quite high, which can be a major obstacle in practice, especially for a large-scale MIMO setting.

In this article, we study a weighted channel matching and scattering (WCMS) strategy for distributed MIMO systems with partial CSIT. It involves a linear precoder at each transmitter that can be decomposed into two parallel modules, one for channel matching (CM) and the other for energy scattering. The signals generated by the CM modules from different transmitters add coherently at the receiver, resulting in a coherent gain with improved power efficiency. On the other hand, the use of the scattering modules provides robustness against CSIT uncertainty. By properly combining these two modules, we can achieve the coherent gain proportional to the accuracy of the available CSIT as well as robustness against CSIT error. The WCMS scheme is fully decentralized since each transmitter only needs to know the CSIT about its own link. The scheme is also very simple and there is no need for SVD or matrix inversion, and thus it is highly suitable for large-scale MIMO systems.

Our discussions will be based on both mutual information analysis and numerical simulation. For the former, the channel capacity of the distributed MIMO system under consideration is still unknown. We will show that the WCMS scheme can perform close to a referenced centralized scheme. We conjecture that this centralized scheme can perform close to or even beyond the capacity of the decentralized system, which implies that the WCMS performance is not far from the optimum. For numerical simulation, we focus on an iterative linear minimum mean squared error (LMMSE) detection technique. An extra precoding stage is introduced to reduce the potential performance loss in practically coded systems due to the fluctuation in symbol reliabilities. Simulation results show that the proposed scheme indeed achieves significant gain in distributed MIMO environments with partial CSIT.

The remainder of the article is organized as follows. Section 2 introduces the system model and Section 3 provides some mutual information analysis results of centralized MIMO systems with imperfect CSIT. In Section 4, a distributed WCMS scheme is presented and its outage performance is analyzed. The implementation of the WCMS method in a low-density parity-check (LDPC)-coded system with iterative detection is discussed in Section 5. Section 6 concludes the whole article.

## 2. System model

*K*transmitters {

*T*

_{1},…,

*T*

_{ k },…

*T*

_{ K }} serving a common receiver cooperatively to deliver a common information sequence d, as illustrated in Figure 1. The receiver has

*N*

_{ r }antennas and each transmitter has

*N*

_{ t }antennas. The received signal is given by

*N*

_{ r }×1 received signal vector, H

_{ k }is the

*N*

_{ r }×

*N*

_{ t }channel transfer matrix between the receiver and the transmitter

*T*

_{ k }, η a vector of complex additive white Gaussian noise samples with mean

**0**and variance

*σ*

^{2}I, and y

_{ k }a

*N*

_{ t }×1 signal vector transmitted by

*T*

_{ k }with a zero mean and a power constraint

*P*

_{ k }, i.e.,

*E*[∙] is the expectation operation and Q

_{ k }=

*E*y

_{ k }y

_{ k }

^{ H }is the transmission covariance matrix of

*T*

_{ k }. Note that all {y

_{ k }} in (1) carry the same information sequence d as mentioned previously. This is different from the transceiver design in the conventional multiple access channel where different transmitters have different information sequences to transmit [25, 26].

*T*

_{ k }and the receiver as

where H
_{
k
} is the actual channel transfer matrix and is perfectly known at the receiver, ${\stackrel{\u2015}{\mathit{H}}}_{k}$ and ${\tilde{\mathit{H}}}_{k}$ represent, respectively, the known and unknown parts of the channel matrix at *T*
_{
k
}, and *α*
_{
k
} ∈ [0,1] is a measure on the CSIT quality. In practice, ${\stackrel{\u2015}{\mathit{H}}}_{k}$ in (2) can be obtained by using channel estimation and ${\tilde{\mathit{H}}}_{k}$ is related to channel variation during the channel estimation period [14]. In TDD systems, ${\stackrel{\u2015}{\mathit{H}}}_{k}$ can be estimated from the signal received in the last frame and *a*
_{
k
} in this case is the correlation coefficient of channel matrices in two adjacent frames [27]. Throughout the article, we assume that the entries of $\left\{{\stackrel{\u2015}{\mathit{H}}}_{k}\right\}$ and $\left\{{\tilde{\mathit{H}}}_{k}\right\}$ are independent and identically distributed (i.i.d.) circularly symmetric complex Gaussian random variables with zero mean and unit variance.

The following is a basic assumption in this article (referred to as the *distributive assumption*).

**Assumption 1:** Each *T*
_{
k
} knows ${\stackrel{\u2015}{\mathit{H}}}_{k}$ and {*α*
_{
k'
}} for all *k*
^{
′
}, but it does not know ${\tilde{\mathit{H}}}_{k}$. Furthermore, each *T*
_{
k
} knows neither ${\stackrel{\u2015}{\mathit{H}}}_{{k}^{\text{'}}}$ nor ${\tilde{\mathit{H}}}_{{k}^{\text{'}}}$ for all *k*
^{
′
} ≠ *k*.

## 3. Centralized transmissions

The capacity of the distributed system in (1) is generally unknown. To circumvent the difficulty, we first remove the distributive assumption temporarily and consider several centralized transmission strategies in this section. We then use the obtained results as an approximate upper bound to evaluate the performance of the distributed transmission strategy developed in the next section.

*α*for all {

*T*

_{ k }}, i.e.,

*α*

_{1}=···=

*α*

_{ K }=

*α*. Substituting (2) into (1a), we have

*E*[yy

^{ H }] and

*P*is the total power constraint. Take decomposition Q = FF

^{ H }. Then Q can be realized by a linear precoding scheme as

Here we assume that x is a coded sequence with i.i.d. symbols with *E*[x] = **0** and *E*[xx
^{
H
}] = I.

### 3.1.Optimal centralized transmission with perfect CSIT

*α*= 1. (We will consider 0 ≤

*α*< 1 in Section 3.3.) In this case, the CSIT is perfect and we have $\mathit{H}=\stackrel{\u2015}{\mathit{H}}$. Define $\mathit{M}={\stackrel{\u2015}{\mathit{H}}}^{H}\stackrel{\u2015}{\mathit{H}}$ Let the eigenvalue decomposition of M be $\mathit{M}=\stackrel{\u2015}{\mathit{V}}\phantom{\rule{0.12em}{0ex}}\Lambda {\stackrel{\u2015}{\mathit{V}}}^{H}$ with $\stackrel{\u2015}{\mathit{V}}$ a unitary matrix consisting of eigenvectors of M and Λ a diagonal matrix consisting of eigenvalues of M. Then the optimal precoder is given by the so-called water-filling (WF) solution

*w*(

*i*,

*i*) and

*λ*(

*i*,

*i*) are, respectively, the

*i*th diagonal elements of matrices W and Λ,

*a*

^{+}≡ max{0,

*a*}, and

*μ*is a constant to meet the total power constraint

*P*:

We have $\mathit{Q}=\stackrel{\u2015}{\mathit{V}}\phantom{\rule{0.12em}{0ex}}{\mathit{W}}^{2}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{V}}}^{H}$ for the above WF precoder.

### 3.2. Suboptimal CM precoder

*c*is a constant for power adjustment. Clearly, this is a very simple solution. Figure 2 compares its average mutual information performance (based on Gaussian signaling) with WF for Rayleigh-fading MIMO channels. The channels are assumed to be unchanged during a frame but change independently from frame to frame. The performance in Figure 2 is averaged over different frames. It is seen that the CM precoder can achieve performance close to the capacity in the median rate region. This observation can be explained as follows. Let $\stackrel{\u2015}{\mathit{V}}\phantom{\rule{0.12em}{0ex}}\stackrel{\u2015}{\mathit{D}}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{U}}}^{H}$ be the SVD of ${\stackrel{\u2015}{\mathit{H}}}^{H}$ and rewrite (7) as

Equation (8) can also be obtained by replacing W in the optimal WF precoder (6a) by $c\stackrel{\u2015}{\mathit{D}}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{U}}}^{H}$. As ${\stackrel{\u2015}{\mathit{U}}}^{H}$ is unitary, it does not affect mutual information. Therefore, the performance difference between (6a) and (8) is caused by W and $c\stackrel{\u2015}{\mathit{D}}$. It can be shown that the amplitudes of the diagonal entries of W and $\stackrel{\u2015}{\mathit{D}}$ have the same order (i.e., if $\stackrel{\u2015}{\mathit{D}}\left(i,i\right)$ is the *i* th largest entry in $\stackrel{\u2015}{\mathit{D}}$, so is *W*(*i*, *i*) in W). This implies that $c\stackrel{\u2015}{\mathit{D}}$ has an approximate WF effect similar to W and explains the close performance of (6a) and (8).

For comparison, we also show in Figure 2 the results of equal power (EP) allocation, in which the transmitted signal is given by y = *c'* x with *c'* a constant to meet the power constraint. It is seen that CM outperforms EP in the low-to-median rate regions. When rate becomes very high, EP becomes superior. This is because EP is asymptotically optimal when rate *R* → ∞. In practice, the median rate region (e.g., *R* ≈ min{*N*
_{
t
}, *N*
_{
r
}}) is of most interest, which indicates the attractiveness of the CM option.

### 3.3. Centralized control with partial CSIT

*α*= 0), according to the conjecture in [29], the precoding operation given below is optimal (for a sufficiently small outage probability):

The signal power in the above scheme is scattered evenly over all directions and so we will refer to it as scattering precoding.

In the general case of 0 < *α* < 1, the optimal precoder structure that achieves ergodic capacity of the system in (3) (under the assumption that the entries of $\left\{{\tilde{\mathit{H}}}_{k}\right\}$ are i.i.d. circularly symmetric complex Gaussian random variables) is given by $\mathit{y}=\stackrel{\u2015}{\mathit{V}}\phantom{\rule{0.12em}{0ex}}\mathit{\Omega x}$, where $\stackrel{\u2015}{\mathit{V}}$ is obtained from SVD of $\stackrel{\u2015}{\mathit{H}}$ (i.e., $\stackrel{\u2015}{\mathit{H}}=\stackrel{\u2015}{\mathit{U}}\phantom{\rule{0.12em}{0ex}}\stackrel{\u2015}{\mathit{D}}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{V}}}^{H}$) and Ω is a real diagonal matrix [27]. According to the best of the authors’ knowledge, the optimal precoder structure that achieves outage capacity is still an open problem even for a centralized transmission. The following conjecture is given to circumvent the difficulty.

**Conjecture 1:** The optimal precoder F in (5) that achieves the outage capacity of the system in (3) is given by $\mathit{y}=\stackrel{\u2015}{\mathit{V}}\phantom{\rule{0.12em}{0ex}}\mathit{\Omega x}$, where $\stackrel{\u2015}{\mathit{V}}$ is obtained from SVD $\stackrel{\u2015}{\mathit{H}}=\stackrel{\u2015}{\mathit{U}}\phantom{\rule{0.12em}{0ex}}\stackrel{\u2015}{\mathit{D}}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{V}}}^{H}$ and Ω is a real diagonal matrix.

Under the above conjecture, to find the outage capacity, we only need to find the real diagonal matrix Ω, which is a simpler task than finding a full matrix F. It can be done by exhaustive search when the size of H is relatively small. However, the search becomes complicated as the size of H increases.

where *β* ∈ [0, 1] is a variable to be optimized according to the CSIT quality *α* and the power constraint *P*, and *c* is a constant for power adjustment. In (10), x
_{0} and x
_{
d
} are two statistically independent coded sequences obtained by encoding the same information sequence d with different coding schemes, and both of them consist of i.i.d. symbols with zero mean and unit variance. Here, the use of x
_{0} provides a beamforming effect as it steers more energy at good eigenmodes. On the other hand, the use of x
_{
d
} provides a scattering effect since it scatters the energy evenly in all eigenmodes. Clearly, the scheme in (10) provides a weighted combination of these two effects.

_{0}and x

_{ d }in (10) are uncorrelated, Q in (4) is given by

where Q
^{CM} and Q
^{ES}, respectively, are the transmission covariance matrices for the CM and energy scattering schemes in (7) and (9). Clearly, the scheme in (10) reduces to (7) and (9), respectively, when *β* = 1 for *α* = 1, and *β* = 0 for *α* = 0. For a general *α*, the optimal *β* can be obtained by a one-dimensional exhaustive search. This search is based on channel statistical distributions and so the complexity involved is modest. In practice, it can be performed at the receiver and then the result is fed back to the transmitters.

*α*= 1 and

*α*= 0, as seen from the numerical results provided in Figure 3. This is possible since both approaches are suboptimal in general.

Figure 3 compares the outage performance of the WCMS scheme (assuming Gaussian signaling) with the outage capacity (under Conjecture 1) obtained using full search (FS) for a centralized MIMO channel. The channels are assumed to be unchanged in a frame but change independently from frame to frame. The instantaneous mutual information of each frame is calculated and compared with the target rate *R* to obtain the outage probability. The curves are obtained based on the system in (3) without the distributive assumption. Therefore, the outage probability in Figure 3 is a lower bound of the outage of the distributive system in (1). It is seen that the WCMS performance is quite close to the outage capacity. We have made similar observations for other system parameters within the range of our computing power. We expect that WCMS also performs well in more general cases but we do not have a rigorous justification so far.

As it is very time consuming to compute the outage capacity for relatively large system sizes (even using Conjecture 1), we will use the centralized WCMS performance as a coarse estimate of the lower bound of the outage performance of the distributed schemes in our discussions hereafter.

## 4. Distributed linear precoding and outage analysis

In this section, we discuss design technique for distributed linear precoding and study its theoretical performance based on mutual information analysis.

### 4.1. Distributed linear precoding

_{ k }from

*T*

_{ k }is given by

This construction almost meets Assumption 1, since only ${\stackrel{\u2015}{\mathit{H}}}_{k}$ is required to generate y
_{
k
}.

*P*in (4) involves the global coordination. We can change (4) to the local constraints below

*c*

_{ k }is a constant to meet the power constrain

*P*

_{ k }at

*T*

_{ k }. Recall that the common weighting coefficient

*β*for all {

*T*

_{ k }} in (13c) results from the assumption that the CSIT quality

*α*is the same for all {

*T*

_{ k }}. In a more general case,

*α*may vary with

*T*

_{ k }, and so does

*β*. In the latter case, we rewrite (13c) as

Then the transmission scheme becomes fully distributed. We will refer to the scheme in (13d) as the distributed WCMS precoding.

### 4.2. Coherent gain

*α*

_{ k }> 0, ∀

*k*, as analyzed below. Define ${\stackrel{\u2015}{\mathit{A}}}_{k}\equiv {c}_{k}{\stackrel{\u2015}{\mathit{H}}}_{k}{\stackrel{\u2015}{\mathit{H}}}_{k}^{H}$ and ${\tilde{\mathit{A}}}_{k}\equiv {c}_{k}\phantom{\rule{0.12em}{0ex}}{\tilde{\mathit{H}}}_{k}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{H}}}_{k}^{H}$. Combining (1), (2), and (13d), we have

_{coh}the coherent component of r, where

_{0}is an i.i.d. sequence with

*E*[x

_{0}x

_{0}

^{ H }] =

*I*, the received power related to r

_{coh}is given by

*λ*

_{ n }(A) is the

*n*th eigenvalues of matrix A in the increasing order. From (17a) and (17b), all the terms in (16) are positive and add “

*coherently*”, which is the cause of

*coherent gain*. We can see such gain more clearly in the special case of

*N*

_{ r }

*= N*

_{ t }

*=*1 when ${\stackrel{\u2015}{\mathit{A}}}_{k}$ reduces to a scalar ${\stackrel{\u2015}{\mathit{a}}}_{k}={c}_{k}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{h}}}_{k}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{h}}}_{k}^{H}$ ≥ 0. Hence,

The terms $\left\{{\left|{\stackrel{\u2015}{\mathit{a}}}_{k}\right|}^{2}\right\}$ and $\left\{{\stackrel{\u2015}{\mathit{a}}}_{k}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{a}}}_{k\text{'}}^{H}\right\}$ are all positive and so add coherently.

We emphasize that coherent gain is the consequence of the inequality in (17b), which holds for positive semi-definite Hermitian matrices $\left\{{\stackrel{\u2015}{\mathit{A}}}_{k}\right\}$. Such gain is highly desirable from power efficiency point of view, which is a noticeable advantage of CM precoding. We will demonstrate this advantage using numerical results in Section 4.3. The key for such gain is that $\left\{{\stackrel{\u2015}{\mathit{A}}}_{k}\right\}$ in (16) are positive semi-definite.

*β*

_{1}=···=

*β*

_{ K }= 1 for

*α*

_{1}=···=

*α*

_{ K }= 1. In this case, (14) reduces to

*T*

_{ k }as ${C}_{k}={\mathrm{\text{log}}}_{2}\mathrm{\text{det}}\left(\mathit{I}+{\stackrel{\u2015}{\mathit{A}}}_{k}\phantom{\rule{0.12em}{0ex}}{\stackrel{\u2015}{\mathit{A}}}_{k}^{H}/{\sigma}^{2}\right)$. If ${\stackrel{\u2015}{\mathit{A}}}_{k}$ is not positive semi-definite, then there is a possibility that

*C*<

*C*

_{ k }. Thus distributed cooperation may not necessarily lead to the capacity improvement. On the other hand, (20) can be rewritten as [30]

From (21) and (23), CM precoding guarantees that *C* ≥ *C*
_{
k
}, which implies a coherent effect.

### 4.3. Numerical results

Now we present some numerical results to demonstrate the performance of the proposed scheme.

*K*= 3. For simplicity, we fix the large-scale fading factor seen by

*T*

_{ k }to be a constant

*g*

_{LS}(

*k*),

*k*= 1, 2,…,

*K*. (The values of {

*g*

_{LS}(

*k*)} are given in the caption of Figure 5.) We assume that {

*g*

_{LS}(

*k*)} are known by all transmitters and the power constraints {

*P*

_{ k }} can be adjusted correspondingly. For distributed WCMS, this power allocation is given by

The Rayleigh fading factors are the same as in Figure 4. Two search methods are used to find {*β*
_{
k
}} in (13d). Method 1 is the *K*-dimensional exhaustive search. Method 2 assumes that *β*
_{
k
}/*β*
_{1} = *α*
_{
k
}/*α*
_{1}, *k* = 2,…,*K* and finds the optimal *β*
_{1} using the exhaustive search. From Figure 5, we can see that the two methods obtain almost the same performance.

Next we consider the performance of the proposed scheme when the CSIT quality varies. For simplicity, we assume that *α*
_{
k
} = *α* for all {*T*
_{
k
}}.

*α*is assumed for all {

*T*

_{ k }}. We can make observations from Figure 6 similar to those from Figure 4. The distributed WCMS can obtain significant performance improvement as the CSIT quality increases, and it performs closely to centralized WCMS.

*K*= 3. The large-scale fading factors are the same as in Figure 6. For the Rayleigh fading, each transmitter sees a MIMO ISI channel with

*N*

_{ t }= 2 transmit antennas,

*N*

_{ r }= 2 receive antennas, and

*L*= 4 delay taps that are uniformly distributed. The total average gain over the

*L*paths between each transmit–receive antenna pair is normalized to 1. The number of OFDM subcarriers is

*J*= 32. The extended channel model in Section 5.1 is adopted to represent the MIMO OFDM systems with a single channel transfer matrix. Comparing Figures 6 and 7, we can see that the gaps between the distributed and centralized WCMS schemes are narrower in the multicarrier case than in the single carrier one, implying that the performance loss incurred by the distributive requirement becomes smaller.

## 5. Transmission in systems with practical coding

_{ k }in the distributed WCMS precoder in (13) is generated from x

_{0}and x

_{ k },

*k*= 1, 2,…,

*K*. The following are the basic requirements on {x

_{ k }},

- (i)
all {x

_{ k }} are generated based on a common information sequence d, - (ii)
every x

_{ k }consists of i.i.d. elements, and - (iii)
{x

_{ k }} are mutually uncorrelated of each other.

The above requirements on {x
_{
k
}} are related to the mutual information analysis in Section 4. They are not sufficient to guarantee good performance in practically coded systems. For example, we may simply generate {x
_{
k
}} by segmenting a single FEC-coded sequence c. In this way, different elements in c undergo different channel conditions and suffer from different levels of interference. Such variation of channel conditions may bring about adverse effect on performance. Below, we will outline a treatment to the problem using an extra stage of linear precoding [31, 32].

### 5.1. Diversity linear precoding

*t*th samples of the ${\underset{\u2015}{\mathit{N}}}_{r}\times {\underset{\u2015}{\mathit{N}}}_{t}$ transfer matrix of the MIMO channel seen by the transmitter

*T*

_{ k }. We define an extended channel model, for which H

_{ k }is obtained by sampling ${\underset{\u2015}{\mathit{H}}}_{k}$

*T*times as

In practice, H
_{
k
} can be obtained by using the MIMO channel *T* times consecutively in time domain or *T* subcarriers in frequency domain [31, 32]. Clearly, all the precoding techniques discussed so far can be applied to H
_{
k
} defined in (25). The system size is ${N}_{t}=T\phantom{\rule{0.12em}{0ex}}{\underset{\u2015}{\mathit{N}}}_{t}$ and ${N}_{r}=T\phantom{\rule{0.12em}{0ex}}{\underset{\u2015}{\mathit{N}}}_{r}$. The matrix augmentation in (25) does not lead to significant complexity increase, as explained in Section 5.2 later. With the extended channel model, we can ensure that all the elements in c will undergo the same channel condition, which leads to more robust performance. We will discuss the related details in the subsequent sections.

Let c be a length (*KN*
_{
t
} + *N*
_{
r
})*T* coded sequence generated by underlying FEC coding scheme using d as its input. Without loss of generality, the average power per entry of c is normalized to 1. With random interleaving, we can treat c as a sequence with i.i.d. symbols [33–37].

_{ k }} by an extra stage of linear precoding c as follows

_{ k }= I

_{ T }⊗ s

_{ k }} are used to segment the vector Pc with ⊗ being the Kronecker product. We construct s

_{0}and s

_{ k },

*k*= 1, 2,…,

*K*, as follows

These matrices segment Pc in a straightforward way. Note that the size of s
_{0} is *N*
_{
r
} × (*KN*
_{
t
} + *N*
_{
r
}) while the size of each s
_{
k
}, *k* ≥ 1, is *N*
_{
t
} × (*KN*
_{
t
} + *N*
_{
r
}). This is to match the sizes of ${\stackrel{\u2015}{\mathit{H}}}_{k}^{H}$ and ${\mathit{I}}_{{N}_{t}}$ in (13), respectively. [The Kronecker product S
_{
k
} = I
_{
T
} ⊗ s
_{
k
} means that all the matrices {S
_{
k
}} are block diagonal, which is consistent with the extended channel model in (25).] It can be verified that {x
_{
k
}} defined in (26) meet requirements (i)–(iii) mentioned above. (Recall that {x
_{
k
}} are constructed from c which is a coded sequence using the information sequence d as input. Hence, all {x
_{
k
}} will be related to the information sequence d.) We will explain the function of P below.

The matrix P in (26) is for diversity coding. In this article, we select P to be a size (*KN*
_{
t
} + *N*
_{
r
})*T* × (*KN*
_{
t
} + *N*
_{
r
})*T* normalized Hadamard matrix for the following reasons [31, 32]. First, a normalized Hadamard matrix is unitary and hence of full-rank. No capacity loss is caused by such P. Second, for a MIMO channel, different beams have different channel gains in general. The use of a Hadamard matrix can result in a diversity advantage. (We will return to this issue in Section 5.3.) Third, fast Hadamard transform (FHT) [38] allows efficient calculation, which is discussed in Section 5.2.

The diversity effect provided by P follows the discussions in [39, 40] in essence. A main feature of the approach taken in this article is the use of {F
_{
k
}} in Section 4 to best exploit the available CSIT so as to further improve the performance.

### 5.2. Detection principles

The optimal detection of c involves both the linear channel constraint and the nonlinear FEC coding constraint. This means a very high complexity in general. A suboptimal way is to consider the two constraints separately, which incurs certain performance loss. This loss can be compensated by the iterative detection outlined below.

*a priori*information of c (in the form of mean

*E*c and covariance

*v*I), ESE first performs the standard LMMSE detection of c, with output given by [41]

*v*AA

^{ H }+

*σ*

^{2}I. Then

*c*(

*i*) can be estimated symbol-by-symbol using (28).

The DEC performs standard *a posteriori* probability decoding using the output of the ESE as *a priori* information. The decoding output is used to update the values of *E*[c] and *v* for the sequence c. Then ESE performs LMMSE detection again. This process continues iteratively.

From (28), we can see that the complexity of LMMSE detection mainly lies in the calculation of R
^{–1}. It can be verified that R is a block diagonal matrix with *T* blocks and each block has a size of *N*
_{
r
} × *N*
_{
r
}. This means that R
^{–1} can be calculated with a complexity of *O*(*T* ⋅ *N*
_{
r
}
^{3}) [42]. All the other operations in (28) can be performed by FHT or block-by-block. Hence, the related complexity is modest for practical systems.

Note that the above LMMSE detection is suboptimal for the ESE. However, combined with the iterative detection, it can obtain near-optimal performance as shown in [43].

### 5.3. Diversity gains

In general, the elements of the received vector r = *r*(*i*) in (27) have different signal-to-interference plus noise ratios (SINRs). This is caused by the fluctuation of channel gains and interference levels in different antenna to antenna links. Consequently, the elements of $\widehat{\mathit{c}}=\left\{\widehat{c}\left(i\right)\right\}$ in (28) also have different SINRs. Such SINR fluctuation may lead to noticeable performance loss when $\left\{\widehat{c}\left(i\right)\right\}$ are used as the inputs to a decoder.

A treatment to the problem is outlined in [31, 32] using a linear precoding matrix. This is the function of matrix multiplication Pc in (26a). It is shown in [31, 32] that all the LMMSE estimation outputs have equal SINR when P is a Hadamard matrix with a sufficiently large size. This can be seen intuitively as follow. The *i* th column of P can be regarded as a spreading sequence and so each *c*(*i*) is spread into a sequence after the matrix multiplication Pc. This clearly has a diversity effect. Notice that there is no redundancy involved here since P is a square unitary matrix. Also, the related precoding and detection complexity is kept low when a Hadamard matrix is used for P, thanks to the FHT. The related discussions can be found in [31, 32].

Alternatively, we may also consider a conventional space–time code for diversity gain. However, this is not straightforward. Note that two stages of linear precoding are involved in (27). The first stage is the use of P and the second is the WCMS precoding discussed in Section 4. The linear operations in these two stages are combined to form the overall linear transform matrix A in (27). An efficient iterative LMMSE detection algorithm is available for the system in (27) based on FHT [31, 32]. On the other hand, detection complexity may become a serious problem when a conventional space–time coding technique is combined with the linear precoding technique discussed in Section 4.

### 5.4. Simulation in LDPC-coded systems

*K*= 3 and the large-scale fading factors are

*g*

_{LS}(1) = 0.5,

*g*

_{LS}(2) = 1,

*g*

_{LS}(3) = 2. For Rayleigh fading, each transmitter sees a MIMO ISI channel with

*N*

_{ t }= 2 transmit antennas,

*N*

_{ r }= 2 receive antennas, and

*L*= 4 delay taps. In simulation, the FEC code is a (3, 6) regular LDPC code followed by length-4 spreading, random interleaving and QPSK modulation, and the transmission rate is

*R*= 2 bits/symbol. The frame length is set to 4,096 information bits.

From Figure 9, we can see that the system performance improves progressively as the CSIT quality improves and similar trends as in Figure 7 can be observed. Compared with the no CSIT case, a considerable performance gain of about 3.9 dB (at FER = 10^{–2}) is obtained in the case of perfect CSIT, which is slightly less than the analytical result (i.e., 4.6 dB) in Figure 7. We expect that more sophisticated coding schemes can be used to improve performance and we are still working on this.

## 6. Conclusions

In this article, a WCMS linear precoding strategy is proposed for distributed MIMO systems with partial CSIT. The WCMS precoder consists of two parallel modules, one for CM to obtain a coherent gain, and the other for energy scattering to provide robustness against CSIT uncertainty. Both analytical and simulation results demonstrate that the proposed strategy can achieve the coherent gain proportional to the accuracy of the available CSIT as well as robustness against CSIT error. The strategy is very simple and fully decentralized and thus is highly suitable for distributed MIMO systems.

## Declarations

### Acknowledgement

The authors thank Alcatel-Lucent Shanghai Bell Co. Ltd for supporting the research work leading to this article and appreciate the beneficial discussions with the researchers in the Research and Innovation Center of Alcatel-Lucent Shanghai Bell.

## Authors’ Affiliations

## References

- Zhou S, Zhao M, Xu X, Yao Y: Distributed wireless communication system: a new architecture for public wireless access.
*IEEE Commun. Mag.*2003, 41(3):108-113. 10.1109/MCOM.2003.1186553View ArticleGoogle Scholar - Karakayali MK, Foschini GJ, Valenzuela RA: Network coordination for spectrally efficient communications in cellular systems.
*IEEE Wireless Commun. Mag.*2006, 13(4):56-61. 10.1109/MWC.2006.1678166View ArticleGoogle Scholar - Mietzner J, Hoeher PA: Improving the performance of mobile broadcasting systems using multiple base stations and distributed spacetime codes.
*IET Commun.*2007, 1(3):348-353. 10.1049/iet-com:20050185View ArticleGoogle Scholar - Adachi F, Takeda K, Yamamoto T, Matsukawa R, Kumagai S: Recent advances in single-carrier distributed antenna network.
*Wirel. Commun. Mob. Comput.*2011, 11(12):1551-1563. 10.1002/wcm.1212View ArticleGoogle Scholar - Schein B, Gallager RG:
*The Gaussian parallel relay network*. Proceedings of the IEEE International Symposium on Information Theory (ISIT’2000), Sorrento, Italy; 2000:22.Google Scholar - Laneman JN, Wornell GW: Distributed space–time-coded protocols for exploiting cooperative diversity in wireless networks.
*IEEE Trans. Inf. Theory*2003, 49(10):2415-2425. 10.1109/TIT.2003.817829MATHMathSciNetView ArticleGoogle Scholar - Kramer G, Gastpar M, Gupta P: Cooperative strategies and capacity theorems for relay networks.
*IEEE Trans. Inf. Theory*2005, 51(3):765-779. 10.1109/TIT.2004.842566MathSciNetView ArticleMATHGoogle Scholar - Xue F, Sandhu S: Cooperation in a half-duplex Gaussian diamond relay channel.
*IEEE Trans. Inf. Theory*2007, 53(10):3806-3814.MATHMathSciNetView ArticleGoogle Scholar - Goldsmith A, Jafar SA, Jindal N, Vishwanath S: Capacity limits of MIMO channels.
*IEEE J. Sel. Areas Commun.*2003, 21(5):684-702. 10.1109/JSAC.2003.810294View ArticleMATHGoogle Scholar - Tse D, Viswanath P:
*Fundamentals of Wireless Communication*. Cambridge University Press, Cambridge; 2005.MATHView ArticleGoogle Scholar - Marzetta TL: Noncooperative cellular wireless with unlimited numbers of base station antennas.
*IEEE Trans. Wirel. Commun.*2010, 9(11):3590-3600.View ArticleGoogle Scholar - Hoydis J, ten Brink S, Debbah M:
*Massive MIMO: how many antennas do we need?, in Proceedings of 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton’2011)*. Allerton House, Illinois, USA; 2011:545-550.Google Scholar - Bourdoux A, Come B, Khaled N:
*Non-reciprocal transceivers in OFDM/SDMA systems: impact and mitigation*. Proceedings of the Radio and Wireless Conference (RAWCON’03), Boston, USA; 2003:183-186.Google Scholar - Vu M, Paulraj A: MIMO wireless linear precoding.
*IEEE Signal Process. Mag.*2007, 24(5):86-105.View ArticleGoogle Scholar - http://www.3gpp.org/ftp/Specs/html-info/36211.html
- Tarokh V, Seshadri N, Calderbank AR: Space–time codes for high data rate wireless communication: performance analysis and code construction.
*IEEE Trans. Inf. Theory*1998, 44(2):744-765. 10.1109/18.661517MATHMathSciNetView ArticleGoogle Scholar - Su W, Xia X: Signal constellations for quasi-orthogonal space–time block codes with full diversity.
*IEEE Trans. Inf. Theory*2004, 50(10):2331-2347. 10.1109/TIT.2004.834740MATHMathSciNetView ArticleGoogle Scholar - Scaglione A, Giannakis GB, Barbarossa S: Redundant filterbank precoders and equalizers part I: unification and optimal designs.
*IEEE Trans. Signal Process.*1999, 47(7):1988-2006. 10.1109/78.771047View ArticleGoogle Scholar - Palomar DP, Cioffi JM, Lagunas MA: Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization.
*IEEE Trans. Signal Process.*2003, 51(9):2381-2401. 10.1109/TSP.2003.815393View ArticleGoogle Scholar - Jiang Y, Li J, Hager WW: Joint transceiver design for MIMO communications using geometric mean decomposition.
*IEEE Trans. Signal Process.*2005, 53(10):3791-3803.MathSciNetView ArticleGoogle Scholar - Xu F, Davidson TN, Zhang JK, Wong KM: Design of block transceivers with decision feedback detection.
*IEEE Trans. Signal Process.*2006, 54(3):965-978.View ArticleGoogle Scholar - Xiao C, Zheng Y, Ding Z: Globally optimal linear precoders for finite alphabet signals over complex vector Gaussian channels.
*IEEE Trans. Signal Process.*2011, 59(7):3301-3314.MathSciNetView ArticleGoogle Scholar - Wang J, Palomar DP: Worst-case robust MIMO transmission with imperfect channel knowledge.
*IEEE Trans. Signal Process.*2009, 57(8):3086-3100.MathSciNetView ArticleGoogle Scholar - Zeng W, Xiao C, Wang M, Lu J: Linear precoding for finite alphabet inputs over MIMO fading channels with statistical CSI.
*IEEE Trans. Signal Process.*2012, 60(6):3134-3148.MathSciNetView ArticleGoogle Scholar - Soysal A, Ulukus S: Optimum power allocation for single-user MIMO and multi-user MIMO-MAC with partial CSI.
*IEEE J. Sel. Areas Commun.*2007, 25(7):1402-1412.View ArticleGoogle Scholar - Li X, Jin S, Gao X, McKay MR: Capacity bounds and low complexity transceiver design for double scattering MIMO multiple access channels.
*IEEE Trans. Signal Process.*2010, 58(5):2809-2822.MathSciNetView ArticleGoogle Scholar - Venkatesan S, Simon S, Valenzuela R:
*Capacity of a Gaussian MIMO channel with nonzero mean*. Proceedings of the IEEE 58th Vehicular Technology Conference (VTC 2003-Fall), vol. 3, Orlando, Florida, USA; 2003:1767-1771.Google Scholar - Cover TM, Thomas JA:
*Elements of Information Theory*. Wiley, New York; 1991.MATHView ArticleGoogle Scholar - Telatar E: Capacity of multi-antenna Gaussian channels.
*Eur. Trans. Telecommun.*1999, 10(6):585-595. 10.1002/ett.4460100604View ArticleGoogle Scholar - Horn RA, Johnson CR:
*Matrix Analysis*. Cambridge University Press, Cambridge, MA; 1990.MATHGoogle Scholar - Yuan X, Xu C, Ping L, Lin X: Precoder design for multiuser MIMO ISI channels based on iterative LMMSE detection.
*IEEE J. Sel. Topics Signal Process.*2009, 3(6):1118-1128.View ArticleGoogle Scholar - Xu C, Li P, Yuan X, Lin X:
*Joint beamforming, water-filling, and diversity coding in MIMO systems with CSIT uncertainty*. Proceedings of the 6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC’2010), Brest, France; 2010:24-29.Google Scholar - Wang X, Poor HV: Iterative (turbo) soft interference cancellation and decoding for coded CDMA.
*IEEE Trans. Commun.*1999, 47(7):1046-1061. 10.1109/26.774855View ArticleGoogle Scholar - Tüchler M, Koetter R, Singer AC: Turbo equalization: principles and new results.
*IEEE Trans. Commun.*2002, 50(5):754-767. 10.1109/TCOMM.2002.1006557View ArticleGoogle Scholar - Hoeher PA, Schoeneich H, Fricke JC: Multi-layer inter-leave-division multiple access: theory and practice.
*Eur. Trans. Telecommun.*2008, 19(5):523-536. 10.1002/ett.1267View ArticleGoogle Scholar - Yuan X, Guo Q, Wang X, Li P: Evolution analysis of low-cost iterative equalization in coded linear systems with cyclic prefixes.
*IEEE J. Sel. Areas Commun*2008, 26(2):301-310.View ArticleGoogle Scholar - Xiong X, Hu J, Ling X: A cooperative transmission and receiving scheme for IDMA with time-reversal technique.
*Wirel. Personal Commun.*2011, 58(4):637-656. 10.1007/s11277-009-9898-6View ArticleGoogle Scholar - Yarlagadda RK, Hershey JE:
*Hadamard Matrix Analysis and Synthesis: With Applications to Communications and Signal/Image Processing*. Kluwer Academic Publishers, Boston; 1996.Google Scholar - Heath RW Jr, Paulraj A: Linear dispersion codes for MIMO systems based on frame theory.
*IEEE Trans. Signal Process.*2002, 50(10):2429-2441. 10.1109/TSP.2002.803325View ArticleGoogle Scholar - Hassibi B, Hochwald B: High-rate codes that are linear in space and time.
*IEEE Trans. Inf. Theory*2002, 48(7):1804-1824. 10.1109/TIT.2002.1013127MATHMathSciNetView ArticleGoogle Scholar - Kay SM:
*Fundamentals of Statistical Signal Processing: Estimation Theory*. Prentice Hall PTR, Upper Saddle River, NJ; 1993.MATHGoogle Scholar - Trefethen LN, Bau D III:
*Numerical Linear Algebra*. Society for Industrial and Applied Mathematics, Philadelphia; 1997.MATHView ArticleGoogle Scholar - Yuan X, Ping L:
*Achievable rates of coded linear systems with iterative MMSE detection*. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM’2009), Honolulu, HI, USA; 2009:1-6.Google Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.