903 research outputs found
Linear Precoding in Cooperative MIMO Cellular Networks with Limited Coordination Clusters
In a cooperative multiple-antenna downlink cellular network, maximization of
a concave function of user rates is considered. A new linear precoding
technique called soft interference nulling (SIN) is proposed, which performs at
least as well as zero-forcing (ZF) beamforming. All base stations share channel
state information, but each user's message is only routed to those that
participate in the user's coordination cluster. SIN precoding is particularly
useful when clusters of limited sizes overlap in the network, in which case
traditional techniques such as dirty paper coding or ZF do not directly apply.
The SIN precoder is computed by solving a sequence of convex optimization
problems. SIN under partial network coordination can outperform ZF under full
network coordination at moderate SNRs. Under overlapping coordination clusters,
SIN precoding achieves considerably higher throughput compared to myopic ZF,
especially when the clusters are large.Comment: 13 pages, 5 figure
Resource allocation for transmit hybrid beamforming in decoupled millimeter wave multiuser-MIMO downlink
This paper presents a study on joint radio resource allocation and hybrid precoding in multicarrier massive multiple-input multiple-output communications for 5G cellular networks. In this paper, we present the resource allocation algorithm to maximize the proportional fairness (PF) spectral efficiency under the per subchannel power and the beamforming rank constraints. Two heuristic algorithms are designed. The proportional fairness hybrid beamforming algorithm provides the transmit precoder with a proportional fair spectral efficiency among users for the desired number of radio-frequency (RF) chains. Then, we transform the number of RF chains or rank constrained optimization problem into convex semidefinite programming (SDP) problem, which can be solved by standard techniques. Inspired by the formulated convex SDP problem, a low-complexity, two-step, PF-relaxed optimization algorithm has been provided for the formulated convex optimization problem. Simulation results show that the proposed suboptimal solution to the relaxed optimization problem is near-optimal for the signal-to-noise ratio SNR <= 10 dB and has a performance gap not greater than 2.33 b/s/Hz within the SNR range 0-25 dB. It also outperforms the maximum throughput and PF-based hybrid beamforming schemes for sum spectral efficiency, individual spectral efficiency, and fairness index
Secrecy Sum-Rates for Multi-User MIMO Regularized Channel Inversion Precoding
In this paper, we propose a linear precoder for the downlink of a multi-user
MIMO system with multiple users that potentially act as eavesdroppers. The
proposed precoder is based on regularized channel inversion (RCI) with a
regularization parameter and power allocation vector chosen in such a
way that the achievable secrecy sum-rate is maximized. We consider the
worst-case scenario for the multi-user MIMO system, where the transmitter
assumes users cooperate to eavesdrop on other users. We derive the achievable
secrecy sum-rate and obtain the closed-form expression for the optimal
regularization parameter of the precoder using
large-system analysis. We show that the RCI precoder with
outperforms several other linear precoding schemes, and
it achieves a secrecy sum-rate that has same scaling factor as the sum-rate
achieved by the optimum RCI precoder without secrecy requirements. We propose a
power allocation algorithm to maximize the secrecy sum-rate for fixed .
We then extend our algorithm to maximize the secrecy sum-rate by jointly
optimizing and the power allocation vector. The jointly optimized
precoder outperforms RCI with and equal power allocation
by up to 20 percent at practical values of the signal-to-noise ratio and for 4
users and 4 transmit antennas.Comment: IEEE Transactions on Communications, accepted for publicatio
Cooperative Multi-Cell Block Diagonalization with Per-Base-Station Power Constraints
Block diagonalization (BD) is a practical linear precoding technique that
eliminates the inter-user interference in downlink multiuser multiple-input
multiple-output (MIMO) systems. In this paper, we apply BD to the downlink
transmission in a cooperative multi-cell MIMO system, where the signals from
different base stations (BSs) to all the mobile stations (MSs) are jointly
designed with the perfect knowledge of the downlink channels and transmit
messages. Specifically, we study the optimal BD precoder design to maximize the
weighted sum-rate of all the MSs subject to a set of per-BS power constraints.
This design problem is formulated in an auxiliary MIMO broadcast channel (BC)
with a set of transmit power constraints corresponding to those for individual
BSs in the multi-cell system. By applying convex optimization techniques, this
paper develops an efficient algorithm to solve this problem, and derives the
closed-form expression for the optimal BD precoding matrix. It is revealed that
the optimal BD precoding vectors for each MS in the per-BS power constraint
case are in general non-orthogonal, which differs from the conventional
orthogonal BD precoder design for the MIMO-BC under one single sum-power
constraint. Moreover, for the special case of single-antenna BSs and MSs, the
proposed solution reduces to the optimal zero-forcing beamforming (ZF-BF)
precoder design for the weighted sum-rate maximization in the multiple-input
single-output (MISO) BC with per-antenna power constraints. Suboptimal and
low-complexity BD/ZF-BF precoding schemes are also presented, and their
achievable rates are compared against those with the optimal schemes.Comment: accepted in JSAC, special issue on cooperative communications on
cellular networks, June 201
- …