Four-Term Recurrence for Fast Krawtchouk Moments Using Clenshaw Algorithm
Krawtchouk polynomials (KPs) are discrete orthogonal polynomials associated with the Gauss hypergeometric functions. These polynomials and their generated moments in 1D or 2D formats play an important role in information and coding theories, signal and image processing tools, image watermarking, and...
Main Authors: | Barmak Honarvar Shakibaei Asli, Maryam Horri Rezaei |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-04-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/12/8/1834 |
Similar Items
-
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
by: Khaled A. AL-Utaibi, et al.
Published: (2021-09-01) -
On Computational Aspects of Krawtchouk Polynomials for High Orders
by: Basheera M. Mahmmod, et al.
Published: (2020-08-01) -
Watermarking Applications of Krawtchouk–Sobolev Type Orthogonal Moments
by: Edmundo J. Huertas, et al.
Published: (2022-02-01) -
Stable Calculation of Krawtchouk Functions from Triplet Relations
by: Albertus C. den Brinker
Published: (2021-08-01) -
Krawtchouk transforms and convolutions
by: Philip Feinsilver, et al.
Published: (2020-12-01)