A vector-perturbation technique for near-capacity multiantenna multiuser communication - Part II: Perturbation

被引:506
作者
Hochwald, BM
Peel, CB
Swindlehurst, AL
机构
[1] Bell Labs, Math Commun Res Dept, Murray Hill, NJ 07974 USA
[2] Swiss Fed Inst Technol, Commun Technol Lab, CH-8092 Zurich, Switzerland
[3] Brigham Young Univ, Dept Elect & Comp Engn, Provo, UT 84602 USA
基金
美国国家科学基金会;
关键词
broadcast channel; dirty-paper coding; multiple-antenna multiple-user wireless; multiple-input multiple-output (MIMO); spatial equalization; sphere encoder; Tomlinson-Harashima precoding;
D O I
10.1109/TCOMM.2004.841997
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recent theoretical results describing the sum-capacity when using multiple antennas to communicate with multiple users in a known rich scattering environment have not yet been followed with practical transmission schemes that achieve this capacity. We introduce a simple encoding algorithm that achieves near-capacity at sum-rates of tens of bits/channel use. The algorithm is a variation on channel inversion that regularizes the inverse and uses a "sphere encoder" to perturb the data to reduce the energy of the transmitted signal. The paper is comprised of two parts. In this second part, we show that, after the regularization of the channel inverse introduced in the first part, a certain perturbation of the data using a "sphere encoder" can be chosen to further reduce the energy of the transmitted signal. The performance difference with and without this perturbation is shown to be dramatic. With the perturbation, we achieve excellent performance at all signal-to-noise ratios. The results of both uncoded and turbo-coded simulations are presented.
引用
收藏
页码:537 / 544
页数:8
相关论文
共 31 条
[1]   Closest point search in lattices [J].
Agrell, E ;
Eriksson, T ;
Vardy, A ;
Zeger, K .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (08) :2201-2214
[2]  
[Anonymous], P IEEE ANN ALL C COM
[3]   On the achievable throughput of a multiantenna Gaussian broadcast channel [J].
Caire, G ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (07) :1691-1706
[4]   WRITING ON DIRTY PAPER [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441
[5]   On maximum-likelihood detection and the search for the closest lattice point [J].
Damen, MO ;
El Gamal, H ;
Caire, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2389-2402
[6]   Lattice code decoder for space-time codes [J].
Damen, O ;
Chkeif, A ;
Belfiore, JC .
IEEE COMMUNICATIONS LETTERS, 2000, 4 (05) :161-163
[7]  
EDELMAN A, 1989, THESIS MASS I TECHNO
[8]   Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels [J].
El Gamal, H ;
Caire, G ;
Damen, MO .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) :968-985
[9]   Achieving 1/2 log(1+SNR) on the AWGN channel with lattice encoding and decoding [J].
Erez, U ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2293-2314
[10]  
Erez U, 2000, P INT S INF THEOR IT, P681