Complexity Outage Probability of MIMO Detection in Multiple-User Scenario

摘要

This letter presents the complexity study of multiple-input multiple-output (MIMO) detection in a multiple-user scenario. For variable-complexity MIMO detection in multiple-user systems, the complexity outage probability, defined as the probability of event that the complexity exceeds some complexity constraint, is proved to have a Chernoff-type upper bound that decays exponentially with an increasing number of users. The closed-form expression of such a Chernoff-type upper bound is also derived.