English

Ising Machines' Dynamics and Regularization for Near-Optimal Large and Massive MIMO Detection

Networking and Internet Architecture 2024-09-06 v4 Information Theory math.IT

Abstract

Optimal MIMO detection has been one of the most challenging and computationally inefficient tasks in wireless systems. We show that the new analog computing techniques like Coherent Ising Machines (CIM) are promising candidates for performing near-optimal MIMO detection. We propose a novel regularized Ising formulation for MIMO detection that mitigates a common error floor problem and further evolves it into an algorithm that achieves near-optimal MIMO detection. Massive MIMO systems, that have a large number of antennas at the Access point (AP), allow linear detectors to be near-optimal. However, the simplified detection in these systems comes at the cost of overall throughput, which could be improved by supporting more users. By means of numerical simulations, we show that in principle a MIMO detector based on a hybrid use of a CIM would allow us to add more transmitter antennas/users and increase the overall throughput of the cell by a significant factor. This would open up the opportunity to operate using more aggressive modulation and coding schemes and hence achieve high throughput: for a 16×1616\times16 large MIMO system, we estimate around 2.5×\times more throughput in mid-SNR regime (12dB\approx 12 dB) and 2×\times more throughput in high-SNR regime( >> 20dB) than the industry standard, Minimum-Mean Square Error decoding (MMSE).

Keywords

Cite

@article{arxiv.2105.10535,
  title  = {Ising Machines' Dynamics and Regularization for Near-Optimal Large and Massive MIMO Detection},
  author = {Abhishek Kumar Singh and Kyle Jamieson and Davide Venturelli and Peter McMahon},
  journal= {arXiv preprint arXiv:2105.10535},
  year   = {2024}
}

Comments

Accepted for IEEE Transactions on Wireless Communication

R2 v1 2026-06-24T02:21:23.453Z