A Finite-Range Search Formulation of Maximum Likelihood MIMO Detection for Coherent Ising Machines

Abstract

The last couple of years have seen an emergence of physics-inspired computing for maximum likelihood MIMO detection. These methods involve transforming the MIMO detection problem into an Ising minimization problem, which can then be solved on an Ising Machine. Recent works have shown promising projections for MIMO wireless detection using Quantum Annealing optimizers and Coherent Ising Machines. While these methods perform very well for BPSK and 4-QAM, they struggle to provide good BER for 16-QAM and higher modulations. In this paper, we explore an enhanced CIM model, and propose a novel Ising formulation, which together are shown to be the first Ising solver that provides significant gains in the BER performance of large and massive MIMO systems, like $16\times 16$ and $16\times 32$, and sustain its performance gain even at 256-QAM modulation. We further perform a spectral efficiency analysis and show that, for a $16\times 16$ MIMO with Adaptive Modulation and Coding, our method can provide substantial throughput gains over MMSE, achieving $2\times$ throughput for SNR $\le 25$ dB, and up to $1.5\times$ throughput for SNR $\ge 30$ dB.

Article under review for IEEE Globecom 2022

References in corpus (5)

• Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine
• Intrinsic optimization using stochastic nanomagnets
• Leveraging Quantum Annealing for Large MIMO Processing in Centralized Radio Access Networks
• Physics-Inspired Heuristics for Soft MIMO Detection in 5G New Radio and Beyond
• Towards Hybrid Classical-Quantum Computation Structures in Wirelessly-Networked Systems

Cited by in corpus (1)

• Uplink MIMO Detection using Ising Machines: A Multi-Stage Ising Approach