Abstract

Forward Krawtchouk moment transform (FKMT) needs more computations when a straightforward method of computation is chosen. Hence, this paper proposes a simple recursive method to reduce the number of computations using a Clenshaw's recurrence formula. Further, it is also shown that the number of computations can still be reduced by using the symmetry property of weighted Krawtchouk polynomials that are used to define FKMT. The proposed approach is verified with theoretical calculations as well as CPU time required for computation of FKMT of 1D and 2D points. The obtained recursive structure is simple and modular, Hence, it is suitable for parallel VLSI implementation.

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 call

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