161 research outputs found
Robust Sum MSE Optimization for Downlink Multiuser MIMO Systems with Arbitrary Power Constraint: Generalized Duality Approach
This paper considers linear minimum meansquare- error (MMSE) transceiver
design problems for downlink multiuser multiple-input multiple-output (MIMO)
systems where imperfect channel state information is available at the base
station (BS) and mobile stations (MSs). We examine robust sum mean-square-error
(MSE) minimization problems. The problems are examined for the generalized
scenario where the power constraint is per BS, per BS antenna, per user or per
symbol, and the noise vector of each MS is a zero-mean circularly symmetric
complex Gaussian random variable with arbitrary covariance matrix. For each of
these problems, we propose a novel duality based iterative solution. Each of
these problems is solved as follows. First, we establish a novel sum average
meansquare- error (AMSE) duality. Second, we formulate the power allocation
part of the problem in the downlink channel as a Geometric Program (GP). Third,
using the duality result and the solution of GP, we utilize alternating
optimization technique to solve the original downlink problem. To solve robust
sum MSE minimization constrained with per BS antenna and per BS power problems,
we have established novel downlink-uplink duality. On the other hand, to solve
robust sum MSE minimization constrained with per user and per symbol power
problems, we have established novel downlink-interference duality. For the
total BS power constrained robust sum MSE minimization problem, the current
duality is established by modifying the constraint function of the dual uplink
channel problem. And, for the robust sum MSE minimization with per BS antenna
and per user (symbol) power constraint problems, our duality are established by
formulating the noise covariance matrices of the uplink and interference
channels as fixed point functions, respectively.Comment: IEEE TSP Journa
Robust Linear Precoder Design for Multi-cell Downlink Transmission
Coordinated information processing by the base stations of multi-cell
wireless networks enhances the overall quality of communication in the network.
Such coordinations for optimizing any desired network-wide quality of service
(QoS) necessitate the base stations to acquire and share some channel state
information (CSI). With perfect knowledge of channel states, the base stations
can adjust their transmissions for achieving a network-wise QoS optimality. In
practice, however, the CSI can be obtained only imperfectly. As a result, due
to the uncertainties involved, the network is not guaranteed to benefit from a
globally optimal QoS. Nevertheless, if the channel estimation perturbations are
confined within bounded regions, the QoS measure will also lie within a bounded
region. Therefore, by exploiting the notion of robustness in the worst-case
sense some worst-case QoS guarantees for the network can be asserted. We adopt
a popular model for noisy channel estimates that assumes that estimation noise
terms lie within known hyper-spheres. We aim to design linear transceivers that
optimize a worst-case QoS measure in downlink transmissions. In particular, we
focus on maximizing the worst-case weighted sum-rate of the network and the
minimum worst-case rate of the network. For obtaining such transceiver designs,
we offer several centralized (fully cooperative) and distributed (limited
cooperation) algorithms which entail different levels of complexity and
information exchange among the base stations.Comment: 38 Pages, 7 Figures, To appear in the IEEE Transactions on Signal
Processin
Robust Monotonic Optimization Framework for Multicell MISO Systems
The performance of multiuser systems is both difficult to measure fairly and
to optimize. Most resource allocation problems are non-convex and NP-hard, even
under simplifying assumptions such as perfect channel knowledge, homogeneous
channel properties among users, and simple power constraints. We establish a
general optimization framework that systematically solves these problems to
global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles
general multicell downlink systems with single-antenna users, multiantenna
transmitters, arbitrary quadratic power constraints, and robustness to channel
uncertainty. A robust fairness-profile optimization (RFO) problem is solved at
each iteration, which is a quasi-convex problem and a novel generalization of
max-min fairness. The BRB algorithm is computationally costly, but it shows
better convergence than the previously proposed outer polyblock approximation
algorithm. Our framework is suitable for computing benchmarks in general
multicell systems with or without channel uncertainty. We illustrate this by
deriving and evaluating a zero-forcing solution to the general problem.Comment: Published in IEEE Transactions on Signal Processing, 16 pages, 9
figures, 2 table
- …