Sciweavers

4 search results - page 1 / 1
» Sphere Decoding With a Probabilistic Tree Pruning
Sort
View
TSP
2008
99views more  TSP 2008»
13 years 7 months ago
Sphere Decoding With a Probabilistic Tree Pruning
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...
Byonghyo Shim, Insung Kang
TCOM
2010
112views more  TCOM 2010»
13 years 5 months ago
On further reduction of complexity in tree pruning based sphere search
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...
Byonghyo Shim, Insung Kang
ICC
2007
IEEE
14 years 1 months ago
Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems
Abstract— We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for...
Tao Cui, Tracey Ho, Chintha Tellambura
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
Infinity-Norm Sphere-Decoding
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...
Dominik Seethaler, Helmut Bölcskei