pith. machine review for the scientific record. sign in

arxiv: 2605.07884 · v2 · submitted 2026-05-08 · 💻 cs.IT · cond-mat.other· math.IT

Recognition: no theorem link

Physics-Inspired Probabilistic Computing for Extremely Large-Scale MIMO Detection in Future 6G Wireless Systems

Andrea Grimaldi , Christian Duffee , Eleonora Raimondo , Edoardo Piccolo , Deborah Volpe , Filip B. Maciejewski , Mario Carpentieri , Massimo Chiappini
show 3 more authors
Pedram Khalili Amiri Davide Venturelli Giovanni Finocchio
Authors on Pith no claims yet

Pith reviewed 2026-05-12 03:49 UTC · model grok-4.3

classification 💻 cs.IT cond-mat.othermath.IT
keywords MIMO detectionIsing machines6G wirelessmaximum likelihood detectionprobabilistic computingXL-MIMOsignal detection
0
0 comments X

The pith

Physics-inspired Ising machines achieve optimal maximum-likelihood detection for MIMO systems with up to 2048 antennas in only 100 iterations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper demonstrates that reformulating MIMO signal detection as an Ising optimization problem lets probabilistic and oscillator-based machines solve the maximum-likelihood task at scales far beyond conventional algorithms. For binary modulation the machines reach the best possible performance on 2048 by 2048 antenna arrays while beating the industrial MMSE detector. A generalized version using d-dimensional probabilistic variables handles up to 256-QAM constellations on 256 by 256 arrays with low error rates and reduced complexity. The interaction matrix stays independent of modulation order, which supports adaptive rate selection. These results point to a practical route for the massive spatial multiplexing planned in 6G networks.

Core claim

Probabilistic Ising machines and oscillator-based implementations achieve optimal maximum-likelihood detection for binary modulation in up to 2048x2048 antenna MIMO systems using only 100 iterations, matching sphere decoder results where computable and outperforming MMSE. A generalized framework for M-QAM up to 256 uses d-dimensional probabilistic variables to encode symbols directly, delivering low bit-error rates in 256x256 systems with complexity independent of modulation order.

What carries the argument

The mapping of MIMO maximum-likelihood detection to an Ising spin optimization problem solved by probabilistic Ising machines or oscillator-based variants, extended via d-dimensional p-dits that directly represent QAM constellation points.

Load-bearing premise

Mapping the MIMO detection problem to an Ising optimization problem incurs negligible approximation error and the machines accurately solve the model at the large scales claimed.

What would settle it

A direct comparison of bit error rates between the Ising machine output and the true optimal solution computed by a sphere decoder on a 64 by 64 MIMO system with 16-QAM to check for any performance gap beyond statistical variation.

read the original abstract

Extremely large-scale multiple-input multiple-output (XL-MIMO) architectures are a key enabler of forthcoming 6G wireless communication networks by allowing high data rates through massive spatial multiplexing. Here, we approach these problems with physics-inspired unconventional computing based on Ising machines (IMs). For binary modulation, probabilistic IMs (PIMs) and oscillator-based IMs achieve optimal ML detection with systems up to 2048x2048 antennas with only 100 iterations, matching optimal sphere decoder performance for computationally treatable sizes and outperforming the minimum mean-square error (MMSE) industrial standard. For M-QAM up to 256, a generalized PIM-inspired framework, based on d-dimensional probabilistic variables (p-dits) that directly encode QAM symbols, shows low bit-error-rate across sizes up to 256x256 antennas, outperforming or matching MMSE with reduced algorithmic complexity. Unlike the binary mapping, the p-dit interaction matrix is independent of the QAM order, enabling adaptive MIMO modulation. These results show a promising scalable paradigm for XL MIMO detection in future 6G networks.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 3 minor

Summary. The paper claims that physics-inspired Ising machines (probabilistic IMs and oscillator-based IMs) achieve optimal maximum-likelihood detection for binary-modulated XL-MIMO up to 2048×2048 antennas in only 100 iterations, matching sphere-decoder performance on computationally feasible sizes and outperforming MMSE. For M-QAM up to 256, it introduces a generalized framework using d-dimensional probabilistic variables (p-dits) that directly encode symbols, reporting low BER up to 256×256 antennas with reduced complexity; the p-dit interaction matrix is independent of QAM order, enabling adaptive modulation.

