1 |
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.463-471, Apr. 1985.
DOI
ScienceOn
|
2 |
B. Hassibi and H. Vikalo "On sphere decoding algorithm. I. Expected complexity," IEEE Trans. Signal Process., Vol.53, pp.2806, Aug. 2005.
|
3 |
C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programming, Vol.66, pp.181-191, 1994.
DOI
ScienceOn
|
4 |
A. Paulraj, R. Nabar, and D. Gore, Introduction to Space-Time Wireless Communications New York: Cambridge Univ. Press, 2003.
|
5 |
P. Wolniansky, G. Foschini, G. Golden, and R. Valenzuela, "V-BLAST: An architecture for realizing very high data rates over the rich scattering wireless channel," in Proc. ISSSE, Sept. 1998.
|
6 |
E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, Vol.45, No.5, pp.1639-1642, Jul. 1999.
DOI
ScienceOn
|
7 |
A. M. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antenna systems," in IEEE Int. Conf. Communications, Vol.1, 2002, pp.460-464.
|