- Research
- Open Access
- Published:

# Efficient transceiver design for large-scale antenna systems

*EURASIP Journal on Wireless Communications and Networking*
**volume 2015**, Article number: 77 (2015)

## Abstract

We present linear transceiver design strategies for large-scale multiple-input multiple-output downlink systems when the user nodes have multiple receive antennas, and they receive multiple streams. First, we propose a matched-filtering-based optimal power allocation method using the sum-rate maximization criterion and utilizing the *favorable propagation* property of large-scale antenna systems. In uncorrelated transmit antennas, we observe that the effective channel can be represented by the receive antenna correlation matrix. Motivated by this observation, we also propose a suboptimal two-step power allocation method in which each user node is equipped with two receive antennas to reduce the computational complexity of the optimum power allocation method. Compared with the optimum power allocation method, the proposed two-step method reduces the dimensions of the bisection search space while achieving essentially the same level of sum rate.

## Introduction

Large-scale antenna or massive multiple-input multiple-output (MIMO) system, a system defined as a large number of antenna-equipped base station (BS) while serving a large number of users simultaneously has been identified as a promising air interface technology [1-3]. A salient feature of large-scale antenna systems is that, when the number of BS antennas grows large, the random channel vectors between the users and the BS become pairwisely orthogonal [4]. Therefore, in the limit of infinite number of antennas, with simple linear processing approaches such as a matched filter precoder, inter-user interferences (IUI) disappear completely [5]. The IUI elimination feature of large-scale antenna systems has sparked a flurry of research activities aimed at understanding the signal processing, information theoretic ramifications, and realistic channel behavior of massive MIMO sytems [1-4,6-8]. In [1,6], large-scale antenna systems are reviewed from various perspectives including antenna and propagation aspects, transceiver design, and fundamental information theoretic gains. A follow-up tutorial [2,3] briefly discussed recent works. To the best of our knowledge, most of works on the large-scale antenna systems assume that user terminals are equipped with a single receive antenna[1,5,9].

In this paper, we aim to design transceivers for the large-scale antenna system where multiple streams are designated for user terminals with multiple receive antennas. Here, we assume that the number of BS antennas exceeds the total number of antennas of users. Inspired by the fact that in large-scale antenna systems a simple matched-filtering precoder can eliminate the IUI effectively [1,5], we adopt conjugate beamforming as the first part of the precoder. After that, a sum-rate maximizing processing is appended. We observe that when the spacing between transmit antennas is sufficiently large, sum-rate maximizing transceivers can be obtained with the receiver correlation matrices. Motivated by this observation, when each terminal has two receive antennas, we propose a suboptimal two-step power allocation method. In general, the search space dimension of the optimal power allocation algorithm is proportional to the number of users and the number of streams per user. With the proposed two-step power allocation method, the search space size is only proportional to the number of users. Through numerical simulations, we verify that the sum-rate performance of the proposed methods outperform the equal power allocation method. In addition, we demonstrate the effectiveness of the proposed two-step power allocation method.

The following notations are used. We employ uppercase boldface letters for matrices and lowercase boldface letters for vectors. For any general matrix **X**, **X**
^{T}, **X**
^{H}, Tr(**X**), SVD(**X**), and \( \left [\textbf {X}\right ]_{i,j}\) denote the transpose, Hermitian transpose, trace, singular value decomposition, and the (*i*,*j*)-th element of **X**, respectively. An identity matrix of size *n* is denoted by **I**
_{
n
}.

## System model and preliminaries

### MU-MIMO system model

We consider the time-division-duplexing (TDD) downlink single-cell MU-MIMO systems. The system includes one base station with *N*
_{
t
} transmit antennas that transmits data streams to *K* user nodes. Each user terminal has multiple receive antennas. Without loss of generality, we assume that each user node has *N*
_{
r
} receive antennas. Furthermore, from the TDD channel reciprocity between the downlink and uplink, we assume that the downlink channel state information is known to the transmit side; and due to the single-cell assumption, we do not consider the pilot contamination problems [10]. The information signal vector for the *k*-th user node is denoted by \(\textbf {s}_{k} \in \mathcal {C}^{N_{r}\times 1}\) and its power is normalized as \(\mathbb {E}(\textbf {s}_{k}\textbf {s}_{k}^{H})=\textbf {I}_{N_{r}}\). The signal **s**
_{
k
} is linearly precoded by the precoding matrix \(\textbf {T}_{k}\in {\mathcal {C}^{N_{t}\times N_{r}}}\). The precoded signal vector **x**
_{
k
}=**T**
_{
k
}
**s**
_{
k
}, 1≤*k*≤*K* is transmitted to the *k*-th user node from the base station. Then, the received signal vector at the *k*-th user node can be represented by

