IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v17y2025i11p498-d1783352.html

Hybrid GOMP–ROMP Algorithm for Sparse Channel Estimation in mmWave MIMO: Enhancing Convergence and Reducing Computational Complexity

Author

Listed:
  • Anjana Babu Sujatha

    (Department of Communication Engineering, School of Electronics Engineering, Vellore Institute of Technology, Vellore 632014, India
    These authors contributed equally to this work.)

  • Vinoth Babu Kumaravelu

    (Department of Communication Engineering, School of Electronics Engineering, Vellore Institute of Technology, Vellore 632014, India
    These authors contributed equally to this work.)

Abstract

This paper proposes an efficient sparse channel estimation method for millimeter wave (mmWave) hybrid multiple-input multiple-output (MIMO) systems. The performance of orthogonal matching pursuit (OMP) and its advanced variants—generalized OMP (GOMP), simultaneous OMP (SOMP), and regularized OMP (ROMP)—is evaluated based on normalized mean square error (NMSE) and computational complexity. A new hybrid GOMP–ROMP algorithm is proposed to achieve faster convergence and lower computational costs while maintaining the desired estimation accuracy. Simulation results reveal that the proposed algorithm reduces NMSE by 0.040823 compared to OMP and attains ROMP’s accuracy with significantly less complexity. For a MIMO system with 32 ×32 configuration, the method offers up to a fourfold reduction in computational complexity compared to OMP, ROMP, and SOMP. These findings highlight the potential of the hybrid algorithm for real-time mmWave massive MIMO applications in fifth-generation (5G) and sixth-generation (6G) systems, where high bandwidth and low latency are essential.

Suggested Citation

  • Anjana Babu Sujatha & Vinoth Babu Kumaravelu, 2025. "Hybrid GOMP–ROMP Algorithm for Sparse Channel Estimation in mmWave MIMO: Enhancing Convergence and Reducing Computational Complexity," Future Internet, MDPI, vol. 17(11), pages 1-20, October.
    • Handle: RePEc:gam:jftint:v:17:y:2025:i:11:p:498-:d:1783352
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/17/11/498/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/17/11/498/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:gam:jftint:v:17:y:2025:i:11:p:498-:d:1783352. 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: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address (email available below). General contact details of provider: https://www.mdpi.com .

    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.