7 search results - page 1 / 2 » Radius selection algorithms for sphere decoding |
C3S2E
2009
ACM
13 years 11 months ago
2009
ACM
The integer least squares problem arises from many applications such as communications, cryptography, and GPS. In this paper, we consider the sphere decoding method in communicati...
C3S2E
2008
ACM
13 years 6 months ago
2008
ACM
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...
TCOM
2010
13 years 2 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
SIPS
2007
IEEE
13 years 10 months ago
2007
IEEE
Motivated by the need for high throughput sphere decoding for multipleinput-multiple-output (MIMO) communication systems, we propose a parallel depth-first sphere decoding (PDSD)...