Papers
Topics
Authors
Recent
Search
2000 character limit reached

Controlled Loosening-up (CLuP) -- achieving exact MIMO ML in polynomial time

Published 3 Sep 2019 in cs.IT, math.IT, math.ST, and stat.TH | (1909.01175v1)

Abstract: In this paper we attack one of the most fundamental signal processing/informaton theory problems, widely known as the MIMO ML-detection. We introduce a powerful Random Duality Theory (RDT) mechanism that we refer to as the Controlled Loosening-up (CLuP) as a way of achieving the exact ML-performance in MIMO systems in polynomial time. We first outline the general strategy and then discuss the rationale behind the entire concept. A solid collection of results obtained through numerical experiments is presented as well and found to be in an excellent agreement with what the theory predicts. As this is the introductory paper of a massively general concept that we have developed, we mainly focus on keeping things as simple as possible and put the emphasis on the most fundamental ideas. In our several companion papers we present various other complementary results that relate to both, theoretical and practical aspects and their connections to a large collection of other problems and results that we have achieved over the years in Random Duality.

Citations (7)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.