Professional Documents
Culture Documents
1, JANUARY 2016
125
I. I NTRODUCTION
ATTICE reduction (LR) has been introduced as a promising technique to improve the performance of the low complexity suboptimal MIMO detectors such as zero-forcing (ZF),
minimum mean-squared error (MMSE), and ordered successive
interference cancellation (OSIC) detection [1][3]. However,
it has been shown that although these LR-aided suboptimal
detectors can achieve a full diversity order of the MIMO fading channels, the performance of them still generally presents
an obvious gap with that of the optimal maximum likelihood
(ML) detector [2], [3].
The sphere decoding (SD) [4][6], on the other hand, can
achieve exact ML detection performance, but it requires considerable amount of computations compared with various suboptimal detection schemes. It is naturally expected that the lattice
reduction technique can be combined with the SD to reduce its
computational complexity. However, little attention has been
paid to this research direction, mainly owing to the negative
views on it in the literature. For example, in [5], the lattice
reduction is considered not useful for the SD for MIMO detection, which is a closest lattice vector problem (CVP) over a
(finite) subset of the infinite lattice. The reason claimed is that
the lattice transforming matrix often destroys the properties of
the subset, and the result of the LR-aided SD is not necessarily
the ML solution, which might be referred to as the out-ofbound symbol effects in the LR-aided SD. The authors of [6]
Manuscript received May 14, 2015; revised October 4, 2015 and November
17, 2015; accepted November 21, 2015. Date of publication November 26,
2015; date of current version January 7, 2016. This work was supported in part
by the China Important National Science and Technology Specific Projects (no.
2012ZX03004005-003) and in part by the National Natural Science Foundation
of China under Grant 61171081. The associate editor coordinating the review
of this paper and approving it for publication was A. C. Iossifides.
J. Liu is with the School of Electronic and Information Engineering, Nanjing
University of Information Science and Technology, Nanjing 210044, China
(e-mail: jzliu21@ nuist.edu.cn).
S. Xing is with the Department of Information Systems, California
State University, Los Angeles, Los Angeles, CA 90032 USA (e-mail:
sxing@calstatela.edu).
L. Shen is with the National Mobile Communications Research Laboratory,
Southeast University, Nanjing 210096, China (e-mail: lfshen@seu.edu.cn).
Digital Object Identifier 10.1109/LCOMM.2015.2504094
believe that although the LR-aided SD can derive the ML solution, it can not offer the complexity reduction. The theoretical
analysis in [7] confirms that the LR-aided SD can reduce the
computational complexity significantly, but the authors admit
that it has a performance gap with the ML detection due to its
out-of-bound symbol effects. Some improved fixed-complexity
SD schemes have been presented [8], in which the lattice reduction is intuitively adopted as a preprocessing to reduce the
complexity of the searching stage. However, the inherent outof-bound symbol effect problem is not taken into consideration
or only treated by using hard limiting.
In this letter, we propose a LR-aided SD algorithm for MIMO
detection achieving exact ML performance with very low computational complexity in the mid and high signal to noise
ratio (SNR) regions (roughly defined as the regions such that
Pe (S N R) < 102 , where Pe (S N R) is the symbol error rate
of the ML detection), which usually cover the practical SNR
range. A simple criterion is presented to determine if the ML
detection result is obtained by a primary search in a hypersphere. If not, a further search will be carried out to find the ML
detection result eventually. In addition, reordering the symbols
of the symbol vector, and the Schnorr-Euchner (SE) enumeration strategy are adopted to further increase the computational
efficiency.
II. S YSTEM M ODEL AND P RELIMINARIES
Consider a MIMO wireless communication system with
Nt transmitters and Nr (Nr Nt ) receivers. The relationship
between the Nt -dimensional transmitted complex-valued symbol vector sc (i.e. QAM symbol vector) and the Nr -dimensional
received vector xc is determined by xc = Ac sc + wc , where
Ac C Nr Nt presents a flat-fading channel matrix and has
complex-valued independent and identically distributed (i.i.d.)
Gaussian entries, and wc is the complex-valued additive white
Gaussian noise vector. In sphere decoding, the complex number
signal model needs to be reformulated to a real number signal
one as
x = As + w,
(1)
(2)
zZ N
1558-2558 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
126
(3)
zZ N
(5)
where d = U1 s is the transformed symbol vector. As aforementioned, s Z N , so the range of d is the image of
under U1 , denoted by d .
The basic idea of the LR-aided SD for MIMO detection is
as follows. In the range of transformed symbol vector d, i.e.
+w
the closest lattice point to the received signal x = Ad
,
is searched within a sphere of a certain radius , which is
described as
2
d ML = arg min x Az
(6)
2 ,
N
zZ
127
12 w2
1 M 21 2
2M/ 2 M 2
/
e / d = 1
(8)
(9)
where
C ( ) = K
N
k=1
k/ 2 k 2 k
(10)
visited
by SD in the
sphere of radius . In (10), k / 2 k 2 k is the volume
of the k-dimensional sphere of radius , which is proportional
to the expected number of lattice points inside the sphere, with
K denoting the coeffcient of proportionality [10].
The following is a rough argument to explain the lower
complexity of the proposed LR-aided SD compared to the conventional one. In the case of the ZF based SD (ZF-SD), noticing
that the first point found is the Babai point sB (also the ZF based
OSIC, or ZF-OSIC detection result), due to the SE enumeration
strategy being adopted [6], its complexity can be expressed as
C av = Pa C (a ) + (1 Pa ) C (b )
(11)
Pr () denoting the
wherePa = Pr sB = sML with
probability,
a = x AsML w, b = A s sB + w, C (a ) and
C (b ) are computed according to (10).
The complexity of the LR-aided ZF-SD (ZF-SD-LR) is
C fur
C av
= Pa C (a ) + 1 Pa C b + 1 Pa 1 Pok
(12)
128
TABLE II
N UMBER OF FLOP S U SED OF LR-A IDED F IXED C OMPLEXITY T REE
S EARCHING D ETECTION ( p = p = 2, M = 36 [8]) IN 8 8 MIMO
S YSTEMS . D ETECTOR 1: H ARD L IMITING IS U SED IN ML S TEP.
D ETECTOR 2: P ROPOSITION 1 P ROPOSED IN T HIS L ETTER IS U TILIZED IN
ML S TEP
R EFERENCES
[1] H. Yao and G. Wornell, Lattice-reduction-aided detectors for MIMO
communication systems, in Proc. IEEE Conf. Global Commun., Nov.
2002, pp. 424428.
[2] Y. H. Gan, C. Ling, and H. M. Mow, Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection, IEEE Trans.
Signal Process., vol. 57, no. 7, pp. 27012710, Jul. 2009.
[3] D. Wbben, D. Seethaler, J. Jaldn, and G. Marz, Lattice reduction:
A survey with applications in wireless communications, IEEE Signal
Process. Mag., vol. 28, no. 3, pp. 7091, May 2011.
[4] U. Fincke and M. Pohst, Improved methods for calculating vectors of
short length in a lattice, including a complexity analysis, Math. Comput.,
vol. 44, pp. 463471, Apr. 1985.
[5] B. Hassibi and H. Vikalo, On the expected complexity of sphere
decoding I. Theory, IEEE Trans. Signal Process., vol. 53, no. 8,
pp. 28062818, Aug. 2005.
[6] M. O. Damen, H. E. Gamal, and G. Caire, On maximum-likelihood
detection and the search for the closest lattice point, IEEE Trans. Inf.
Theory, vol. 49, no. 10, pp. 23892401, Oct. 2003.
[7] A. K. Singh, P. Elia, and J. Jaldn, Achieving a vanishing SNR gap to
exact lattice decoding at a subexponential complexity, IEEE Trans. Inf.
Theory, vol. 58, no. 6, pp. 36923707, Jun. 2012.
[8] H. Kim et al., Near-ML MIMO detection algorithm with LR-aided fixedcomplexity tree searching, IEEE Comm. Lett., vol. 18, no. 12, pp. 2221
2224. Dec. 2014.
[9] G. D. Golden et al., Detection algorithm and initial laboratory results
using V-BLAST space-time communication architecture, Electron. Lett.,
vol. 35, no. 1, pp. 1416, Jan. 1999.
[10] J. Conway and N. Sloane, Sphere Packings, Lattices and Graphs. Berlin,
Germany: Springer-Verlag, 1993.
[11] B. Shim and I. Kang, On further reduction of complexity in tree pruning
based sphere search, IEEE Trans. Comm., vol. 58, no. 2, pp. 417422,
Feb. 2010.
[12] W. Zhao and G. B. Giannakis, Sphere decoding algorithms with
improved radius search, IEEE Trans. Comm., vol. 53, no. 7, pp. 1104
1109, Jul. 2005.
[13] S-L. Shieh et al., Low-complexity soft-output sphere decoding with
modified repeated tree search strategy, IEEE Comm. Lett., vol. 17, no. 1,
pp. 5154. Jan. 2013.