where \(\textbf {H}_{k} \in \mathcal {C}^{N_{r}\times N_{t}}\) is the MIMO channel from the base station to the *k*-th user node and **n**
_{
k
} equals the additive white Gaussian noise (AWGN) vector with zero mean and \(\mathbb {E}\lbrack \textbf {n}_{k}\textbf {n}_{k}^{H}\rbrack ={\sigma _{n}^{2}}\textbf {I}_{N_{r}}\). The parameter *g*
_{
k
} models the geometric attenuation and shadow fading, which is assumed to be independent over transmit antenna and to be constant over many coherence time intervals.

To introduce the channel correlation, the Kronecker model is adopted to describe **H**
_{
k
} as [11]:

where \(\textbf {R}_{r_{k}}\in {\mathcal {C}}^{N_{r}\times N_{r}}\) and \(\textbf {R}_{t_{k}}\in {\mathcal {C}}^{N_{t}\times N_{t}}\) are the receive correlation matrix and the transmit correlation matrix of the *k*-th user node, respectively. The (*i*,*j*)-th elements of \(\textbf {R}_{r_{k}}\) and \(\textbf {R}_{t_{k}}\) are defined as \(\lbrack \textbf {R}_{r_{k}} \rbrack _{i,j}=\rho _{r_{k}}^{|i-j|}\) and \(\lbrack \textbf {R}_{t_{k}} \rbrack _{i,j}=\rho _{t_{k}}^{|i-j|}\), (\(0\le \rho _{t_{k}},\rho _{t_{k}}\le 1\)), respectively, assuming the uniform linear array antenna sets. When antenna spacing at the transmit side is sufficiently large, we can assume that the columns of **H**
_{
k
} are independent^{a}, i.e., \(\textbf {R}_{t_{k}}=\textbf {I}_{N_{t}},\forall k\). On the other hand, the receive antennas of the user terminal are closely spaced due to the size limitation of the user terminal. Therefore, we assume that the rows of **H**
_{
k
}’s are correlated, i.e., \(\textbf {R}_{r_{k}}\ne \textbf {I}_{N_{r}},\forall k\). The elements of \(\textbf {H}_{w_{k}}\) are circularly symmetric complex Gaussian random variables with zero mean and unit variance, and they have an independent and identically distribution. Then, the user node combines its received signal with decoding matrix \(\textbf {D}_{k}\in {\mathcal {C}}^{N_{r}\times N_{r}}\) to decode the desired signals:

### Review of results on the large-scale MIMO systems

###
**Lemma**
**1**.

Let \(\mathbf {a}, \mathbf {b} \in \mathcal {C}^{N_{t}\times 1}\) be two independent vectors with distribution \(\mathcal {CN}(0,c\mathbf {I}_{N_{t}})\), where *c* is an arbitrary constant. Then,

where \(\overset {a.s.}{=}\) denotes the almost sure convergence. Lemma 1 is called the *favorable propagation* (FP) property of large-scale antenna systems [1].

Due to lemma 1, a matched-filtering precoder is popularly adopted for the large-scale MIMO precoding method due to its computational efficiency and rate achievability [1,5]. We assume \(\textbf {T}_{k}= \frac {1}{N_{t}}\textbf {H}_{k}^{H}\textbf {M}_{k}\) and the precoding matrix \(\textbf {M}_{k}\in \mathcal {C}^{N_{r}\times N_{r}}\) after matched-filtering. Then, the decoded signal \(\hat {\textbf {s}}_{k}\) can be rewritten as

Different from the case for when user terminals are equipped with single receive antenna, the power normalization factor is not included in Equation 3. Instead, the precoding matrices **M**
_{
k
}’s are designed to satisfy the transmit power constraint, \(\sum _{k=1}^{K} \text {Tr}(\textbf {T}_{k}\textbf {T}_{k}^{H})\le P_{t}\), and *P*
_{
t
} is the maximum transmission power of base station.

## Sum-rate maximizing transceiver design

According to lemma 1, when \(N_{t} \rightarrow \infty \), we have

