Pith. sign in

REVIEW 2 cited by

Deep Unfolded Simulated Bifurcation for Massive MIMO Signal Detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.16264 v2 pith:KLL3PGM3 submitted 2023-06-28 cs.IT cs.LGeess.SPmath.IT

classification cs.ITcs.LGeess.SPmath.IT
keywords algorithmdetectiondeepmimodetectorsimproveperformancesignal
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Multiple-input multiple-output (MIMO) is a key ingredient of next-generation wireless communications. Recently, various MIMO signal detectors based on deep learning techniques and quantum(-inspired) algorithms have been proposed to improve the detection performance compared with conventional detectors. This paper focuses on the simulated bifurcation (SB) algorithm, a quantum-inspired algorithm. This paper proposes two techniques to improve its detection performance. The first is modifying the algorithm inspired by the Levenberg-Marquardt algorithm to eliminate local minima of maximum likelihood detection. The second is the use of deep unfolding, a deep learning technique to train the internal parameters of an iterative algorithm. We propose a deep-unfolded SB by making the update rule of SB differentiable. The numerical results show that these proposed detectors significantly improve the signal detection performance in massive MIMO systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Transfer Learning for Deep-Unfolded Combinatorial Optimization Solver with Quantum Annealer

    quant-ph 2025-01 conditional novelty 6.0 of 10

    A quantum annealing solver for combinatorial optimization can be trained on a classical simulator and then transferred to real quantum hardware, improving convergence and speed.

  2. Slack-Free Deep-Unfolded Combinatorial Optimization Solver for Inequality Constraints

    quant-ph 2026-07 conditional novelty 4.0 of 10

    A deep-unfolded, slack-free version of the Ohzeki method finds optimal knapsack solutions in about half the outer iterations of fixed-step baselines.

Pith tools