TCOM
2010
13 years 11 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...
JCT
2002
14 years 19 days ago
2002
In [1], the author generalized Ehrhart's idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vert...
CORR
2010
Springer
14 years 1 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
GLOBECOM
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...