IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i19p3590-d931279.html
   My bibliography  Save this article

Two Interval Upper-Bound Q -Function Approximations with Applications

Author

Listed:
  • Zoran Perić

    (Faculty of Electronic Engineering, University of Niš, Aleksandra Medvedeva 14, 18115 Niš, Serbia
    These authors contributed equally to this work.)

  • Aleksandar Marković

    (Faculty of Sciences and Mathematics, University of Priština in Kosovska Mitrovica, Lole Ribara 29, 38220 Kosovska Mitrovica, Serbia
    These authors contributed equally to this work.)

  • Nataša Kontrec

    (Faculty of Sciences and Mathematics, University of Priština in Kosovska Mitrovica, Lole Ribara 29, 38220 Kosovska Mitrovica, Serbia
    These authors contributed equally to this work.)

  • Jelena Nikolić

    (Faculty of Electronic Engineering, University of Niš, Aleksandra Medvedeva 14, 18115 Niš, Serbia
    These authors contributed equally to this work.)

  • Marko D. Petković

    (Faculty of Science and Mathematics, University of Niš, Višegradska 33, 18000 Niš, Serbia
    These authors contributed equally to this work.)

  • Aleksandra Jovanović

    (Faculty of Electronic Engineering, University of Niš, Aleksandra Medvedeva 14, 18115 Niš, Serbia
    These authors contributed equally to this work.)

Abstract

The Gaussian Q -function has considerable applications in numerous areas of science and engineering. However, the fact that a closed-form expression for this function does not exist encourages finding approximations or bounds of the Q -function. In this paper, we determine analytically two novel interval upper bound Q -function approximations and show that they could be used efficiently not only for the symbol error probability (SEP) estimation of transmission over Nakagami- m fading channels, but also for the average symbol error probability (ASEP) evaluation for two modulation formats. Specifically, we determine analytically the composition of the upper bound Q -function approximations specified at disjoint intervals of the input argument values so as to provide the highest accuracy within the intervals, by utilizing the selected one of two upper bound Q -function approximations. We show that a further increase of the accuracy, achieved in the case with two upper-bound approximations composing the interval approximation, can be obtained by forming a composite interval approximation of the Q -function that assumes another extra interval and by specifying the third form for the upper-bound Q -function approximation. The proposed analytical approach can be considered universal and widely applicable. The results presented in the paper indicate that the proposed Q -function approximations outperform in terms of accuracy other well-known approximations carefully chosen for comparison purposes. This approximation can be used in numerous theoretical communication problems based on the Q -function calculation. In this paper, we apply it to estimate the average bit error rate (ABER), when the transmission in a Nakagami- m fading channel is observed for the assumed binary phase-shift keying (BPSK) and differentially encoded quadrature phase-shift keying (DE-QPSK) modulation formats, as well as to design scalar quantization with equiprobable cells for variables from a Gaussian source.

Suggested Citation

  • Zoran Perić & Aleksandar Marković & Nataša Kontrec & Jelena Nikolić & Marko D. Petković & Aleksandra Jovanović, 2022. "Two Interval Upper-Bound Q -Function Approximations with Applications," Mathematics, MDPI, vol. 10(19), pages 1-15, October.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3590-:d:931279
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/19/3590/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/19/3590/
    Download Restriction: no
    ---><---

    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:jmathe:v:10:y:2022:i:19:p:3590-:d:931279. 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 (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.