1,760 research outputs found
Generic Multiuser Coordinated Beamforming for Underlay Spectrum Sharing
The beamforming techniques have been recently studied as possible enablers
for underlay spectrum sharing. The existing beamforming techniques have several
common limitations: they are usually system model specific, cannot operate with
arbitrary number of transmit/receive antennas, and cannot serve arbitrary
number of users. Moreover, the beamforming techniques for underlay spectrum
sharing do not consider the interference originating from the incumbent primary
system. This work extends the common underlay sharing model by incorporating
the interference originating from the incumbent system into generic combined
beamforming design that can be applied on interference, broadcast or multiple
access channels. The paper proposes two novel multiuser beamforming algorithms
for user fairness and sum rate maximization, utilizing newly derived convex
optimization problems for transmit and receive beamformers calculation in a
recursive optimization. Both beamforming algorithms provide efficient operation
for the interference, broadcast and multiple access channels, as well as for
arbitrary number of antennas and secondary users in the system. Furthermore,
the paper proposes a successive transmit/receive optimization approach that
reduces the computational complexity of the proposed recursive algorithms. The
results show that the proposed complexity reduction significantly improves the
convergence rates and can facilitate their operation in scenarios which require
agile beamformers computation.Comment: 30 pages, 5 figure
Energy Efficiency in MIMO Underlay and Overlay Device-to-Device Communications and Cognitive Radio Systems
This paper addresses the problem of resource allocation for systems in which
a primary and a secondary link share the available spectrum by an underlay or
overlay approach. After observing that such a scenario models both cognitive
radio and D2D communications, we formulate the problem as the maximization of
the secondary energy efficiency subject to a minimum rate requirement for the
primary user. This leads to challenging non-convex, fractional problems. In the
underlay scenario, we obtain the global solution by means of a suitable
reformulation. In the overlay scenario, two algorithms are proposed. The first
one yields a resource allocation fulfilling the first-order optimality
conditions of the resource allocation problem, by solving a sequence of easier
fractional problems. The second one enjoys a weaker optimality claim, but an
even lower computational complexity. Numerical results demonstrate the merits
of the proposed algorithms both in terms of energy-efficient performance and
complexity, also showing that the two proposed algorithms for the overlay
scenario perform very similarly, despite the different complexity.Comment: to appear in IEEE Transactions on Signal Processin
Dynamic Resource Allocation in Cognitive Radio Networks: A Convex Optimization Perspective
This article provides an overview of the state-of-art results on
communication resource allocation over space, time, and frequency for emerging
cognitive radio (CR) wireless networks. Focusing on the
interference-power/interference-temperature (IT) constraint approach for CRs to
protect primary radio transmissions, many new and challenging problems
regarding the design of CR systems are formulated, and some of the
corresponding solutions are shown to be obtainable by restructuring some
classic results known for traditional (non-CR) wireless networks. It is
demonstrated that convex optimization plays an essential role in solving these
problems, in a both rigorous and efficient way. Promising research directions
on interference management for CR and other related multiuser communication
systems are discussed.Comment: to appear in IEEE Signal Processing Magazine, special issue on convex
optimization for signal processin
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
We propose a novel decomposition framework for the distributed optimization
of general nonconvex sum-utility functions arising naturally in the system
design of wireless multiuser interfering systems. Our main contributions are:
i) the development of the first class of (inexact) Jacobi best-response
algorithms with provable convergence, where all the users simultaneously and
iteratively solve a suitably convexified version of the original sum-utility
optimization problem; ii) the derivation of a general dynamic pricing mechanism
that provides a unified view of existing pricing schemes that are based,
instead, on heuristics; and iii) a framework that can be easily particularized
to well-known applications, giving rise to very efficient practical (Jacobi or
Gauss-Seidel) algorithms that outperform existing adhoc methods proposed for
very specific problems. Interestingly, our framework contains as special cases
well-known gradient algorithms for nonconvex sum-utility problems, and many
blockcoordinate descent schemes for convex functions.Comment: submitted to IEEE Transactions on Signal Processin
- …