Lattice-Reduction-Aided Sphere Decoding for MIMO Detection Achieving ML Performance

被引：8

作者：

Liu, Jinzhu ^{[1
]}

Xing, Song ^{[2
]}

Shen, Lianfeng ^{[3
]}

机构：

[1] Nanjing Univ Informat Sci & Technol, Sch Elect & Informat Engn, Nanjing 210044, Jiangsu, Peoples R China

[2] Calif State Univ Los Angeles, Dept Informat Syst, Los Angeles, CA 90032 USA

[3] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2016年 / 20卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Lattice reduction; maximum likelihood detection; MIMO; sphere decoding; DETECTION ALGORITHM; COMPLEXITY; SEARCH;

D O I：

10.1109/LCOMM.2015.2504094

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We propose a lattice-reduction-aided sphere decoding (SD) algorithm for MIMO detection achieving exact maximum likelihood (ML) detection performance with very low computational complexity in the mid and high signal-to-noise ratio (SNR) regions. A simple criterion is presented to determine if the ML detection result is obtained by a primary search. If not, a further search will be carried out to find the ML detection result eventually. Simulation results show that in the mid and high SNR environments, the computational complexity of the proposed algorithm is considerably lower than that of the conventional SD.

引用

页码：125 / 128

页数：4

共 13 条

[1]

Conway J.H., 1993, SPHERE PACKINGS LATT

[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]

FINCKE U, 1985, MATH COMPUT, V44, P463, DOI 10.1090/S0025-5718-1985-0777278-8

[4] 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

[5] Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture [J].

Golden, GD ;

Foschini, CJ ;

Valenzuela, RA ;

Wolniansky, PW .

ELECTRONICS LETTERS, 1999, 35 (01) :14-16

[6] On the sphere-decoding algorithm I. Expected complexity [J].

Hassibi, B ;

Vikalo, H .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (08) :2806-2818

[7] Near-ML MIMO Detection Algorithm With LR-Aided Fixed-Complexity Tree Searching [J].

Kim, Hyunsub ;

Park, Jangyong ;

Lee, Hyukyeon ;

Kim, Jaeseok .

IEEE COMMUNICATIONS LETTERS, 2014, 18 (12) :2221-2224

[8] Low-Complexity Soft-Output Sphere Decoding with Modified Repeated Tree Search Strategy [J].

Shieh, Shin-Lin ;

Chiu, Rong-Dong ;

Feng, Shih-Lun ;

Chen, Po-Ning .

IEEE COMMUNICATIONS LETTERS, 2013, 17 (01) :51-54

[9] On Further Reduction of Complexity in Tree Pruning Based Sphere Search [J].

Shim, Byonghyo ;

Kang, Insung .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (02) :417-422

[10] Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity [J].

Singh, Arun Kumar ;

Elia, Petros ;

Jalden, Joakim .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) :3692-3707

← 1 2 →