Robust MIMO precoding for several classes of channel uncertainty

in IEEE Transactions on Signal Processing (2013), 12(61), 3056-3070

The full potential of multi-input multi-output (MIMO) communication systems relies on exploiting channel state information at the transmitter (CSIT), which is, however, often subject to some uncertainty ... [more ▼]

The full potential of multi-input multi-output (MIMO) communication systems relies on exploiting channel state information at the transmitter (CSIT), which is, however, often subject to some uncertainty. In this paper, following the worst-case robust philosophy, we consider a robust MIMO precoding design with deterministic imperfect CSIT, formulated as a maximin problem, to maximize the worst-case received signal-to-noise ratio or minimize the worst-case error probability. Given different types of imperfect CSIT in practice, a unified framework is lacking in the literature to tackle various channel uncertainty. In this paper, we address this open problem by considering several classes of uncertainty sets that include most deterministic imperfect CSIT as special cases. We show that, for general convex uncertainty sets, the robust precoder, as the solution to the maximin problem, can be efficiently computed by solving a single convex optimization problem. Furthermore, when it comes to unitarily-invariant convex uncertainty sets, we prove the optimality of a channel-diagonalizing structure and simplify the complex-matrix problem to a real-vector power allocation problem, which is then analytically solved in a waterfilling manner. Finally, for uncertainty sets defined by a generic matrix norm, called the Schatten norm, we provide a fully closed-form solution to the robust precoding design, based on which the robustness of beamforming and uniform-power transmission is investigated. [less ▲]

Capacity limits and multiplexing gains of MIMO channels with transceiver impairments

in IEEE Communications Letters (2013), 1(17), 91-94

The capacity of ideal MIMO channels has a high-SNR slope that equals the minimum of the number of transmit and receive antennas. This letter analyzes if this result holds when there are distortions from ... [more ▼]

The capacity of ideal MIMO channels has a high-SNR slope that equals the minimum of the number of transmit and receive antennas. This letter analyzes if this result holds when there are distortions from physical transceiver impairments. We prove analytically that such physical MIMO channels have a finite upper capacity limit, for any channel distribution and SNR. The high-SNR slope thus collapses to zero. This appears discouraging, but we prove the encouraging result that the relative capacity gain of employing MIMO is at least as large as with ideal transceivers. [less ▲]

Satellite Cognitive Communications: Interference Modeling and Techniques Selection

in Proceeding of 6th Advanced Satellite Multimedia Systems Conference and the 12th Signal Processing for Space Communications Workshop (2012, September)

Due to increasing demand of high speed data rate for satellite multimedia and broadcasting services and spectrum scarcity problem in satellite bands, exploring new techniques for enhancing spectral ... [more ▼]

Due to increasing demand of high speed data rate for satellite multimedia and broadcasting services and spectrum scarcity problem in satellite bands, exploring new techniques for enhancing spectral efficiency in satellite communication has become an important research challenge. In this aspect, satellite cognitive communication can be considered as a promising solution to solve spectrum scarcity problem. In this paper, different cognitive techniques such as underlay, overlay, interweave and database related techniques are discussed by reviewing the current state of art. Exact beam patterns of a multi-beam satellite are plotted over the Europe map and interference modeling between terrestrial Base Station (BS) and satellite terminal is carried out on the basis of interference power level. Furthermore, suitable cognitive techniques are proposed in high and low interference regions in the context of satellite cognitive communication. [less ▲]

Iterative Precoder Design and User Scheduling for Block-Diagonalized Systems

in IEEE Transactions on Signal Processing (2012), 60(7), 3726-3739

The block diagonalization (BD) scheme is a low-complexity suboptimal precoding technique for multiuser multiple input-multiple output (MIMO) downlink channels, which completely precancels the multiuser ... [more ▼]

The block diagonalization (BD) scheme is a low-complexity suboptimal precoding technique for multiuser multiple input-multiple output (MIMO) downlink channels, which completely precancels the multiuser interference. Accordingly, the precoder of each user lies in the null space of other users' channel matrices. In this paper, we propose an iterative algorithm using QR decompositions (QRDs) to compute the precoders. Specifically, to avoid dealing with a large concatenated matrix, we apply the QRD to a sequence of matrices of lower dimensions. One problem of BD schemes is that the number of users that can be simultaneously supported is limited due to zero interference constraints. When the number of users is large, a set of users must be selected, and selection algorithms should be designed to exploit the multiuser diversity gain. Finding the optimal set of users requires an exhaustive search, which has too high computational complexity to be practically useful. Based on the iterative precoder design, this paper proposes a low-complexity user selection algorithm using a greedy method, in which the precoders of selected users are recursively updated after each selection step. The selection metric of the proposed scheduling algorithm relies on the product of the squared row norms of the effective channel matrices, which is related to the eigenvalues by the Hadamard and Schur inequalities. An asymptotic analysis is provided to show that the proposed algorithm can achieve the optimal sum rate scaling of the MIMO broadcast channel. The numerical results show that the proposed algorithm achieves a good trade-off between sum rate performance and computational complexity. When users suffer different channel conditions, providing fairness among users is of critical importance. To address this problem, we also propose two fair scheduling (FS) algorithms, one imposing fairness in the approximation of the data rate, and another directly imposing fairness in the product of the sq- ared row norms of the effective channel matrices. [less ▲]

Exploiting Polarization for Spectrum Sensing in Cognitive SatComs