Recent channel measurement campaigns have shown that multi-user MIMO systems with large antenna arrays have characteristics that satisfy the above assumption (Equation 4) fairly well [7]. Then, we have the decoded signal being free of inter-user interference as follows:

Here, we observe that the remaining sum-rate maximizing processing {**D**
_{
k
}} and {**M**
_{
k
}} can be found by considering receive antenna correlation matrix \(\lbrace \textbf {R}_{r_{k}}\rbrace \). From channel diagonalization \(\text {SVD}(\textbf {R}_{r_{k}}) = \textbf {V}_{k}\mathbf {\Lambda }_{k}\textbf {V}_{k}^{H}\), we have \(\textbf {M}_{k}=\textbf {V}_{k}\mathbf {\Gamma }_{k}^{1/2}\) and \(\textbf {D}_{k}=\textbf {V}_{k}^{H}\), where \(\mathbf {\Gamma }_{k}\in \mathcal {R}^{N_{r}\times N_{r}}\) is the power loading diagonal matrix. The information rate^{b} for the *k*-th user node can be represented as

The sum-rate maximizing power allocation matrices **Γ**
_{
k
}s are calculated by solving the following optimization problem,

The power constraint of Equation 7 is the average power constraint that is obtained by

The solution of the problem (Equation 7) is the well-known water-filling solution that requires numerical bisection search [12]. Finally, we find the sum-rate maximizing transceivers for large-scale antenna systems \(\textbf {T}_{k}^{\text {(opt)}}=\textbf {H}_{k}^{H}\textbf {V}_{k}\mathbf {\Gamma }_{k,\text {opt}}^{1/2}\) and \(\textbf {D}_{k}=\textbf {V}_{k}^{H}, \;\forall k\).

## Two-step power allocation

The proposed optimum precoder in Section 33 requires a bisection search to optimally allocate the transmit power. In this section, we propose a computationally efficient power allocation method when each user node has two receive antennas ^{c}, i.e., *N*
_{
r
}=2.

To derive the two-step power allocation method, we temporarily assume a high SNR regime in which the equal power allocation \(\phantom {\dot {i}\!}\mathbf {\Gamma }_{k} =\gamma _{k} \textbf {I}_{N_{r}}\) for all *k* is the optimum and there is no receive antenna correlation, i.e., \(\phantom {\dot {i}\!}\rho _{r_{k}} = 0\) or \(\phantom {\dot {i}\!}\mathbf {\Lambda }_{k}=\textbf {I}_{N_{r}}\) for all *k*. Then, the optimization problem (Equation 7) can be represented as

where the power constraint is obtained by \(\sum _{k} \text {Tr} (\mathbf {\Lambda }_{k} \mathbf {\Gamma }_{k}) = \sum _{k}\text {Tr} (\gamma _{k} \textbf {I}_{N_{r}}) =\sum _{k} N_{r} \gamma _{k}\). The power loading parameters {*γ*
_{
k
}} can be found by the water-filling algorithm. Note that compared with the optimum power allocation calculation (Equation 7), the search space of Equation 8 is reduced to *K* from *K*
*N*
_{
r
}. Through the first step, we find the amount of per user power allocation.

Now, with per user power constraint \(\lbrace \hat {p}_{k} \rbrace \) where \(\phantom {\dot {i}\!}\hat {p}_{k} =N_{r} \gamma _{k}\), the optimization problem (Equation 7) is divided into *K* subproblems. The *k*-th subproblem is represented by

Optimization problem (Equation 9) determines the amount of power allocation to each stream, which is designated to the *k*-th user node.

###
**Lemma**
**2**.

For 2×2 correlation matrix **R**=[1, *ρ*;*ρ*, 1] (0≤*ρ*≤1), eigenvalues of **R** are 1+*ρ* and 1−*ρ*.

###
**Proof**
**1**.

From det(**R**−*λ*
**I**)=0, we know *λ*=1−*ρ* or 1+*ρ*.

According to Lemma 2 and the observation that the effective channel of Equation 5 is the receive antenna correlation matrix \(\textbf {R}_{r_{k}}\), we have the singular value matrix of \(\phantom {\dot {i}\!}\textbf {R}_{r_{k}}\) as \(\phantom {\dot {i}\!}\mathbf {\Lambda }_{k}=\lbrack 1+ \rho _{r_{k}}, \; 0 ; 0, \; 1-\rho _{r_{k}} \rbrack \) when each user node has two receive antennas. Replacing **Λ**
_{
k
} in Equation 9 with \(\phantom {\dot {i}\!}\lbrack 1+ \rho _{r_{k}}, \; 0 ; 0, \; 1-\rho _{r_{k}} \rbrack \), we can derive the closed form solution given by

