Perturbation-based Formulation of Maximum Likelihood MIMO Detection for Coherent Ising Machines

Abhishek Kumar Singh, Davide Venturelli, Kyle Jamieson

Research output: Contribution to journalConference articlepeer-review


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 × 16 and 16 × 32, and sustain its performance gain even at 256-QAM modulation. We further perform a spectral efficiency analysis and show that, for a 16 × 16 MIMO with Adaptive Modulation and Coding, our method can provide substantial throughput gains over MMSE, achieving 2× throughput for SNR ≤ 25 dB, and up to 1.5× throughput for SNR ≥ 30 dB.

Original languageEnglish (US)
Pages (from-to)2523-2528
Number of pages6
JournalProceedings - IEEE Global Communications Conference, GLOBECOM
StatePublished - 2022
Event2022 IEEE Global Communications Conference, GLOBECOM 2022 - Virtual, Online, Brazil
Duration: Dec 4 2022Dec 8 2022

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Signal Processing


  • Coherent Ising machines
  • Large MIMO
  • Massive MIMO
  • MIMO detection


Dive into the research topics of 'Perturbation-based Formulation of Maximum Likelihood MIMO Detection for Coherent Ising Machines'. Together they form a unique fingerprint.

Cite this