A composite Gauss–Legendre quadrature method for the Q-function approximation and its application in 6-bit symbol sequence modulation over generalised fading distributions

Abstract This article introduces a 6-bit Symbol Sequence Modulation (6-SSM) scheme developed to enhance communication security and efficiency through sequence-based modulation. The 6-SSM is designed to exploit symbol sequences, enabling improved secrecy performance through time-slot diversity. To analytically evaluate the performance of the proposed 6-SSM system, an exponent-based Q-function approximation (QFA) is also developed. This QFA employs a composite Gauss–Legendre quadrature applied to the polar form of the Q function. By dividing the integration range into intervals $$N$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>N</mml:mi> </mml:math> and using $$n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>n</mml:mi> </mml:math> nodes per interval, the approximation error is significantly reduced to a factor of $$\frac{1}{N^{2n}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mfrac> <mml:mn>1</mml:mn> <mml:msup> <mml:mi>N</mml:mi> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:mrow> </mml:msup> </mml:mfrac> </mml:math> . A practical configuration with two intervals and two nodes yields a four-exponent QFA that offers high accuracy, low relative error, and reduced complexity compared to existing approximations. The QFA is used to derive closed-form expressions for the bit error rate (BER) of the 6-SSM scheme under generalised fading channels, including Nakagami- m , $$\kappa$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>κ</mml:mi> </mml:math> – $$\mu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>μ</mml:mi> </mml:math> , and $$\eta$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>η</mml:mi> </mml:math> – $$\mu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>μ</mml:mi> </mml:math> distributions. The analytical results match closely Monte Carlo simulations, confirming the precision of the proposed QFA. Additionally, BER expressions are employed to analyse the secrecy rate, revealing that higher-order SSM offers improved physical layer security.

Authors

Institutions

Publication Details

Journal
Journal of Electrical Systems and Information Technology
Published
2025-08-12
DOI
https://doi.org/10.1186/s43067-025-00256-3
Citations
1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A composite Gauss–Legendre quadrature method for the Q-function approximation and its application in 6-bit symbol sequence modulation over generalised fading distributions

Peter O. Akuon, Abdulrahman Faris, Vitalice K. Oduol
1 citations
Journal of Electrical Systems and Information Technology
Coding theory and cryptography
2.48
article

A composite Gauss–Legendre quadrature method for the Q-function approximation and its application in 6-bit symbol sequence modulation over generalised fading distributions

Peter O. Akuon, Abdulrahman Faris, Vitalice K. Oduol
article en
1 citations

Abstract

Abstract This article introduces a 6-bit Symbol Sequence Modulation (6-SSM) scheme developed to enhance communication security and efficiency through sequence-based modulation. The 6-SSM is designed to exploit symbol sequences, enabling improved secrecy performance through time-slot diversity. To analytically evaluate the performance of the proposed 6-SSM system, an exponent-based Q-function approximation (QFA) is also developed. This QFA employs a composite Gauss–Legendre quadrature applied to the polar form of the Q function. By dividing the integration range into intervals $$N$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>N</mml:mi> </mml:math> and using $$n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>n</mml:mi> </mml:math> nodes per interval, the approximation error is significantly reduced to a factor of $$\frac{1}{N^{2n}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mfrac> <mml:mn>1</mml:mn> <mml:msup> <mml:mi>N</mml:mi> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:mrow> </mml:msup> </mml:mfrac> </mml:math> . A practical configuration with two intervals and two nodes yields a four-exponent QFA that offers high accuracy, low relative error, and reduced complexity compared to existing approximations. The QFA is used to derive closed-form expressions for the bit error rate (BER) of the 6-SSM scheme under generalised fading channels, including Nakagami- m , $$\kappa$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>κ</mml:mi> </mml:math> – $$\mu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>μ</mml:mi> </mml:math> , and $$\eta$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>η</mml:mi> </mml:math> – $$\mu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>μ</mml:mi> </mml:math> distributions. The analytical results match closely Monte Carlo simulations, confirming the precision of the proposed QFA. Additionally, BER expressions are employed to analyse the secrecy rate, revealing that higher-order SSM offers improved physical layer security.

Journal of Electrical Systems and Information TechnologyVol. 12(1)
University of Nairobi (KE)
Openalex Percentile: Top 9%
Coding theory and cryptography
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.