Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
From MaRDI portal
Publication:4569756
DOI10.1109/TSP.2009.2016267zbMath1391.94513OpenAlexW2167709639MaRDI QIDQ4569756
Ying Hung Gan, Wai Ho Mow, Cong Ling
Publication date: 9 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2009.2016267
Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)
Related Items
Multilevel lattices for compute-and-forward and lattice network coding ⋮ Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection ⋮ Reducing number field defining polynomials: an application to class group computations ⋮ Volumes and distributions for random unimodular complex and quaternion lattices ⋮ Short Bases of Lattices over Number Fields ⋮ On the reduction of a random basis ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Worst-case to average-case reductions for module lattices
This page was built for publication: Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
