4 search results - page 1 / 1 » Reduced Complexity Sphere Decoding for Square QAM via a New ... |
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...
GLOBECOM
2008
IEEE
13 years 4 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
ICC
2007
IEEE
13 years 10 months ago
2007
IEEE
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...