Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection (Q415838): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Closest point search in lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factoring polynomials with rational coefficients / rank | |||
Normal rank |
Latest revision as of 04:46, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection |
scientific article |
Statements
Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection (English)
0 references
9 May 2012
0 references
Summary: We propose a loop-reduction LLL (LR-LLL) algorithm for lattice-reduction-aided (LRA) multi-input multioutput (MIMO) detection. The LLL algorithm is an iterative algorithm that contains many check and process operations; however, the traditional LLL algorithm itself possesses a lot of redundant check operations. To solve this problem, we propose a look-ahead check technique that not only reduces the complexity of the LLL algorithm but also produces the lattice-reduced matrix which obeys the original LLL criterion. Simulation results show that the proposed LR-LLL algorithm reduces the average number of loops or computation complexity. Besides, it also shortens the latency of \textit{clock cycles} about 19.4\%, 29.1\%, and 46.1\% for \(4 \times 4, 8 \times 8\), and \(12 \times 12\) MIMO systems, respectively.
0 references