Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection (Q415838): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6032016 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58908726 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/876380 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088446780 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references