The Diagonal Reduction Algorithm Using Fast Givens

DOI10.1007/978-3-662-43799-5_30zbMath1369.68362OpenAlexW2103908741MaRDI QIDQ2799575

Wen Zhang, Sanzheng Qiao, Yi-Min Wei

Publication date: 12 April 2016

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43799-5_30

zbMATH Keywords

lattice reductiondiagonal reductiondual reductionMIMO detectionfast Givens

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Detection theory in information and communication theory (94A13)

Cites Work

• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• The hardness of approximate optima in lattices, codes, and systems of linear equations
• LLL Reduction Achieves the Receive Diversity in MIMO Decoding
• On the Proximity Factors of Lattice Reduction-Aided Decoding
• HKZ and Minkowski Reduction Algorithms for Lattice-Reduction-Aided MIMO Detection
• Closest point search in lattices
• On the complexity of sphere decoding in digital communications
• On the sphere-decoding algorithm I. Expected complexity

This page was built for publication: The Diagonal Reduction Algorithm Using Fast Givens