where *γ*
_{
k,1} and *γ*
_{
k,2} are the diagonal elements of \(\hat {\mathbf {\Gamma }}_{k}\) and \(\beta _{k} \triangleq g_{k} \sigma _{n}^{-2}\) (See Appendix for details). Note that when \(\rho _{r_{k}}=0\), the equal power is allocated as \(\gamma _{k,1}= \gamma _{k,2} = \frac {\hat {p}_{k}}{2}\).

In the second step, we can decide the amount of allocated power to each stream without a bisection search. With the proposed two-step method, we can reduce the search space from *K*
*N*
_{
r
} to *K*.

The proposed two-step power allocation method is summarized in Algorithm 1. The resultant two-step precoders are represented as \(\textbf {T}_{k}^{\text {(ts)}}=\textbf {H}_{k}^{H}\textbf {V}_{k}\hat {\mathbf {\Gamma }}_{k}^{1/2}, \;\forall k\). With the proposed two-step method, we can reduce the dimensions of the search space from *K*
*N*
_{
r
} to *K*.

Note that the generalization of the second step to more than two receive antennas (*N*
_{
r
}>2) is straightforward. Instead of closed form solutions, however, it requires numerical search in Step 3 of Algorithm 1 as follows. ** Step 3**: Applying water-filling algorithm to Equation 9, calculate the per stream based power allocation \(\hat {\mathbf {\Gamma }}_{k}\).

## Simulation results

