High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

被引:6
作者
Mohammed, Saif K. [1 ]
Chockalingam, A. [1 ]
Rajan, B. Sundar [1 ]
机构
[1] Indian Inst Sci, Dept ECE, Bangalore 560012, Karnataka, India
来源
GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE | 2008年
关键词
Large MIMO systems; full-rate non-orthogonal STBCs; low-complexity detection; high spectral efficiency;
D O I
10.1109/GLOCOM.2008.ECP.839
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.
引用
收藏
页数:5
相关论文
共 16 条
[1]   A simple transmit diversity technique for wireless communications [J].
Alamouti, SM .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (08) :1451-1458
[2]   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
[3]   Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems [J].
Farhang-Boroujeny, B ;
Zhu, HD ;
Shi, ZN .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (05) :1896-1909
[4]   On the sphere-decoding algorithm I. Expected complexity [J].
Hassibi, B ;
Vikalo, H .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (08) :2806-2818
[5]   High-rate codes that are linear in space and time [J].
Hassibi, B ;
Hochwald, BM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) :1804-1824
[6]  
Jafarkhani H., 2005, SPACE TIME CODING TH
[7]  
Mohammed S.K., 2008, P IEEE ICC 2008 MAY
[8]  
MOHAMMED SK, 2008, P IEEE ISIT 2008 JUL
[9]  
Paulraj A, 2003, INTRO SPACE TIME WIR
[10]   Full-diversity, high-rate space-time block codes from division algebras [J].
Sethuraman, BA ;
Rajan, BS ;
Shashidhar, V .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2596-2616