摘要: … of authors as an efficient algorithm to solve various detection problems in digital communications. In some cases, the algorithm is referred to as an algorithm of polynomial complexity …
harvard.edu
acm.org
sci-hub.se 参考文章(17)
Babak Hassibi, Haris Vikalo, Maximum-likelihood decoding and integer least-squares: the expected complexity Multiantenna Channels: Capacity, Coding and Signal Processing. pp. 161- 191 ,(2003)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Laurence A. Wolsey, George L. Nemhauser, Integer and Combinatorial Optimization ,(1988)
U. Fincke, M. Pohst, Improved methods for calculating vectors of short length in a lattice, including a complexity analysis Mathematics of Computation. ,vol. 44, pp. 463- 471 ,(1985) , 10.1090/S0025-5718-1985-0777278-8
Haris Vikalo, Babak Hassibi, Maximum-Likelihood Sequence Detection of Multiple Antenna Systems over Dispersive Channels via Sphere Decoding EURASIP Journal on Advances in Signal Processing. ,vol. 2002, pp. 525- 531 ,(2002) , 10.1155/S1110865702204011
Babak Hassibi, Haris Vikalo, On the expected complexity of integer least-squares problems IEEE International Conference on Acoustics Speech and Signal Processing. ,vol. 2, pp. 1497- 1500 ,(2002) , 10.1109/ICASSP.2002.5744897
Sergio Verdú, Computational complexity of optimum multiuser detection Algorithmica. ,vol. 4, pp. 303- 312 ,(1989) , 10.1007/BF01553893
Sheldon M Ross, Sheldon M Ross, Sheldon M Ross, Sheldon M Ross, Etats-Unis Mathématicien, A First Course in Probability ,(1976)
O. Damen, A. Chkeif, J.-C. Belfiore, Lattice code decoder for space-time codes IEEE Communications Letters. ,vol. 4, pp. 161- 163 ,(2000) , 10.1109/4234.846498
M.O. Damen, K. Abed-Meraim, M.S. Lemdani, Further results on the sphere decoder international symposium on information theory. pp. 333- ,(2001) , 10.1109/ISIT.2001.936196