The diagonal reduction algorithm using fast Givens
From MaRDI portal
Recommendations
Cites work
- Closest point search in lattices
- Factoring polynomials with rational coefficients
- HKZ and Minkowski Reduction Algorithms for Lattice-Reduction-Aided MIMO Detection
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- LLL Reduction Achieves the Receive Diversity in MIMO Decoding
- On Lovász' lattice reduction and the nearest lattice point problem
- On the complexity of sphere decoding in digital communications
- On the Proximity Factors of Lattice Reduction-Aided Decoding
- On the sphere-decoding algorithm I. Expected complexity
- The hardness of approximate optima in lattices, codes, and systems of linear equations
Cited in
(5)- Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection
- Fast multiple-antenna differential decoding
- scientific article; zbMATH DE number 799774 (Why is no real title available?)
- Lattice-reduction-aided and integer-forcing equalization
- Acceleration of the Two-Level MGRIT Algorithm via the Diagonalization Technique
This page was built for publication: The diagonal reduction algorithm using fast Givens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799575)