Dual-Lattice Ordering and Partial Lattice Reduction for SIC-Based MIMO Detection

被引:21
作者
Ling, Cong [1 ]
Mow, Wai Ho [2 ]
Gan, Lu [3 ]
机构
[1] Univ London Imperial Coll Sci Technol & Med, Dept Elect & Elect Engn, London SW7 2AZ, England
[2] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Hong Kong, Peoples R China
[3] Brunel Univ, Sch Engn & Design, London UB8 3PH, England
关键词
Lattice reduction; multi-input multi-output (MIMO); successive interference cancellation; V-BLAST; FAST RECURSIVE ALGORITHM; V-BLAST; SEARCH; CODE;
D O I
10.1109/JSTSP.2009.2035851
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we propose low-complexity lattice detection algorithms for successive interference cancelation (SIC) in multi-input multi-output (MIMO) communications. First, we present a dual-lattice view of the vertical Bell Labs Layered Space-Time (V-BLAST) detection. We show that V-BLAST ordering is equivalent to applying sorted QR decomposition to the dual basis, or equivalently, applying sorted Cholesky decomposition to the associated Gram matrix. This new view results in lower detection complexity and allows simultaneous ordering and detection. Second, we propose a partial reduction algorithm that only performs lattice reduction for the last several, weak substreams, whose implementation is also facilitated by the dual-lattice view. By tuning the block size of the partial reduction (hence the complexity), it can achieve a variable diversity order, hence offering a graceful tradeoff between performance and complexity for SIC-based MIMO detection. Numerical results are presented to compare the computational costs and to verify the achieved diversity order.
引用
收藏
页码:975 / 985
页数:11
相关论文
共 38 条
[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]   Speeding-up lattice reduction with random projections (Extended abstract) [J].
Akhavi, Ali ;
Stehle, Damien .
LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 :293-+
[3]  
[Anonymous], 1998, Proc. URSI ISSSE, DOI DOI 10.1109/ISSSE.1998.738086
[4]   The Golden code: A 2x2 full-rate space-time code with nonvanishing determinants [J].
Belfiore, JC ;
Rekaya, G ;
Viterbo, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) :1432-1436
[5]   A fast recursive algorithm for optimum sequential signal detection in a BLAST system [J].
Benesty, J ;
Huang, YT ;
Chen, JD .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2003, 51 (07) :1722-1730
[6]  
Cohen H., 1993, Graduate Texts in Mathematics
[7]   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
[8]   Computation of the Para-Pseudoinverse for Oversampled Filter Banks: Forward and Backward Greville Formulas [J].
Gan, Lu ;
Ling, Cong .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (12) :5851-5860
[9]   Novel Joint Sorting and Lattice Reduction for Delay-Constrained LLL-reduction-aided MIMO Detection [J].
Gan, Ying Hung ;
Mow, Wai Ho .
IEEE SIGNAL PROCESSING LETTERS, 2008, 15 :194-197
[10]   Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection [J].
Gan, Ying Hung ;
Ling, Cong ;
Mow, Wai Ho .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (07) :2701-2710