Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithm
The Gaussian Q-function (GQF) is widely used in various scientific and engineering fields, especially in telecommunications and wireless communication. However, the lack of a closed-form expression for this function has led to considerable research efforts to achieve more accurate approximations. Th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2025-01-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1177/17483026251315392 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832582673642553344 |
|---|---|
| author | Reza Etesami Mohsen Madadi |
| author_facet | Reza Etesami Mohsen Madadi |
| author_sort | Reza Etesami |
| collection | DOAJ |
| description | The Gaussian Q-function (GQF) is widely used in various scientific and engineering fields, especially in telecommunications and wireless communication. However, the lack of a closed-form expression for this function has led to considerable research efforts to achieve more accurate approximations. This study introduces a new approximate method that provides high accuracy for the boundaries of the GQF. The proposed approach utilizes parametric functions for both the lower and upper bounds of the GQF. The parameters of these functions are estimated using the Wild Horse Optimization (WHO), a meta-heuristic optimization algorithm, with the aim of minimizing the distance between the proposed functions and the actual GQF. The optimization process targets the minimization of the maximum absolute error and the mean absolute error, ensuring that the proposed bounds provide a tight and accurate approximation of the GQF. Numerical experiments and comparisons with existing bounds demonstrate the superior accuracy of the proposed method. The new lower and upper bounds achieve significantly lower maximum absolute error and mean absolute error values compared to previous approaches. Furthermore, the study evaluates the effectiveness of the proposed bounds in estimating the symbol error probability (SEP) for various digital modulation schemes, showing that the new bounds provide more accurate estimates of the SEP compared to the existing bounds. The results highlight the practical significance of the proposed method in enhancing the reliability of error probability estimation in communication systems. |
| format | Article |
| id | doaj-art-39ae4a72c6764d51866d0c4aefb201f1 |
| institution | Kabale University |
| issn | 1748-3026 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | SAGE Publishing |
| record_format | Article |
| series | Journal of Algorithms & Computational Technology |
| spelling | doaj-art-39ae4a72c6764d51866d0c4aefb201f12025-01-29T11:04:22ZengSAGE PublishingJournal of Algorithms & Computational Technology1748-30262025-01-011910.1177/17483026251315392Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithmReza EtesamiMohsen MadadiThe Gaussian Q-function (GQF) is widely used in various scientific and engineering fields, especially in telecommunications and wireless communication. However, the lack of a closed-form expression for this function has led to considerable research efforts to achieve more accurate approximations. This study introduces a new approximate method that provides high accuracy for the boundaries of the GQF. The proposed approach utilizes parametric functions for both the lower and upper bounds of the GQF. The parameters of these functions are estimated using the Wild Horse Optimization (WHO), a meta-heuristic optimization algorithm, with the aim of minimizing the distance between the proposed functions and the actual GQF. The optimization process targets the minimization of the maximum absolute error and the mean absolute error, ensuring that the proposed bounds provide a tight and accurate approximation of the GQF. Numerical experiments and comparisons with existing bounds demonstrate the superior accuracy of the proposed method. The new lower and upper bounds achieve significantly lower maximum absolute error and mean absolute error values compared to previous approaches. Furthermore, the study evaluates the effectiveness of the proposed bounds in estimating the symbol error probability (SEP) for various digital modulation schemes, showing that the new bounds provide more accurate estimates of the SEP compared to the existing bounds. The results highlight the practical significance of the proposed method in enhancing the reliability of error probability estimation in communication systems.https://doi.org/10.1177/17483026251315392 |
| spellingShingle | Reza Etesami Mohsen Madadi Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithm Journal of Algorithms & Computational Technology |
| title | Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithm |
| title_full | Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithm |
| title_fullStr | Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithm |
| title_full_unstemmed | Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithm |
| title_short | Tighter bounds on the Gaussian Q-function based on wild horse optimization algorithm |
| title_sort | tighter bounds on the gaussian q function based on wild horse optimization algorithm |
| url | https://doi.org/10.1177/17483026251315392 |
| work_keys_str_mv | AT rezaetesami tighterboundsonthegaussianqfunctionbasedonwildhorseoptimizationalgorithm AT mohsenmadadi tighterboundsonthegaussianqfunctionbasedonwildhorseoptimizationalgorithm |