1,504 research outputs found
Decomposition by Successive Convex Approximation: A Unifying Approach for Linear Transceiver Design in Heterogeneous Networks
We study the downlink linear precoder design problem in a multi-cell dense
heterogeneous network (HetNet). The problem is formulated as a general
sum-utility maximization (SUM) problem, which includes as special cases many
practical precoder design problems such as multi-cell coordinated linear
precoding, full and partial per-cell coordinated multi-point transmission,
zero-forcing precoding and joint BS clustering and beamforming/precoding. The
SUM problem is difficult due to its non-convexity and the tight coupling of the
users' precoders. In this paper we propose a novel convex approximation
technique to approximate the original problem by a series of convex
subproblems, each of which decomposes across all the cells. The convexity of
the subproblems allows for efficient computation, while their decomposability
leads to distributed implementation. {Our approach hinges upon the
identification of certain key convexity properties of the sum-utility
objective, which allows us to transform the problem into a form that can be
solved using a popular algorithmic framework called BSUM (Block Successive
Upper-Bound Minimization).} Simulation experiments show that the proposed
framework is effective for solving interference management problems in large
HetNet.Comment: Accepted by IEEE Transactions on Wireless Communicatio
Interference Exploitation-based Hybrid Precoding with Robustness Against Phase Errors
Hybrid analog-digital precoding significantly reduces the hardware costs in
massive MIMO transceivers when compared to fully-digital precoding at the
expense of increased transmit power. In order to mitigate the above shortfall,
we use the concept of constructive interference-based precoding, which has been
shown to offer significant transmit power savings when compared with the
conventional interference suppression-based precoding in fully-digital
multiuser MIMO systems. Moreover, in order to circumvent the potential
quality-of-service degradation at the users due to the hardware impairments in
the transmitters, we judiciously incorporate robustness against such
vulnerabilities in the precoder design. Since the undertaken constructive
interference-based robust hybrid precoding problem is nonconvex with infinite
constraints and thus difficult to solve optimally, we decompose the problem
into two subtasks, namely, analog precoding and digital precoding. In this
paper, we propose an algorithm to compute the optimal constructive
interference-based robust digital precoders. Furthermore, we devise a scheme to
facilitate the implementation of the proposed algorithm in a low-complexity and
distributed manner. We also discuss block-level analog precoding techniques.
Simulation results demonstrate the superiority of the proposed algorithm and
its implementation scheme over the state-of-the-art methods
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
Two-Stage Subspace Constrained Precoding in Massive MIMO Cellular Systems
We propose a subspace constrained precoding scheme that exploits the spatial
channel correlation structure in massive MIMO cellular systems to fully unleash
the tremendous gain provided by massive antenna array with reduced channel
state information (CSI) signaling overhead. The MIMO precoder at each base
station (BS) is partitioned into an inner precoder and a Transmit (Tx) subspace
control matrix. The inner precoder is adaptive to the local CSI at each BS for
spatial multiplexing gain. The Tx subspace control is adaptive to the channel
statistics for inter-cell interference mitigation and Quality of Service (QoS)
optimization. Specifically, the Tx subspace control is formulated as a QoS
optimization problem which involves an SINR chance constraint where the
probability of each user's SINR not satisfying a service requirement must not
exceed a given outage probability. Such chance constraint cannot be handled by
the existing methods due to the two stage precoding structure. To tackle this,
we propose a bi-convex approximation approach, which consists of three key
ingredients: random matrix theory, chance constrained optimization and
semidefinite relaxation. Then we propose an efficient algorithm to find the
optimal solution of the resulting bi-convex approximation problem. Simulations
show that the proposed design has significant gain over various baselines.Comment: 13 pages, accepted by IEEE Transactions on Wireless Communication
Sum Throughput Maximization in Multi-Tag Backscattering to Multiantenna Reader
Backscatter communication (BSC) is being realized as the core technology for
pervasive sustainable Internet-of-Things applications. However, owing to the
resource-limitations of passive tags, the efficient usage of multiple antennas
at the reader is essential for both downlink excitation and uplink detection.
This work targets at maximizing the achievable sum-backscattered-throughput by
jointly optimizing the transceiver (TRX) design at the reader and
backscattering coefficients (BC) at the tags. Since, this joint problem is
nonconvex, we first present individually-optimal designs for the TRX and BC. We
show that with precoder and {combiner} designs at the reader respectively
targeting downlink energy beamforming and uplink Wiener filtering operations,
the BC optimization at tags can be reduced to a binary power control problem.
Next, the asymptotically-optimal joint-TRX-BC designs are proposed for both low
and high signal-to-noise-ratio regimes. Based on these developments, an
iterative low-complexity algorithm is proposed to yield an efficient
jointly-suboptimal design. Thereafter, we discuss the practical utility of the
proposed designs to other application settings like wireless powered
communication networks and BSC with imperfect channel state information.
Lastly, selected numerical results, validating the analysis and shedding novel
insights, demonstrate that the proposed designs can yield significant
enhancement in the sum-backscattered throughput over existing benchmarks.Comment: 17 pages, 5 figures, accepted for publication in IEEE Transactions on
Communication
Joint Source and Relay Precoding Designs for MIMO Two-Way Relaying Based on MSE Criterion
Properly designed precoders can significantly improve the spectral efficiency
of multiple-input multiple-output (MIMO) relay systems. In this paper, we
investigate joint source and relay precoding design based on the
mean-square-error (MSE) criterion in MIMO two-way relay systems, where two
multi-antenna source nodes exchange information via a multi-antenna
amplify-and-forward relay node. This problem is non-convex and its optimal
solution remains unsolved. Aiming to find an efficient way to solve the
problem, we first decouple the primal problem into three tractable
sub-problems, and then propose an iterative precoding design algorithm based on
alternating optimization. The solution to each sub-problem is optimal and
unique, thus the convergence of the iterative algorithm is guaranteed.
Secondly, we propose a structured precoding design to lower the computational
complexity. The proposed precoding structure is able to parallelize the
channels in the multiple access (MAC) phase and broadcast (BC) phase. It thus
reduces the precoding design to a simple power allocation problem. Lastly, for
the special case where only a single data stream is transmitted from each
source node, we present a source-antenna-selection (SAS) based precoding design
algorithm. This algorithm selects only one antenna for transmission from each
source and thus requires lower signalling overhead. Comprehensive simulation is
conducted to evaluate the effectiveness of all the proposed precoding designs.Comment: 32 pages, 10 figure
MIMO Transceiver Optimization With Linear Constraints on Transmitted Signal Covariance Components
This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transceiver with linear precoding and decision feedback equalization are considered. For both types of transceivers, in addition to the usual total power constraint, an individual power constraint on each antenna element is also imposed. A number of objective functions including the average bit error rate, are considered for both of the above systems under the generalized power constraint. It is shown that for both types of systems the optimization problem can be solved by first solving a class of MMSE problems (AM-MMSE or GM-MMSE depending on the type of transceiver), and then using majorization theory. The first step, under the generalized power constraint, can be formulated as a semidefinite program (SDP) for both types of transceivers, and can be solved efficiently by convex optimization tools. The second step is addressed by using results from majorization theory. The framework developed here is general enough to add any finite number of linear constraints to the covariance matrix of the input
- …