11 search results - page 1 / 3 » On the Complexity of Decoding Lattices Using the Korkin-Zolo... |
TIT
1998
13 years 4 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
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
2010
Springer
13 years 4 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...
ICC
2007
IEEE
13 years 11 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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Lattice reduction-aided decoding enables significant complexity saving and near-optimum performance in multi-input multi-output (MIMO) communications. However, its remarkable perfo...