IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0344696.html

Residual-aided CSI-free end-to-end learning for multiuser MIMO

Author

Listed:
  • Emmanuel Ampoma Affum
  • Osumanu Futa
  • Maxwell Afriyie Oppong
  • Daniel Owusu Biney

Abstract

A paradigm shift from Channel State Information (CSI)-dependent architectures to intelligent, AI-native air interfaces is required as 6G wireless systems advance. Conventional Multi-User Multiple-Input Multiple-Output (MU-MIMO) systems have substantial pilot overhead and computational complexity since they rely on explicit CSI for beamforming and interference management. This study suggests a novel Deep Unfolding Successive Over-Relaxation (DU-SOR) paradigm to overcome these constraints. In contrast to conventional end-to-end learning techniques that operate as “black boxes,” DU-SOR combines iterative residual refining with a sparse Graph Transformer. The network can intuitively solve the inverse problem without explicit channel matrix inversion thanks to this novel architecture, which uses graph priors to condition the signal estimation. Extensive empirical analyses show that the proposed framework accomplishes three main goals: (i) near-optimal performance, confirmed by a mutual information score of 0.98 at 20 dB SNR; (ii) mathematically proven scalable complexity, reducing the scaling order from 𝒪(K3) to 𝒪(KlogK) via sparse attention mechanisms; and (iii) robust generalisation across various channel conditions (Rayleigh, Rician, 3GPP UMi). This work offers a scalable foundation for sustainable AI-native 6G receivers by combining sparse-graph efficiency with CSI-free operation.

Suggested Citation

  • Emmanuel Ampoma Affum & Osumanu Futa & Maxwell Afriyie Oppong & Daniel Owusu Biney, 2026. "Residual-aided CSI-free end-to-end learning for multiuser MIMO," PLOS ONE, Public Library of Science, vol. 21(4), pages 1-17, April.
  • Handle: RePEc:plo:pone00:0344696
    DOI: 10.1371/journal.pone.0344696
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0344696
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0344696&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0344696?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0344696. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.