28 search results - page 4 / 6 » An Efficient Tree Search for Reduced Complexity Sphere Decod... |
GLOBECOM
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper introduces a new framework of the multiple-input multiple-output (MIMO) detection in iterative receivers. Unlike the conventional methods processing with symbol lattice,...
102
click to vote
WCNC
2008
IEEE
15 years 6 months ago
2008
IEEE
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
CORR
2010
Springer
14 years 11 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
2006
IEEE
15 years 5 months ago
2006
IEEE
—Design of space-time codes that scale with the number of transmit antennas is a difficult problem. In this paper, we introduce a new family of space-time trellis codes (STTC) th...
100
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
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...