2,049 research outputs found
Linear Precoding Based on Polynomial Expansion: Large-Scale Multi-Cell MIMO Systems
Large-scale MIMO systems can yield a substantial improvement in spectral
efficiency for future communication systems. Due to the finer spatial
resolution achieved by a huge number of antennas at the base stations, these
systems have shown to be robust to inter-user interference and the use of
linear precoding is asymptotically optimal. However, most precoding schemes
exhibit high computational complexity as the system dimensions increase. For
example, the near-optimal RZF requires the inversion of a large matrix. This
motivated our companion paper, where we proposed to solve the issue in
single-cell multi-user systems by approximating the matrix inverse by a
truncated polynomial expansion (TPE), where the polynomial coefficients are
optimized to maximize the system performance. We have shown that the proposed
TPE precoding with a small number of coefficients reaches almost the
performance of RZF but never exceeds it. In a realistic multi-cell scenario
involving large-scale multi-user MIMO systems, the optimization of RZF
precoding has thus far not been feasible. This is mainly attributed to the high
complexity of the scenario and the non-linear impact of the necessary
regularizing parameters. On the other hand, the scalar weights in TPE precoding
give hope for possible throughput optimization. Following the same methodology
as in the companion paper, we exploit random matrix theory to derive a
deterministic expression for the asymptotic SINR for each user. We also provide
an optimization algorithm to approximate the weights that maximize the
network-wide weighted max-min fairness. The optimization weights can be used to
mimic the user throughput distribution of RZF precoding. Using simulations, we
compare the network throughput of the TPE precoding with that of the suboptimal
RZF scheme and show that our scheme can achieve higher throughput using a TPE
order of only 3
Hardware Impairments Aware Transceiver Design for Bidirectional Full-Duplex MIMO OFDM Systems
In this paper we address the linear precoding and decoding design problem for
a bidirectional orthogonal frequencydivision multiplexing (OFDM) communication
system, between two multiple-input multiple-output (MIMO) full-duplex (FD)
nodes. The effects of hardware distortion as well as the channel state
information error are taken into account. In the first step, we transform the
available time-domain characterization of the hardware distortions for FD MIMO
transceivers to the frequency domain, via a linear Fourier transformation. As a
result, the explicit impact of hardware inaccuracies on the residual
selfinterference (RSI) and inter-carrier leakage (ICL) is formulated in
relation to the intended transmit/received signals. Afterwards, linear
precoding and decoding designs are proposed to enhance the system performance
following the minimum-mean-squarederror (MMSE) and sum rate maximization
strategies, assuming the availability of perfect or erroneous CSI. The proposed
designs are based on the application of alternating optimization over the
system parameters, leading to a necessary convergence. Numerical results
indicate that the application of a distortionaware design is essential for a
system with a high hardware distortion, or for a system with a low thermal
noise variance.Comment: Submitted to IEEE for publicatio
An Algorithm for Global Maximization of Secrecy Rates in Gaussian MIMO Wiretap Channels
Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap
channels is considered. While this channel has attracted a significant
attention recently and a number of results have been obtained, including the
proof of the optimality of Gaussian signalling, an optimal transmit covariance
matrix is known for some special cases only and the general case remains an
open problem. An iterative custom-made algorithm to find a globally-optimal
transmit covariance matrix in the general case is developed in this paper, with
guaranteed convergence to a \textit{global} optimum. While the original
optimization problem is not convex and hence difficult to solve, its minimax
reformulation can be solved via the convex optimization tools, which is
exploited here. The proposed algorithm is based on the barrier method extended
to deal with a minimax problem at hand. Its convergence to a global optimum is
proved for the general case (degraded or not) and a bound for the optimality
gap is given for each step of the barrier method. The performance of the
algorithm is demonstrated via numerical examples. In particular, 20 to 40
Newton steps are already sufficient to solve the sufficient optimality
conditions with very high precision (up to the machine precision level), even
for large systems. Even fewer steps are required if the secrecy capacity is the
only quantity of interest. The algorithm can be significantly simplified for
the degraded channel case and can also be adopted to include the per-antenna
power constraints (instead or in addition to the total power constraint). It
also solves the dual problem of minimizing the total power subject to the
secrecy rate constraint.Comment: accepted by IEEE Transactions on Communication
- …