Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection (Q415838)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6032016
Language Label Description Also known as
default for all languages
No label defined
    English
    Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection
    scientific article; zbMATH DE number 6032016

      Statements

      Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection (English)
      0 references
      0 references
      0 references
      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

      Identifiers