For the simulation of the sum-rate performance, we set *K*=20, *N*
_{
t
}=40∼200, *N*
_{
r
}=2, and \(\rho _{r_{k}}=0\) and 0.5 for all *k*. Table 1 gives the simulation parameters. The cell radius is 1 km. For the consistency of the simulation, the location of each user is randomly selected from uniform distribution \(\mathcal {U}(0,1)\) and is kept fixed over simulation runs. The distance-dependent path loss is 128.1+37.6 log(*r*) dB (*r* kilometers). The maximum transmission power is set to 32 dBm^{d}. The receiver noise density is set to −101 dBm/Hz, and the noise figure is 5 dB. The results are averaged over 1,000 independent trials. Figure 1 shows the average sum-rate performance of the optimum power allocation method over the receive antenna correlation \(\rho _{r_{k}} \in \lbrack 0, 0.9999\rbrack \) for all *k*. We observe that as the receive antenna correlation increases, the sum-rate performance decreases. Specifically, with *N*
_{
t
}=200, when receive correlation is less than or equal to 0.9, the sum rate drops less than 10%. However, when \(\rho _{r_{k}}=0.99\) and \(\rho _{r_{k}}=0.9999\), the sum rates drop 21% and 37%, respectively. Figure 2 shows the average sum-rate performance of the optimum power allocation method in Section 33 and the proposed two-step method in Section 44. For comparison, we plot the equal power allocation method in which the precoder is represented as \(\textbf {T}_{k}^{\text {eq}}=\sqrt {\alpha } \textbf {H}_{k}^{H}\textbf {V}_{k}\) for all *k*, *α*=*P*
_{
t
}/*K*
*N*
_{
r
}. Note that the proposed two-step method achieves the optimum sum-rate performance while it can be implemented with low complexity by reducing the search space. In addition, we verify that both proposed methods outperform the equal power allocation method.

## Conclusion

In this paper, we have proposed a MU-MIMO transceiver design method for large-scale antenna systems using the sum-rate maximization criterion when each user node is equipped with multiple receive antennas. Inspired by the favorable propagation characteristics of the large-scale antenna systems, we have proposed a matched-filtering-based optimal transceiver design method that maximizes the sum rate. In addition, we have proposed a suboptimal two-step power allocation method with low computational complexity by reducing the dimension of the bisection search space from *K*
*N*
_{
r
} to *K*. Through the simulation results, the effectiveness of the proposed transceiver design methods have been validated.

## Endnotes

^{a} This assumption is reasonable because in general the transmit antennas at base station of the large-scale MIMO systems can be deployed to have a large separation among them.

^{b} This is an *approximate* result assuming \(N_{t}\rightarrow \infty \)

^{c} Note that current specification of mobile wireless communications supports mobile terminals with two receive antennas [13]

^{d} Considering the power saving effect of large-scale MIMO systems [1], we choose much less transmission power than the ordinary base station transmission power, 43 [dBm]

## Appendix

Using \(\beta _{k} \triangleq g_{k} \sigma _{n}^{-2}\), and **Γ**
_{
k
}=diag(*γ*
_{
k,1},*γ*
_{
k,2}), the optimization problem (Equation 9) can be rewritten as

Because there are no inter-stream interferences, the optimum power allocation should satisfy the equality constraint, \((1+\rho _{r_{k}})\gamma _{k,1}+(1-\rho _{r_{k}})\gamma _{k,2}=\hat {p}_{k}\). Then, we have

Since this is a convex optimization problem over *γ*
_{
k,1}, from the Karush-Kuhn-Tucker (KKT) condition [14], the optimum value *γ*
_{
k,1} is obtained as

The parameter \({\gamma }_{k,2}^{\text {(opt)}} \) can be derived by replacing *γ*
_{
k,1} in Equation 6.2 by 6.3.

## References

F Rusek, D Persson, BK Lau, EG Larsson, TL Marzetta, O Edfors, F Tufvesson, Scaling up MIMO: opportunities and challenges with very large arrays. IEEE Signal Process. Mag. 30, 40–60 (2013).

L Lu, GY Li, AL Swindlehurst, A Ashikhmin, R Zhang, An overview of massive MIMO: benefits and challenges. IEEE J. Select. Topics Signal Process. 8, 742–758 (2014).

EG Larsson, O Edfors, F Tufvesson, TL Marzetta, Massive MIMO for next generation wireless systems. IEEE Commun. Mag. 52, 186–195 (2014).

HQ Ngo, EG Larsson, TL Marzetta, Energy and spectral efficiency of very large multiuser MIMO systems. IEEE Trans. Commun. 8, 1436–1449 (2013).

TL Marzetta, Noncooperative cellular wireless with unlimited numbers of base station antennas. IEEE Trans. Wireless Commun. 9, 3590–3600 (2010).

RC Lamare, Massive MIMO systems: Signal processing challenges and research trends. ArXiv pre-print cs.IT/1310.7282. Available: http://arxiv.org/abs/1310.7282.

T Wild, C Hoek, J Hoydis, ST Brink, in

*Proc. IEEE Int. Symp. Wireless Commun. Systems (ISWCS, Paris)*. Channel measurements for large antenna arrays, (2012), pp. 811–815.X Gao, F Tufvesson, O Edfors, F Rusek, in

*Proc. Asilomar Conf. Signals, Syst., Comput, Pacific Grove*. Measured propagation characteristics for very large MIMO at 2.6 GHz, (2012), pp. 295–299.H Yang, TL Marzetta, Performance of conjugate and zero-forcing beamforming in large-scale antenna systems. IEEE J. Select. Areas Commun. 31, 172–179 (2013).

J Jose, A Ashikhmin, TL Marzetta, S Vishwanath, Pilot contamination and precoding in multi-cell TDD systems. IEEE Trans. Wireless Commun. 10, 2640–2651 (2011).

D Shiu, GJ Foschini, MJ Gans, JM Kahn, Fading correlation and its effect on the capacity of multielement antenna systems. IEEE Trans. Commun. 48, 502–513 (2000).

TM Cover, JA Thomas,

*Elements of Information Theory*(Wiley, 111 River Street Hoboken, NJ, United States, 1991).3GPP TR 36.211 V 11.1.0 (Release 11): Evolved Universal Terrestrial Radio Access (E-UTRA) (2012). Available: http://www.etsi.org/deliver/etsi_ts/136200_136299/136211/11.01.00_60/ts_136211v110100p.pdf.

S Boyd, L Vandenberghe,

*Convex Optimization*(Cambridge University Press, University Printing House Shaftesbury Road, Cambridge, United Kingdom, 2004).

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## About this article

### Cite this article

Shin, J. Efficient transceiver design for large-scale antenna systems.
*J Wireless Com Network* **2015**, 77 (2015). https://doi.org/10.1186/s13638-015-0272-y

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/s13638-015-0272-y

### Keywords

- Large-scale antenna systems
- Multiple-input multiple-output (MIMO)
- Power allocation
- Sum-rate maximization