Abstract
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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
