Digital Filter Implementation of Orthogonal Moments

Asli, Barmak Honarvar Shakibaei; Raveendran, P.

doi:10.5772/52191

Cited by 1 publication

(1 citation statement)

References 33 publications

(80 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In general, two common types of orthogonal polynomials (OPs) have been widely used, namely, orthogonal on a disc and orthogonal on a rectangle [6,7]. Fourier-Mellin and Zernike polynomials [8,9] are examples of polynomials that are orthogonal on a disc.…”

Section: Introductionmentioning

confidence: 99%

High-Performance Krawtchouk Polynomials of High Order Based on Multithreading

Flayyih,

Al-sudani,

Mahmmod

et al. 2024

Computation

View full text Add to dashboard Cite

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.

show abstract