An Efficient Approximation for Nakagami‐m Quantile Function Based on Generalized Opposition‐Based Quantum Salp Swarm Algorithm

Abstract

With the further research in communication systems, especially in wireless communication systems, a statistical model called Nakagami-mdistribution appears to have better performance than other distributions, including Rice and Rayleigh, in explaining received faded envelopes. Therefore, the Nakagami-mquantile function plays an important role in numerical calculations and theoretical analyses for wireless communication systems. However, it is quite difficult to operate numerical calculations and theoretical analyses because Nakagami-mquantile function has no exact closed-form expression. In order to obtain the closed-form expression that is able to fit the curve of Nakagami-mquantile function as well as possible, we adopt the method of curve fitting in this paper. An efficient expression for approximating the Nakagami-mquantile function is proposed first and then a novel heuristic optimization algorithm—generalized opposition-based quantum salp swarm algorithm (GO-QSSA)—which contains quantum computation, intelligence inspired by salp swarm and generalized opposition-based learning strategy in quantum space, to compute the coefficients of the proposed expression. Meanwhile, we compare GO-QSSA with three swarm intelligence algorithms: artificial bee colony algorithm (ABC), particle swarm optimization algorithm (PSO), and salp swarm algorithm (SSA). The comparing simulation results reveal that GO-QSSA owns faster convergence speed than PSO, ABC, and SSA. Moreover, GO-QSSA is capable of computing more accurately than traditional algorithms. In addition, the simulation results show that compared with existing curve-fitting-based methods, the proposed expression decreases the fitting error by roughly one order of magnitude in most cases and even higher in some cases. Our approximation is proved to be simple and efficient.

Direction Finding of Bistatic MIMO Radar in Strong Impulse Noise

“…For complex direction finding problems in the impulse noise environment, intelligence computing can substantially reduce the calculation complexity while improving the precision of direction finding. Accordingly, we propose the quantum equilibrium optimizer algorithm (QEOA), with its inspirations from the equilibrium optimizer (EO) [35] and quantum computing [36,37]. Compared with the original EO, the proposed QEOA can efficiently expedite the convergence rate while avoiding slipping into a local optimum.…”

Improved active disturbance rejection control with the optimization algorithm for the leg joint control of a hydraulic quadruped robot

“…To enhance the search accuracy and the convergence rate, some SSA variants have been given in the literature and used in many industrial fields, such as Refs. [36][37][38][39][40][41][42] One such variant is the self-growing le´vy-flight salp swarm algorithm (SG-LSSA), which has been used in hydraulic systems to find three PID parameters. The SG-LSSA uses the large initial leader step and the self-growing updating strategy to boost the search speed of the basic SSA and uses the le´vy-flight method to heighten the algorithmic diversities.…”

Proportional–Integral–Derivative Controller Design Using an Advanced Lévy-Flight Salp Swarm Algorithm for Hydraulic Systems

“…Salp swarm algorithm (SSA), which was proposed by Mirjalili et al in 2017, is an efficient meta-heuristic optimization algorithm that mimics the swarming behavior and the predation model of salp swarm [25,26]. The algorithm, which possesses a simple program structure and fast computation, has been used in many project areas, such as load frequency control [27], the design of IIR wideband digital differentiators and integrators [28], parameter estimations for soil-water retention curves [29], interval prediction for short-term load forecasting [30], and the quality enhancement of an islanded microgrid [31].…”