Sciweavers

7 search results - page 2 / 2
» Latency-constrained low-complexity lattice reduction for MIM...
Sort
View
GLOBECOM
2007
IEEE
13 years 12 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— 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...
Luay Azzam, Ender Ayanoglu
ICC
2009
IEEE
151views Communications» more  ICC 2009»
14 years 11 days ago
Improved Vector Perturbation with Modulo Loss Reduction for Multiuser Downlink Systems
— In this paper, we present an improved precoding technique which reduces a modulo loss in vector perturbation (VP) with low complexity for the downlink of a multiuser multiple-i...
Hyeon-Seung Han, Seokhwan Park, Inkyu Lee