Significance. If the central performance claims hold under rigorous verification, the work would be significant for 6G wireless systems by demonstrating a scalable, hardware-inspired alternative to exponential-complexity ML detection in XL-MIMO. The fixed-iteration, parameter-light approach and QAM-order-independent mapping could enable practical deployment where conventional digital algorithms become intractable, provided the mapping to Ising/QUBO form remains exact and the solver dynamics reliably reach global optima at extreme scales.

major comments (3)
  1. [Abstract] Abstract and results on binary modulation: the assertion of optimal ML detection for 2048×2048 systems with 100 iterations is load-bearing for the central claim but supported only by matching sphere-decoder BER on smaller treatable sizes; no scaling analysis, success-probability bound, or landscape characterization is supplied to justify that the fraction of trials reaching the true ML vector remains high as N grows and local minima proliferate.
  2. [Generalized PIM-inspired framework] P-dit framework description: the claim that the interaction matrix is independent of QAM order and that the formulation enables exact ML detection requires an explicit derivation showing how the MIMO objective ||y−Hx||² is mapped to the p-dit energy function without approximation error; the current presentation leaves open whether higher-order QAM introduces bias or whether optimality is preserved.
  3. [Simulation results] Simulation results: reported BER curves and complexity comparisons lack Monte-Carlo trial counts, channel realization statistics, SNR ranges, and error bars, preventing assessment of whether the outperformance over MMSE is statistically robust or sensitive to particular channel conditions.
minor comments (3)
  1. [Introduction] The definition and dimensionality of p-dits are introduced without a self-contained mathematical specification early in the manuscript, forcing readers to reconstruct the variable encoding from later equations.
  2. [Figures] Figure captions for BER vs. SNR plots should explicitly state the antenna configuration (e.g., 2048×2048), modulation order, and number of iterations used for each curve.
  3. [Related work] The manuscript would benefit from a brief comparison to other recent low-complexity MIMO detectors (e.g., approximate message passing or learned iterative methods) in addition to MMSE and sphere decoder.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments and the recommendation for major revision. We address each major comment point by point below, providing clarifications from the manuscript and indicating where revisions will be made to strengthen the presentation.

read point-by-point responses

  1. Referee: [Abstract] Abstract and results on binary modulation: the assertion of optimal ML detection for 2048×2048 systems with 100 iterations is load-bearing for the central claim but supported only by matching sphere-decoder BER on smaller treatable sizes; no scaling analysis, success-probability bound, or landscape characterization is supplied to justify that the fraction of trials reaching the true ML vector remains high as N grows and local minima proliferate.

    Authors: We acknowledge that the optimality claim for 2048×2048 relies on empirical matching with the sphere decoder on computationally feasible sizes and consistent outperformance of MMSE at larger scales. The manuscript does not include a formal scaling analysis or success-probability bound. In the revised version we will add a dedicated discussion of the MIMO detection energy landscape under probabilistic dynamics, together with additional simulation results showing success rate versus system size, to better support the extrapolation while remaining within the fixed-iteration regime. revision: yes

  2. Referee: [Generalized PIM-inspired framework] P-dit framework description: the claim that the interaction matrix is independent of QAM order and that the formulation enables exact ML detection requires an explicit derivation showing how the MIMO objective ||y−Hx||² is mapped to the p-dit energy function without approximation error; the current presentation leaves open whether higher-order QAM introduces bias or whether optimality is preserved.

    Authors: We will insert an explicit derivation in the revised manuscript that starts from the MIMO ML objective ||y − Hx||², shows the exact encoding of each QAM symbol into a d-dimensional p-dit, and arrives at the corresponding quadratic energy function. The derivation confirms that the mapping is exact (no approximation) for any QAM order and that the interaction matrix is indeed independent of the constellation size. revision: yes

  3. Referee: [Simulation results] Simulation results: reported BER curves and complexity comparisons lack Monte-Carlo trial counts, channel realization statistics, SNR ranges, and error bars, preventing assessment of whether the outperformance over MMSE is statistically robust or sensitive to particular channel conditions.

    Authors: We agree that the statistical details are insufficient. The revised manuscript will report the exact number of Monte-Carlo trials per BER point, the number of independent channel realizations, the complete SNR range examined, and error bars on all BER curves to allow readers to evaluate robustness. revision: yes

Circularity Check

0 steps flagged

No circularity; claims benchmarked against independent external solvers

full rationale

