Integer least squares: sphere decoding and the LLL algorithm

This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss the sphere decoding method in communications. One of the key issues in sphere decoding is the determination of the radius of search sphere. We propose a deterministic method for finding a radius of search sphere. Also, we investigate the impact of the LLL algorithm on the computational complexity of the sphere decoding method. Categories and Subject Descriptors

• Type: Conference
• Year: 2008
• Where: C3S2E
• Authors: Sanzheng Qiao
• Keywords: C3S2E 2008, Search Sphere, Software Engineering, Sphere Decoding, Sphere Decoding Method