Cooperative Cognitive Relaying Under Primary and Secondary Quality of Service Satisfaction

This paper proposes a new cooperative protocol which involves cooperation between primary and secondary users. We consider a cognitive setting with one primary user and multiple secondary users. The time resource is partitioned into discrete time slots. Each time slot, a secondary user is scheduled for transmission according to time division multiple access, and the remainder of the secondary users, which we refer to as secondary relays, attempt to decode the primary packet. Afterwards, the secondary relays employ cooperative beamforming to forward the primary packet and to provide protection to the secondary destination of the secondary source scheduled for transmission from interference. We characterize the diversity-multiplexing tradeoff of the primary source under the proposed protocol. We consider certain quality of service for each user specified by its required throughput. The optimization problem is stated under such condition. It is shown that the optimization problem is linear and can be readily solved. We show that the sum of the secondary required throughputs must be less than or equal to the probability of correct packets reception.Comment: This paper was accepted in PIMRC 201

Chance Constrained Robust Downlink Beamforming in Multicell Networks

We introduce a downlink robust optimization approach that minimizes a combination of total transmit power by a multiple antenna base station (BS) within a cell and the resulting aggregate inter-cell interference (ICI) power on the users of the other cells. This optimization is constrained to assure that a set of signal-to-interference-plus-noise ratio (SINR) targets are met at user terminals with certain outage probabilities. The outages are due to the uncertainties that naturally emerge in the estimation of channel covariance matrices between a BS and its intra-cell local users as well as the other users of the other cells. We model these uncertainties using random matrices, analyze their statistical behaviour and formulate a tractable probabilistic approach to the design of optimal robust downlink beamforming vectors. The proposed approach reformulates the original intractable non-convex problem in a semidefinite programming (SDP) form with linear matrix inequality (LMI) constraints. The resulting SDP formulation is convex and numerically tractable under the standard rank relaxation. We compare the proposed chance-constrained approach against two different robust design schemes as well as the worst-case robustness. The simulation results confirm better power efficiency and higher resilience against channel uncertainties of the proposed approach in realistic scenarios

Chance constrained robust downlink beamforming in multicell networks

We introduce a downlink robust optimization approach that minimizes a combination of total transmit power by a multiple antenna base station (BS) within a cell and the resulting aggregate inter-cell interference (ICI) power on the users of the other cells. This optimization is constrained to assure that a set of signal-to-interference-plus-noise ratio (SINR) targets are met at user terminals with certain outage probabilities. The outages are due to the uncertainties that naturally emerge in the estimation of channel covariance matrices between a BS and its intra-cell local users as well as the other users of the other cells. We model these uncertainties using random matrices, analyze their statistical behaviour and formulate a tractable probabilistic approach to the design of optimal robust downlink beamforming vectors. The proposed approach reformulates the original intractable non-convex problem in a semidefinite programming (SDP) form with linear matrix inequality (LMI) constraints. The resulting SDP formulation is convex and numerically tractable under the standard rank relaxation. We compare the proposed chance-constrained approach against two different robust design schemes as well as the worst-case robustness. The simulation results confirm better power efficiency and higher resilience against channel uncertainties of the proposed approach in realistic scenarios

Joint Beamforming and Power Control in Coordinated Multicell: Max-Min Duality, Effective Network and Large System Transition

This paper studies joint beamforming and power control in a coordinated multicell downlink system that serves multiple users per cell to maximize the minimum weighted signal-to-interference-plus-noise ratio. The optimal solution and distributed algorithm with geometrically fast convergence rate are derived by employing the nonlinear Perron-Frobenius theory and the multicell network duality. The iterative algorithm, though operating in a distributed manner, still requires instantaneous power update within the coordinated cluster through the backhaul. The backhaul information exchange and message passing may become prohibitive with increasing number of transmit antennas and increasing number of users. In order to derive asymptotically optimal solution, random matrix theory is leveraged to design a distributed algorithm that only requires statistical information. The advantage of our approach is that there is no instantaneous power update through backhaul. Moreover, by using nonlinear Perron-Frobenius theory and random matrix theory, an effective primal network and an effective dual network are proposed to characterize and interpret the asymptotic solution.Comment: Some typos in the version publised in the IEEE Transactions on Wireless Communications are correcte

Twenty-Five Years of Advances in Beamforming: From Convex and Nonconvex Optimization to Learning Techniques

Beamforming is a signal processing technique to steer, shape, and focus an electromagnetic wave using an array of sensors toward a desired direction. It has been used in several engineering applications such as radar, sonar, acoustics, astronomy, seismology, medical imaging, and communications. With the advances in multi-antenna technologies largely for radar and communications, there has been a great interest on beamformer design mostly relying on convex/nonconvex optimization. Recently, machine learning is being leveraged for obtaining attractive solutions to more complex beamforming problems. This article captures the evolution of beamforming in the last twenty-five years from convex-to-nonconvex optimization and optimization-to-learning approaches. It provides a glimpse of this important signal processing technique into a variety of transmit-receive architectures, propagation zones, paths, and conventional/emerging applications