in Proceedings of 7th International Conference on Cognitive Radio Oriented Wireless Networks (2012, June)

Exploring new techniques for spectrum sensing (SS), which can detect the weak primary signals instantly, has been an important research challenge. In this paper, the problem of enhancing SS efficiency in ... [more ▼]

Exploring new techniques for spectrum sensing (SS), which can detect the weak primary signals instantly, has been an important research challenge. In this paper, the problem of enhancing SS efficiency in cognitive SatComs has been considered. The analysis of different combining techniques has been carried out for SS using dual polarized antenna. Furthermore, polarization states of received signals are exploited and based on obtained polarization states, Optimum Polarization Based Combining (OPBC) technique has been used for carrying out SS in the satellite terminal. The sensing performance of OPBC technique has been compared to selection combining (SC), equal gain combining (EGC) and maximum ratio combining (MRC) techniques. The simulation results show that OPBC technique achieves a great improvement in sensing efficiency over other considered techniques at the expense of complexity in a dual polarized AWGN channel. [less ▲]

Physical Layer Security in Multibeam Satellite Systems

in IEEE Transactions on Wireless Communications (2012), 11(2), 852-863

Security threats introduced due to the vulnerability of the transmission medium may hinder the proliferation of Ka band multibeam satellite systems for civil and military data applications. This paper ... [more ▼]

Security threats introduced due to the vulnerability of the transmission medium may hinder the proliferation of Ka band multibeam satellite systems for civil and military data applications. This paper sets the analytical framework and then studies physical layer security techniques for fixed legitimate receivers dispersed throughout multiple beams, each possibly surrounded by multiple (passive) eavesdroppers. The design objective is to minimize via transmit beamforming the costly total transmit power on board the satellite, while satisfying individual intended users' secrecy rate constraints. Assuming state-of-the-art satellite channel models, when perfect channel state information (CSI) about the eavesdroppers is available at the satellite, a partial zero-forcing approach is proposed for obtaining a low-complexity sub-optimal solution. For the optimal solution, an iterative algorithm combining semi-definite programming relaxation and the gradient-based method is devised by studying the convexity of the problem. Furthermore, the use of artificial noise as an additional degree-of-freedom for protection against eavesdroppers is explored. When only partial CSI about the eavesdroppers is available, we study the problem of minimizing the eavesdroppers' received signal to interference-plus-noise ratios. Simulation results demonstrate substantial performance improvements over existing approaches. [less ▲]

Robust Monotonic Optimization Framework for Multicell MISO Systems

in IEEE Transactions on Signal Processing (2012), 60(5), 2508-2523

The performance of multiuser systems is both difficult to measure fairly and to optimize. Most resource allocation problems are nonconvex and NP-hard, even under simplifying assumptions such as perfect ... [more ▼]

The performance of multiuser systems is both difficult to measure fairly and to optimize. Most resource allocation problems are nonconvex 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 robust- ness to channel uncertainty. A robust fairness-profile optimization (RFO) problem is solved at each iteration, which is a quasiconvex 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. [less ▲]

Capacity Analysis of Dual-Hop Amplify-and-Forward MIMO Multiple-Access Channels

in International Conference on Wireless Communications and Signal Processing, WCSP 2012 (2012)

Relay channels have been heavily studied during the last decades as a means of improving spectral efficiency, availability and coverage in combination with multiple antenna transceivers. Relay channels ... [more ▼]

Relay channels have been heavily studied during the last decades as a means of improving spectral efficiency, availability and coverage in combination with multiple antenna transceivers. Relay channels can comprise many hops but the most practical approach at the time being would be a dual-hop system. In addition, the simplest method of relaying in terms of complexity is amplify and forward. In this direction, we investigate the ergodic capacity of a dual-hop amplify-and-forward MIMO MAC and we derive asymptotic closed-form expressions based on the principles of free probability theory. We extend the current literature by proposing a analytical model which can accommodate variance-profiled Gaussian matrices. Numerical results are utilized to verify the accuracy of the derived closed-form expressions and evaluate the effect of the channel parameters. [less ▲]

Real-Time Distance-Dependent Mapping for a Hybrid ToF Multi-Camera Rig

in IEEE Journal of Selected Topics in Signal Processing (2012), 6(5), 1-12

On the optimality of beamformer design for zero-forcing DPC with QR decomposition

in IEEE International Conference on Communications (2012)

We consider the beamformer design for zero-forcing dirty paper coding (ZF-DPC), a suboptimal transmission technique for MISO broadcast channels (MISO BCs). Beamformers for ZF-DPC are designed to maximize ... [more ▼]

We consider the beamformer design for zero-forcing dirty paper coding (ZF-DPC), a suboptimal transmission technique for MISO broadcast channels (MISO BCs). Beamformers for ZF-DPC are designed to maximize a performance measure, subject to some power constraints and zero-interference constraints. For the sum rate maximization problem under a total power constraint, the existing beamformer designs in the literature are based on the QR decomposition (QRD), which is used to satisfy the ZF constraints. However, the optimality of the QRD-based design is still unknown. First, we prove that the QRD-based design is indeed optimal for ZF-DPC for any performance measure under a sum power constraint. For the per-antenna power constraints, the QRD-based designs become suboptimal, and we propose an optimal design, using a convex optimization framework. Low-complexity suboptimal designs are also presented. © 2012 IEEE. [less ▲]