Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parallel processing capabilities of modern central processing units (CPUs), namely the availability of multiple cores and multithreading. The proposed multi-threaded implementations for computing DKraP coefficients divide the computations into multiple independent tasks, which are executed concurrently by different threads distributed among the independent cores. This multi-threaded approach has been evaluated across a range of DKraP sizes and various values of polynomial parameters. The results show that the proposed method achieves a significant reduction in computation time. In addition, the proposed method has the added benefit of applying to larger polynomial sizes and a wider range of Krawtchouk polynomial parameters. Furthermore, an accurate and appropriate selection scheme of the recurrence algorithm is introduced. The proposed approach introduced in this paper makes the DKraP coefficient computation an attractive solution for a variety of applications.
The objective of this study was tointroduce a recursive least squares (RLS) parameter estimatorenhanced by using a neural network (NN) to facilitate the computing of a bit error rate (BER) (error reduction) during channels estimation of a multiple input-multiple output orthogonal frequency division multiplexing (MIMO-OFDM) system over a Rayleigh multipath fading channel.Recursive least square is an efficient approach to neural network training:first, the neural network estimator learns to adapt to the channel variations then it estimates the channel frequency response. Simulation results show that the proposed method has better performance compared to the conventional methods least square (LS) and the original RLS and it is more robust a
... Show MoreBackground. The use of modern aids and technology has contributed greatly to football development, the goalkeeper is the most important position in the team, and the use of devices gave objective readings about the goalkeeper's ability in terms of skill and physical aspects. Objectives. The research aimed to prepare exercises using an electronic device to measure the knee bending angle because of its great importance in developing the skill of catching and dimensions of the high ball for football goalkeepers. Methods. The researchers used the experimental method, and the sample consisted of (4) male goalkeepers under 15 years of age, one of the research procedures was to determine the biomechanical variables affecting the development of the
... Show MoreThe novel groups of organic chromophores containing triphenylamine (TPA) (ATP-I to ATP-IV) have been constructed by structural modification of electron donors with substitution biphenyl and bipyridine rings inserting a π-linkage. Density functional theory (DFT) and time-dependent type of it (TD-DFT) have been operated to study results of donating ability of TPA and spacer on absorption, geometrical, photovoltaic, and energetic attributes of these sensitizers. Structural attributes have been revealed that incorporation of TPA, acceptor and π bridge include a perfect coplanar conformation in TPA-III. Based on frequency computations and ground-state optimization, bandgap (Eg) energy, ELUMO, EHOMO have been determined. For enlightening maximu
... Show MoreThis study emphasizes the infinite-boundary integro-differential equation. To examine the approximate solution of the problem, two modified optimization algorithms are proposed based on generalized Laguerre functions. In the first technique, the proposed method is applied to the original problem by approximating the solution using the truncated generalized Laguerre polynomial of the unknown function, optimizing coefficients through error minimization, and transforming the integro-differential equation into an algebraic equation. In contrast, the second approach incorporates a penalty term into the objective function to effectively enforce boundary and integral constraints. This technique reduces the original problem to a mathematical optimi
... Show MoreIn this paper, we study the growth of solutions of the second order linear complex differential equations insuring that any nontrivial solutions are of infinite order. It is assumed that the coefficients satisfy the extremal condition for Yang’s inequality and the extremal condition for Denjoy’s conjecture. The other condition is that one of the coefficients itself is a solution of the differential equation .
In this paper, the author established some new integral conditions for the oscillation of all solutions of nonlinear first order neutral delay differential equations. Examples are inserted to illustrate the results.
in this paper fourth order kutta method has been used to find the numerical solution for different types of first liner