7 search results - page 1 / 2 » On further reduction of complexity in tree pruning based sph... |
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...
TSP
2008
13 years 4 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
TSP
2010
12 years 11 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...