Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection

DOI10.1109/TSP.2009.2016267MaRDI QIDQ4569756zbMATH OpenOpenAlexFDO

Authors Ying Hung Gan, Cong Ling, Wai Ho Mow

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

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(12)

• Volumes and distributions for random unimodular complex and quaternion lattices
• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
• Worst-case to average-case reductions for module lattices
• Multilevel lattices for compute-and-forward and lattice network coding
• Reducing number field defining polynomials: an application to class group computations
• scientific article; zbMATH DE number 6719506 (Why is no real title available?)
• Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection
• Improved Lattice Reduction-Aided MIMO Successive Interference Cancellation Under Imperfect Channel Estimation
• Exploration of Lattice Reduction Aided Soft-Output MIMO Detection on a DLP/ILP Baseband Processor
• Short bases of lattices over number fields
• On the reduction of a random basis
• Lattice-basis reduction precoding based on successive interference cancellation design for multiuser MIMO downlink system

This page was built for publication: Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569756)