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 parall

The aim of this book is to present a method for solving high order ordinary differential equations with two point boundary condition of the different kind, we propose semi-analytic technique using two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, we discussion the existence and uniqueness of solutions and many examples are presented to demonstrate the applicability, accuracy and efficiency of the methods by compared with conventional method .i.e. VIDM , Septic B-Spline , , NIM , HPM, Haar wavelets on one hand and to confirm the order convergence on the other

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

For many problems in Physics and Computational Fluid Dynamics (CFD), providing an accurate approximation of derivatives is a challenging task. This paper presents a class of high order numerical schemes for approximating the first derivative. These approximations are derived based on solving a special system of equations with some unknown coefficients. The construction method provides numerous types of schemes with different orders of accuracy. The accuracy of each scheme is analyzed by using Fourier analysis, which illustrates the dispersion and dissipation of the scheme. The polynomial technique is used to verify the order of accuracy of the proposed schemes by obtaining the error terms. Dispersion and dissipation errors are calculated

The need for optical fibers has emerged for its ability to transmit information with less attenuation and over long distances. In this work, four optical fibers with core radii from 1 μm to 4.75 μm in steps of 1.25 μm and a numerical aperture of 0.17 were studied and their modes properties have been calculated at a wavelength of 633 nm by using RP Fiber Calculator (free version 2022). Also, the effect of increasing the core radius on these properties has been studied. Multimode fibers can be obtained when the radius of the fiber core is large compared to the operating wavelength of the fiber which is less than the cutoff wavelength of the mode. Otherwise, a single-mode fiber is obtained. It has been concluded that all the calculated p

<span>Digital audio is required to transmit large sizes of audio information through the most common communication systems; in turn this leads to more challenges in both storage and archieving. In this paper, an efficient audio compressive scheme is proposed, it depends on combined transform coding scheme; it is consist of i) bi-orthogonal (tab 9/7) wavelet transform to decompose the audio signal into low &amp; multi high sub-bands, ii) then the produced sub-bands passed through DCT to de-correlate the signal, iii) the product of the combined transform stage is passed through progressive hierarchical quantization, then traditional run-length encoding (RLE), iv) and finally LZW coding to generate the output mate bitstream.

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va