2009 IEEE International Conference on Communications 2009
DOI: 10.1109/icc.2009.5199388
|View full text |Cite
|
Sign up to set email alerts
|

Rapid Prototyping of Clarkson's Lattice Reduction for MIMO Detection

Abstract: This paper presents the field-programmable gate array (FPGA) implementation of a variant of the Lenstra-Lenstra-Lovász (LLL) lattice reduction (LR) algorithm, known as the Clarkson's Algorithm (CA), and its application to uncoded multiple input-multiple output (MIMO) detection. The CA provides practically the same performance as the LLL algorithm while having a considerably lower complexity, especially for MIMO systems with a large number of transmit and receive antennas. The algorithm has been implemented in … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
49
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(49 citation statements)
references
References 11 publications
0
49
0
Order By: Relevance
“…However this implementation only considers slower off-the-shelf FPGA components, including the use of square root and division operations that have not been optimized. The FPGA and application-specific integrated circuit (ASIC) implementation [34] claims to achieve a "fivefold improvement in terms of throughput at the cost of only slightly more FPGA resources" over [26] and [32]. This work uses CORDIC units along with a modification of the LLL algorithm by replacing the size-reduction criterion with the reverse Siegel condition.…”
Section: Existing Workmentioning
confidence: 99%
See 2 more Smart Citations
“…However this implementation only considers slower off-the-shelf FPGA components, including the use of square root and division operations that have not been optimized. The FPGA and application-specific integrated circuit (ASIC) implementation [34] claims to achieve a "fivefold improvement in terms of throughput at the cost of only slightly more FPGA resources" over [26] and [32]. This work uses CORDIC units along with a modification of the LLL algorithm by replacing the size-reduction criterion with the reverse Siegel condition.…”
Section: Existing Workmentioning
confidence: 99%
“…For this reason we are unable to provide a direct comparison of our architecture with previously published work. Nevertheless, it is still possible to compare our implementation with three state-of-the-art VLSI implementations of hard-output LRAD-based MIMO detectors [32], [26], [34].…”
Section: Comparisons With Previously Published Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Implementations that make use of LR to improve the detection performance of multiple antenna systems can be found in [3,8,13,16]. In [16], an LR-aided symbol detector for multiple-input multipleoutput (MIMO) and orthogonal frequency division multiple access (OFDMA) is implemented using 65 nm ASIC technologies.…”
Section: Introductionmentioning
confidence: 99%
“…In [16], an LR-aided symbol detector for multiple-input multipleoutput (MIMO) and orthogonal frequency division multiple access (OFDMA) is implemented using 65 nm ASIC technologies. A field-programmable gate array (FPGA) implementation of a variant of the LLL algorithm, the Clarkson's algorithm, is presented in [3], whose main benefit is the computational complexity reduction without significant performance loss in MIMO detection. More recently, [8] makes use of a Xilinx XC4VLX80-12 FPGA for implementing LR-aided detectors, whereas [13] uses an efficient VLSI design based on a pipelined architecture.…”
Section: Introductionmentioning
confidence: 99%