Sciweavers

4 search results - page 1 / 1
» Worst- and average-case complexity of LLL lattice reduction ...
Sort
View
ICASSP
2008
IEEE
13 years 11 months ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz
CORR
2006
Springer
156views Education» more  CORR 2006»
13 years 4 months ago
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
Ying Hung Gan, Cong Ling, Wai Ho Mow
DATE
2009
IEEE
156views Hardware» more  DATE 2009»
13 years 11 months ago
Implementation of a reduced-lattice MIMO detector for OFDM Systems
—This paper presents a novel VLSI implementation of a MIMO detector for OFDM systems. The proposed architecture is able to perform both linear MMSE and reduced latticeaided MIMO ...
Josep Soler Garrido, Henning Vetter, Magnus Sandel...
ICC
2009
IEEE
145views Communications» more  ICC 2009»
13 years 11 months ago
Rapid Prototyping of Clarkson's Lattice Reduction for MIMO Detection
—This paper presents the field-programmable gate array (FPGA) implementation of a variant of the LenstraLenstra-Lov´asz (LLL) lattice reduction (LR) algorithm, known as the Cla...
Luis G. Barbero, David L. Milliner, Tharmalingam R...