<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.

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

In the context of normed space, Banach's fixed point theorem for mapping is studied in this paper. This idea is generalized in Banach's classical fixed-point theory. Fixed point theory explains many situations where maps provide great answers through an amazing combination of mathematical analysis. Picard- Lendell's theorem, Picard's theorem, implicit function theorem, and other results are created by other mathematicians later using this fixed-point theorem. We have come up with ideas that Banach's theorem can be used to easily deduce many well-known fixed-point theorems. Extending the Banach contraction principle to include metric space with modular spaces has been included in some recent research, the aim of study proves some pro

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

Discrete Racah polynomials (DRPs) are considered essential for several applications such as approximation theory, quantum physics, and digital signal processing. However, the computation of high-order DRPs presents significant numerical and computational challenges. Even though the recent advancements in algorithms have improved numerical stability, the inherently sequential nature of these algorithms continues to be a bottleneck for large-scale implementations. This paper proposes a new multithreading-based algorithm for computing the DRP coefficients. The proposed algorithm is designed to accelerate the computation of high-order DRPs by considering the advantages of the independence of different tasks and the ability to process mu

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