On Vector Perturbation Precoding for the MIMO Gaussian Broadcast Channel
- 29 July 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (11) , 5999-6027
Abstract
Precoding schemes in the framework of vector perturbation (VP) for the multiple-input multiple-output (MIMO) Gaussian broadcast channel (GBC) are investigated. The VP scheme, originally a “one-shot” technique, is generalized to encompass processing over multiple time instances. Using lattice-based extended alphabets (“perturbations”), and considering the infinite time-span extension limit, a lower bound on the achievable sum-rate using the generalized VP scheme is analytically obtained. The lower bound is shown to asymptotically achieve the optimum sum-rate in the high signal-to-noise ratio (SNR) regime (both in terms of degrees-of-freedom and power offset), for any number of users and transmit antennas. For the two-user cases, it is shown that the lower bound coincides with the sum-capacity for low SNR. The above lower bound is constructively obtained by means of an efficient practically oriented suboptimal transmit energy minimization algorithm, which exhibits a polynomial complexity in the number of users. The proposed precoding scheme demonstrates that the “shaping gain” is achievable for VP schemes, when employing “good” multidimensional lattices. It is also shown that the suboptimum algorithm has its merits, even when processing over multiple time instances is not employed. For the $2\times 2$ MIMO GBC, the VP scheme is generalized further, and an inner bound for the entire achievable rate region is obtained, by which an interesting correspondence is identified with the ultimate capacity region, as obtained by “dirty paper coding”.
Keywords
Funding Information
- Israel Science Foundation
- European Commission in the framework of the FP7 Network of Excellence in Wireless COMmunications NEWCOM#
This publication has 41 references indexed in Scilit:
- Trellis precoding for MIMO broadcast signalingIEEE Transactions on Communications, 2009
- Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channelIEEE Transactions on Wireless Communications, 2009
- Random template banks and relaxed lattice coveringsPhysical Review D, 2009
- Lattices are everywhere2009
- Capacity and Lattice Strategies for Canceling Known InterferenceIEEE Transactions on Information Theory, 2005
- Lattices Which Are Good for (Almost) EverythingIEEE Transactions on Information Theory, 2005
- Sum Power Iterative Water-Filling for Multi-Antenna Gaussian Broadcast ChannelsIEEE Transactions on Information Theory, 2005
- The impact of frequency-flat fading on the spectral efficiency of CDMAIEEE Transactions on Information Theory, 2001
- On lattice quantization noiseIEEE Transactions on Information Theory, 1996
- Sphere Packings, Lattices and Groups1988