Quadratically Constrained Beamforming Robust Against Direction-of-Arrival Mismatch

It is well known that the performance of the minimum variance distortionless response (MVDR) beamformer is very sensitive to steering vector mismatch. Such mismatches can occur as a result of direction-of-arrival (DOA) errors, local scattering, near-far spatial signature mismatch, waveform distortion, source spreading, imperfectly calibrated arrays and distorted antenna shape. In this paper, an adaptive beamformer that is robust against the DOA mismatch is proposed. This method imposes two quadratic constraints such that the magnitude responses of two steering vectors exceed unity. Then, a diagonal loading method is used to force the magnitude responses at the arrival angles between these two steering vectors to exceed unity. Therefore, this method can always force the gains at a desired range of angles to exceed a constant level while suppressing the interferences and noise. A closed-form solution to the proposed minimization problem is introduced, and the diagonal loading factor can be computed systematically by a proposed algorithm. Numerical examples show that this method has excellent signal-to-interference-plus-noise ratio performance and a complexity comparable to the standard MVDR beamformer

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

Adaptive beamforming using frequency invariant uniform concentric circular arrays

This paper proposes new adaptive beamforming algorithms for a class of uniform concentric circular arrays (UCCAs) having near-frequency invariant characteristics. The basic principle of the UCCA frequency invariant beamformer (FIB) is to transform the received signals to the phase mode representation and remove the frequency dependence of individual phase modes through the use of a digital beamforming or compensation network. As a result, the far field pattern of the array is electronic steerable and is approximately invariant over a wider range of frequencies than the uniform circular arrays (UCAs). The beampattern is governed by a small set of variable beamformer weights. Based on the minimum variance distortionless response (MVDR) and generalized sidelobe canceller (GSC) methods, new recursive adaptive beamforming algorithms for UCCA-FIB are proposed. In addition, robust versions of these adaptive beamforming algorithms for mitigating direction-of-arrival (DOA) and sensor position errors are developed. Simulation results show that the proposed adaptive UCCA-FIBs converge much faster and reach a considerable lower steady-state error than conventional broadband UCCA beamformers without using the compensation network. Since fewer variable multipliers are required in the proposed algorithms, it also leads to lower arithmetic complexity and faster tracking performance than conventional methods. © 2007 IEEE.published_or_final_versio

Multicast Multigroup Precoding and User Scheduling for Frame-Based Satellite Communications

The present work focuses on the forward link of a broadband multibeam satellite system that aggressively reuses the user link frequency resources. Two fundamental practical challenges, namely the need to frame multiple users per transmission and the per-antenna transmit power limitations, are addressed. To this end, the so-called frame-based precoding problem is optimally solved using the principles of physical layer multicasting to multiple co-channel groups under per-antenna constraints. In this context, a novel optimization problem that aims at maximizing the system sum rate under individual power constraints is proposed. Added to that, the formulation is further extended to include availability constraints. As a result, the high gains of the sum rate optimal design are traded off to satisfy the stringent availability requirements of satellite systems. Moreover, the throughput maximization with a granular spectral efficiency versus SINR function, is formulated and solved. Finally, a multicast-aware user scheduling policy, based on the channel state information, is developed. Thus, substantial multiuser diversity gains are gleaned. Numerical results over a realistic simulation environment exhibit as much as 30% gains over conventional systems, even for 7 users per frame, without modifying the framing structure of legacy communication standards.Comment: Accepted for publication to the IEEE Transactions on Wireless Communications, 201