The Limiting Poisson Law of Massive MIMO Detection with Box Relaxation
arXiv:2006.08416
Abstract
Estimating a binary vector from noisy linear measurements is a prototypical problem for MIMO systems. A popular algorithm, called the box-relaxation decoder, estimates the target signal by solving a least squares problem with convex constraints. This paper shows that the performance of the algorithm, measured by the number of incorrectly-decoded bits, has a limiting Poisson law. This occurs when the sampling ratio and noise variance, two key parameters of the problem, follow certain scalings as the system dimension grows. Moreover, at a well-defined threshold, the probability of perfect recovery is shown to undergo a phase transition that can be characterized by the Gumbel distribution. Numerical simulations corroborate these theoretical predictions, showing that they match the actual performance of the algorithm even in moderate system dimensions.
References in corpus (9)
- Message Passing Algorithms for Compressed Sensing
- Statistical physics of inference: Thresholds and algorithms
- A framework to characterize performance of LASSO algorithms
- Symbol Error Rate Performance of Box-relaxation Decoders in Massive MIMO
- Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems: an Analysis of Stationary Distribution and Mixing Time
- 0-1 phase transitions in sparse spiked matrix estimation
- Optimality of Large MIMO Detection via Approximate Message Passing
- The Cavity Approach to Noisy Learning in Nonlinear Perceptrons
- The cavity method for analysis of large-scale penalized regression