The paper maps MIMO detection to an Ising/QUBO form (exact for binary modulation) and a p-dit generalization for M-QAM, then reports empirical performance of PIMs and oscillator IMs. It explicitly compares results to the sphere decoder on computationally tractable sizes and to the MMSE baseline on larger instances, without any fitted parameter being relabeled as a prediction, without self-citation load-bearing the optimality claim, and without any ansatz or uniqueness theorem imported from the authors' prior work. The derivation chain therefore remains self-contained against external benchmarks rather than reducing to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Central claim rests on accurate reduction of MIMO ML detection to an Ising energy minimization problem and on the empirical performance of the resulting solver; these are not derived from first principles in the abstract.

axioms (1)
  • domain assumption MIMO maximum-likelihood detection can be exactly or approximately cast as finding the ground state of an Ising Hamiltonian.
    This mapping is the foundational step for all physics-inspired claims.
invented entities (1)
  • p-dits (d-dimensional probabilistic variables) no independent evidence
    purpose: Directly represent M-QAM constellation points inside the probabilistic computing framework.
    New variable type introduced to handle higher-order modulation without changing the interaction matrix.

pith-pipeline@v0.9.0 · 5544 in / 1346 out tokens · 43943 ms · 2026-05-12T03:49:25.574444+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

41 extracted references · 41 canonical work pages

  1. [1]

    A Tutorial on Extremely Large -Scale MIMO for 6G: Fundamentals, Signal Processing, and Applications,

    Z. Wang et al. , “A Tutorial on Extremely Large -Scale MIMO for 6G: Fundamentals, Signal Processing, and Applications, ” IEEE Commun. Surv. Tutorials , vol. 26, no. 3, pp. 1560 –1605, 2024, doi: 10.1109/COMST.2023.3349276

    work page doi:10.1109/comst.2023.3349276 2024

  2. [2]

    Parvini, B

    M. Parvini, B. Banerjee, M. Q. Khan, T. Mewes, A. Nimr, and G. Fettweis, “A Tutorial on Wideband XL -MIMO: Challenges, Opportunities, and Future Trends, ” IEEE Open J. Commun. Soc. , vol. 6, pp. 5509–5534, 2025, doi: 10.1109/OJCOMS.2025.3583091

    work page doi:10.1109/ojcoms.2025.3583091 2025

  3. [3]

    Design of machine learning optimized THz MIMO antenna for next -generation wireless communication systems,

    S. K. Patel, A. Baz, and D. Agravat, “Design of machine learning optimized THz MIMO antenna for next -generation wireless communication systems,” Ain Shams Eng. J. , vol. 16, no. 6, p. 103384, May 2025, doi: 10.1016/j.asej.2025.103384

    work page doi:10.1016/j.asej.2025.103384 2025

  4. [4]

    Performance Analysis for Extremely Large -Scale MIMO Communication Systems,

    Y. Le et al. , “Performance Analysis for Extremely Large -Scale MIMO Communication Systems,” IEEE Commun. Lett. , vol. 30, pp. 917 –921, 2026, doi: 10.1109/LCOMM.2026.3654136

    work page doi:10.1109/lcomm.2026.3654136 2026

  5. [5]

    Latent Space Alignment for AI -Native MIMO Semantic Communications,

    M. E. Pandolfo, S. Fiorellino, E. C. Strinati, and P. Di Lorenzo, “Latent Space Alignment for AI -Native MIMO Semantic Communications, ” in 2025 International Joint Conference on Neural Networks (IJCNN) , Jun. 2025, pp. 1–8, doi: 10.1109/IJCNN64981.2025.11228893

    work page doi:10.1109/ijcnn64981.2025.11228893 2025

  6. [6]

    Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis,

    U. Fincke and M. Pohst, “Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis, ” Math. Comput., vol. 44, no. 170, p. 463, Apr. 1985, doi: 10.2307/2007966

    work page doi:10.2307/2007966 1985

  7. [7]

    A universal lattice code decoder for fading channels,

    E. Viterbo and J. Bouros, “A universal lattice code decoder for fading channels,” IEEE Trans. Inf. Theory , vol. 45, no. 5, pp. 1639 –1642, Jul. 1999, doi: 10.1109/18.771234

    work page doi:10.1109/18.771234 1999

  8. [8]

    Wiener, Extrapolation, Interpolation, and Smoothing of Stationary Time Series

    N. Wiener, Extrapolation, Interpolation, and Smoothing of Stationary Time Series. London, England: The MIT Press, 1949

    work page 1949

  9. [9]

    Massive MIMO Detection Techniques: A Survey,

    M. A. Albreem, M. Juntti, and S. Shahabuddin, “Massive MIMO Detection Techniques: A Survey, ” IEEE Commun. Surv. Tutorials , vol. 21, no. 4, pp. 3109–3132, 2019, doi: 10.1109/COMST.2019.2935810

    work page doi:10.1109/comst.2019.2935810 2019

  10. [10]

    Flexible MIMO for Future Wireless Communications: Which Flexibilities Are Possible?,

    Z. Wang, J. Zhang, B. Xu, W. Yi, E. Bj örnson, and B. Ai, “Flexible MIMO for Future Wireless Communications: Which Flexibilities Are Possible?,” IEEE Wirel. Commun. , vol. 33, no. 1, pp. 181 –190, Feb. 2026, doi: 10.1109/MWC.2025.3631583

    work page doi:10.1109/mwc.2025.3631583 2026

  11. [11]

    MMGaP: Multi -User MIMO Detection and Precoding using GPU-assisted Physics-inspired Computation,

    A. K. Singh and K. Jamieson, “MMGaP: Multi -User MIMO Detection and Precoding using GPU-assisted Physics-inspired Computation,” arXiv, Oct. 2025

    work page 2025

  12. [12]

    X- ResQ: Parallel Reverse Annealing for Quantum Maximum -Likelihood MIMO Detection with Flexible Parallelism,

    M. Kim, A. K. Singh, D. Venturelli, J. Kaewell, and K. Jamieson, “X- ResQ: Parallel Reverse Annealing for Quantum Maximum -Likelihood MIMO Detection with Flexible Parallelism, ” in Proceedings of the 31st Annual International Conference on Mobile Computing and Networking , Nov. 2025, pp. 604–619, doi: 10.1145/3680207.3723495

    work page doi:10.1145/3680207.3723495 2025

  13. [13]

    Deep Unfolded Simulated Bifurcation for Massive MIMO Signal Detection,

    S. Takabe, “Deep Unfolded Simulated Bifurcation for Massive MIMO Signal Detection, ” IEICE Trans. Fundam. Electron. Commun. Comput. Sci., p. 2025TAP0001, 2025, doi: 10.1587/transfun.2025TAP0001

    work page doi:10.1587/transfun.2025tap0001 2025

  14. [14]

    Uplink MIMO Detection Using Ising Machines: A Multi - Stage Ising Approach,

    A. K. Singh, A. Kapelyan, M. Kim, D. Venturelli, P. L. McMahon, and K. Jamieson, “Uplink MIMO Detection Using Ising Machines: A Multi - Stage Ising Approach,” IEEE Trans. Wirel. Commun., vol. 23, no. 11, pp. 17037–17053, Nov. 2024, doi: 10.1109/TWC.2024.3450190

    work page doi:10.1109/twc.2024.3450190 2024

  15. [15]

    URLhttps://doi.org/10.1109/ICCAD57390.2023.10323812

    S. Sreedhara, J. Roychowdhury, J. Wabnig, and P. K. Srinath, “MU- MIMO Detection Using Oscillator Ising Machines, ” in 2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD) , Oct. 2023, pp. 1–9, doi: 10.1109/ICCAD57390.2023.10323680

    work page doi:10.1109/iccad57390.2023.10323680 2023

  16. [16]

    Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering,

    M. M. H. Sajeeb, C. Delacour, K. Callahan-Coray, S. Seshan, T. Srimani, and K. Y. Camsari, “Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering,” arXiv, Jan. 2026

    work page 2026

  17. [17]

    Entropic barriers as a reason for hardness in both classical and quantum algorithms,

    M. Bellitti, F. Ricci -Tersenghi, and A. Scardicchio, “Entropic barriers as a reason for hardness in both classical and quantum algorithms, ” Phys. Rev. Res. , vol. 3, no. 4, p. 043015, Oct. 2021, doi: 10.1103/PhysRevResearch.3.043015

    work page doi:10.1103/physrevresearch.3.043015 2021

  18. [18]

    Limits and Performances of Algorithms Based on Simulated Annealing in Solving Sparse Hard Inference Problems,

    M. C. Angelini and F. Ricci -Tersenghi, “Limits and Performances of Algorithms Based on Simulated Annealing in Solving Sparse Hard Inference Problems,” Phys. Rev. X, vol. 13, no. 2, p. 021011, Apr. 2023, doi: 10.1103/PhysRevX.13.021011

    work page doi:10.1103/physrevx.13.021011 2023

  19. [19]

    P-dits: Probabilistic d -dimensional bits for extended - variable probabilistic computing,

    C. Duffee et al. , “P-dits: Probabilistic d -dimensional bits for extended - variable probabilistic computing, ” Phys. Rev. Appl. , vol. 24, no. 4, p. 044077, Oct. 2025, doi: 10.1103/4ngx-cmz7

    work page doi:10.1103/4ngx-cmz7 2025

  20. [20]

    The overlap gap property: A topological barrier to optimizing over random structures,

    D. Gamarnik, “The overlap gap property: A topological barrier to optimizing over random structures, ” Proc. Natl. Acad. Sci. , vol. 118, no. 41, Oct. 2021, doi: 10.1073/pnas.2108492118

    work page doi:10.1073/pnas.2108492118 2021

  21. [21]

    Proakis and M

    J. Proakis and M. Salehi, Digital Communications, 5th ed. Maidenhead, England: McGraw Hill Higher Education, 2008

    work page 2008

  22. [22]

    Gray Coding for Multilevel Constellations in Gaussian Noise,

    E. Agrell, J. Lassing, E. G. Strm, and T. Ottosson, “Gray Coding for Multilevel Constellations in Gaussian Noise, ” IEEE Trans. Inf. Theory , vol. 53, no. 1, pp. 224–235, Jan. 2007, doi: 10.1109/TIT.2006.887070

    work page doi:10.1109/tit.2006.887070 2007

  23. [23]

    Tse and P

    D. Tse and P. Viswanath, Fundamentals of Wireless Communication . New York, NY, USA: Cambridge University Press, 2005

    work page 2005

  24. [24]

    Ising machines as hardware solvers of combinatorial optimization problems,

    N. Mohseni, P. L. McMahon, and T. Byrnes, “Ising machines as hardware solvers of combinatorial optimization problems, ” Nat. Rev. Phys., vol. 4, no. 6, pp. 363–379, May 2022, doi: 10.1038/s42254-022-00440-8

    work page doi:10.1038/s42254-022-00440-8 2022

  25. [25]

    Stochastic p-Bits for Invertible Logic,

    K. Y. Camsari, R. Faria, B. M. Sutton, and S. Datta, “Stochastic p-Bits for Invertible Logic, ” Phys. Rev. X , vol. 7, no. 3, p. 031014, Jul. 2017, doi: 10.1103/PhysRevX.7.031014

    work page doi:10.1103/physrevx.7.031014 2017

  26. [26]

    A Full -Stack View of Probabilistic Computing With p -Bits: Devices, Architectures, and Algorithms,

    S. Chowdhury et al. , “A Full -Stack View of Probabilistic Computing With p -Bits: Devices, Architectures, and Algorithms, ” IEEE J. Explor. Solid-State Comput. Devices Circuits , vol. 9, no. 1, pp. 1 –11, Jun. 2023, doi: 10.1109/JXCDC.2023.3256981

    work page doi:10.1109/jxcdc.2023.3256981 2023

  27. [27]

    High-Performance and Reliable Probabilistic Ising Machine Based on Simulated Quantum Annealing,

    E. Raimondo et al., “High-Performance and Reliable Probabilistic Ising Machine Based on Simulated Quantum Annealing,” Phys. Rev. X, vol. 15, no. 4, p. 041001, Oct. 2025, doi: 10.1103/pcmz-w776

    work page doi:10.1103/pcmz-w776 2025

  28. [28]

    Scalable connectivity for Ising machines: Dense to sparse,

    M. M. H. Sajeeb et al., “Scalable connectivity for Ising machines: Dense to sparse, ” Phys. Rev. Appl. , vol. 24, no. 1, p. 014005, Jul. 2025, doi: 10.1103/kx8m-5h3h

    work page doi:10.1103/kx8m-5h3h 2025

  29. [29]

    Self-entrainment of a population of coupled non -linear oscillators,

    Y. Kuramoto, “Self-entrainment of a population of coupled non -linear oscillators,” in International Symposium on Mathematical Problems in Theoretical Physics , no. 02, Berlin/Heidelberg: Springer -Verlag, 2004, pp. 420–422

    work page 2004

  30. [30]

    Solving combinatorial optimisation problems using oscillator based Ising machines,

    T. Wang, L. Wu, P. Nobel, and J. Roychowdhury, “Solving combinatorial optimisation problems using oscillator based Ising machines, ” Nat. Comput., vol. 20, no. 2, pp. 287 –306, Jun. 2021, doi: 10.1007/s11047 - 021-09845-3

    work page doi:10.1007/s11047 2021

  31. [31]

    Evaluating Spintronics-Compatible Implementations of Ising Machines,

    A. Grimaldi et al., “Evaluating Spintronics-Compatible Implementations of Ising Machines, ” Phys. Rev. Appl. , vol. 20, no. 2, p. 024005, Aug. 2023, doi: 10.1103/PhysRevApplied.20.024005

    work page doi:10.1103/physrevapplied.20.024005 2023

  32. [32]

    A coupled-oscillator-based Ising chip for combinatorial optimization,

    H. Cılasun et al., “A coupled-oscillator-based Ising chip for combinatorial optimization,” Nat. Electron., vol. 8, no. 6, pp. 537 –546, Jun. 2025, doi: 10.1038/s41928-025-01393-3

    work page doi:10.1038/s41928-025-01393-3 2025

  33. [33]

    Benchmarking the operation of quantum heuristics and Ising machines: scoring parameter setting strategies on optimization applications,

    D. E. Bernal Neira et al. , “Benchmarking the operation of quantum heuristics and Ising machines: scoring parameter setting strategies on optimization applications,” Quantum Mach. Intell. , vol. 7, no. 2, p. 86, 13 > REPLACE THIS LINE WITH YOUR MANUSCRIPT ID NUMBER (DOUBLE -CLICK HERE TO EDIT) < Dec. 2025, doi: 10.1007/s42484-025-00311-2

    work page doi:10.1007/s42484-025-00311-2 2025

  34. [34]

    Large-Scale MIMO Enabled Satellite Communications: Concepts, Technologies, and Challenges,

    Y. Wu, L. Xiao, J. Zhou, M. Feng, P. Xiao, and T. Jiang, “Large-Scale MIMO Enabled Satellite Communications: Concepts, Technologies, and Challenges,” IEEE Commun. Mag. , vol. 62, no. 8, pp. 140 –146, Aug. 2024, doi: 10.1109/MCOM.001.2300540

    work page doi:10.1109/mcom.001.2300540 2024

  35. [35]

    Maral, M

    G. Maral, M. Bousquet, and Z. Sun, Satellite Communications Systems . Hoboken: Wiley, 2020

    work page 2020

  36. [36]

    Adaptive modulation and coding for IEEE 802.11n,

    F. Peng, J. Zhang, and W. E. Ryan, “Adaptive modulation and coding for IEEE 802.11n,” IEEE Wirel. Commun. Netw. Conf. WCNC, pp. 657–662, 2007, doi: 10.1109/WCNC.2007.126

    work page doi:10.1109/wcnc.2007.126 2007

  37. [37]

    Evolved Universal Terrestrial Radio Access (E -UTRA); Physical layer procedures,

    3rd Generation Partnership Project TS 36.213, “Evolved Universal Terrestrial Radio Access (E -UTRA); Physical layer procedures, ” vol. Section 7.2.3

    work page

  38. [38]

    Low-Complexity Signal Detection for Massive MIMO Systems via Trace Iterative Method,

    A. K. Imran, X. Zhang, H. S. Abdul, A. K. Ihsan, and A. D. Zaheer, “Low-Complexity Signal Detection for Massive MIMO Systems via Trace Iterative Method,” J. Syst. Eng. Electron. , vol. 35, no. 3, pp. 549 – 557, Jun. 2024, doi: 10.23919/JSEE.2024.000061

    work page doi:10.23919/jsee.2024.000061 2024

  39. [39]

    An integrated-circuit-based probabilistic computer that uses voltage-controlled magnetic tunnel junctions as its entropy source,

    C. Duffee et al., “An integrated-circuit-based probabilistic computer that uses voltage-controlled magnetic tunnel junctions as its entropy source, ” Nat. Electron. , vol. 8, no. 9, pp. 784 –793, Aug. 2025, doi: 10.1038/s41928-025-01439-6

    work page doi:10.1038/s41928-025-01439-6 2025

  40. [40]

    Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems,

    J. Si et al. , “Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems, ” Nat. Commun., vol. 15, no. 1, p. 3457, Apr. 2024, doi: 10.1038/s41467-024-47818-z

    work page doi:10.1038/s41467-024-47818-z 2024

  41. [41]

    The MathWorks, Inc.IMU Sensor Fusion with Simulink

    D. Venturelli, E. Gustafson, D. Kurkcuoglu, and S. Zorzetti, “Near-Term Application Engineering Challenges in Emerging Superconducting Qudit Processors,” in 2025 55th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN -W), Jun. 2025, pp. 196–199, doi: 10.1109/DSN-W65791.2025.00061

    work page doi:10.1109/dsn-w65791.2025.00061 2025