Four-term recurrence for fast Krawtchouk moments using Clenshaw algorithm

Simple item page
dc.contributor.authorBarmak, Honarvar Shakibaei Asli
dc.contributor.authorRezaei, Maryam Horri
dc.date.accessioned2023-06-15T14:21:08Z
dc.date.available2023-06-15T14:21:08Z
dc.date.issued2023-04-12
dc.description.abstractKrawtchouk 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 pattern recognition. In this paper, we introduce a new four-term recurrence relation to compute KPs compared to their ordinary recursions (three-term) and analyse the proposed algorithm speed. Moreover, we use Clenshaw’s technique to accelerate the computation procedure of the Krawtchouk moments (KMs) using a fast digital filter structure to generate a lattice network for KPs calculation. The proposed method confirms the stability of KPs computation for higher orders and their signal reconstruction capabilities as well. The results show that the KMs calculation using the proposed combined method based on a four-term recursion and Clenshaw’s technique is reliable and fast compared to the existing recursions and fast KMs algorithms.en_UK
dc.identifier.citationHonarvar Shakibaei Asli B, Rezaei MH. (2023) Four-term recurrence for fast Krawtchouk moments using Clenshaw algorithm. Electronics, Volume 12, Issue 8, April 2023, Article number 1834en_UK
dc.identifier.issn2079-9292
dc.identifier.urihttps://doi.org/10.3390/electronics12081834
dc.identifier.urihttps://dspace.lib.cranfield.ac.uk/handle/1826/19788
dc.language.isoenen_UK
dc.publisherMDPIen_UK
dc.rightsAttribution 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.subjectKrawtchouk momentsen_UK
dc.subjectfour-term recurrenceen_UK
dc.subjectdigital filteren_UK
dc.subjectZ-transformen_UK
dc.subjectClenshaw formulaen_UK
dc.titleFour-term recurrence for fast Krawtchouk moments using Clenshaw algorithmen_UK
dc.typeArticleen_UK

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Four-term_recurrence_for_fast_Krawtchouk_moments-2023.pdf
Size:
8.52 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.63 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Staff publications (SATM)