IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v88y2025i3d10.1007_s11235-025-01339-2.html
   My bibliography  Save this article

A low-complexity adhesive MRC detector for an oversampling-reliant OTFS receiver

Author

Listed:
  • Afreen Kubra

    (Presidency University
    HKBK College of Engineering)

  • S. Safinaz

    (Presidency University)

Abstract

Orthogonal Time–Frequency Space (OTFS) modulation demonstrates enhanced performance in high-mobility wireless situations and significant performance benefits over Delay-Doppler relative to Orthogonal Frequency Division Multiplexing (OFDM). This paper focuses on adhesive Maximal Ratio Combining (MRC) detector with oversampling in the presence of Doppler shifts and fractional delays. Discrete time-based channel model with additive noise is used to represent the OTFS system in oversampling condition. In the context of OTFS transmission utilizing rectangular pulses, we establish a comprehensive channel input–output relationship within the Delay-Doppler domain. This derivation is conducted without depending on unrealistic assumptions, such as the use of ideal bi-orthogonal pulses and the presence of on-the-grid delay/Doppler shifts. Simulation results shows that for 4QAM, 8QAM, 16QAM, the proposed adhesive MRC detector with oversampling factor 8 performs better and for 32QAM, 64QAM, 128QAM, 256QAM, and 512QAM adhesive MRC detector with oversampling factor 4 shows superior BER performance.

Suggested Citation

  • Afreen Kubra & S. Safinaz, 2025. "A low-complexity adhesive MRC detector for an oversampling-reliant OTFS receiver," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 88(3), pages 1-13, September.
    • Handle: RePEc:spr:telsys:v:88:y:2025:i:3:d:10.1007_s11235-025-01339-2
    DOI: 10.1007/s11235-025-01339-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-025-01339-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-025-01339-2?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:spr:telsys:v:88:y:2025:i:3:d:10.1007_s11235-025-01339-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.