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.
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 call
