Using Random Duality Theory, the paper argues that the CLuP algorithm reaches near-optimal MIMO ML detection in a small, dimension-independent number of quadratic-programming iterations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Complexity analysis of the Controlled Loosening-up (CLuP) algorithm
Using Random Duality Theory, the paper argues that the CLuP algorithm reaches near-optimal MIMO ML detection in a small, dimension-independent number of quadratic-programming iterations.