Abstract:
Closest point algorithms find wide applications in decoding block transmissions encountered with single- or multi-user communication links relying on a single or multiple antennas. In this work, such algorithms are considered for random lattices generated by a known statistical model. The conventional sphere decoding algorithm (SDA) and related reduced-complexity techniques are examined from a probabilistic perspective. Combining SDA with optimal detection ordering is justified based on this random model. A novel algorithm that checks codeword candidates according to a probability order is derived and analyzed. Based on a probabilistic search and a suitable stopping criterion, a computationally efficient hybrid decoding algorithm is developed with near-SDA error performance. Simulations confirm that considerable complexity reduction is achieved by this hybrid algorithm as the signal to noise ratio increases. Index Terms – Closest point algorithm, sphere decoding, space-time, multiuser detection, random lattice decoding, LLL lattice reduction.
Citations
|
526
|
A Course in Computational Algebraic Number Theory. Graduate Texts
– Cohen
- 1993
|
|
459
|
Layered space-time architecture for wireless communications in a fading environment when using multiple antennas
– Foschini
- 1996
|
|
407
|
Factoring polynomials with rational coefficients
– Lenstra, Lenstra, et al.
- 1982
|
|
152
|
VBLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel
– Wolniansky, Foschini, et al.
- 1998
|
|
130
|
On Lovász’ lattice reduction and the nearest lattice point problem
– Babai
- 1986
|
|
104
|
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
– Fincke, Phost
- 1985
|
|
97
|
A universal lattice code decoder for fading channels
– Viterbo, Boutros
- 1999
|
|
66
|
Closest point search in lattices
– Agrell, Eriksson, et al.
|
|
42
|
Improved algorithms for integer programming and related problems
– Kannan
- 1983
|
|
40
|
Giannakis, “Space–time diversity systems based on linear constellation precoding
– Xin, Wang, et al.
- 2003
|
|
36
|
the expected complexity of sphere decoding
– Hassibi, Vikalo
|
|
16
|
A new reduced-complexity sphere decoder for multiple antenna systems
– Chan, Lee
- 2002
|
|
11
|
Giannakis, “Full-diversity full-rate complex-field space-time coding
– Ma, B
- 2003
|
|
8
|
Order statistics and inference: estimation methods
– Balakrishnan, Cohen
- 1991
|
|
5
|
Euclidean space lattice decoding for joint detection in CDMA systems
– Brunel, Boutros
- 1999
|
|
3
|
Branch-and-bound-based fast optimal algorithm for multiuser detection
– Luo, Pattipati, et al.
- 2003
|
|
1
|
Muirhead Aspects of Multivariate Statistical Theory
– J
- 1982
|
