Fast discrete Pascal transform

An efficient structure for the fast computation of the discrete Pascal transform (DPT) is presented. Only ½N(N−1) additions are required for the computation of an N-point DPT as opposed to N2 multiplications and N(N−1) additions. The reduced computational complexity of the proposed algorithm results in significant time savings and software/hardware simplicity.

[1]  Thomas J. Goodman,et al.  The discrete Pascal transform and its applications , 2005, IEEE Signal Processing Letters.

[2]  T.J. Goodman,et al.  Interpolation Using the Discrete Pascal Transform , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[3]  Athanassios N. Skodras.  Efficient computation of the discrete Pascal transform , 2006, 2006 14th European Signal Processing Conference.

[4]  Guillermo Sapiro,et al.  Affine invariant surface evolutions for 3D image segmentation , 2006, Electronic Imaging.

[5]  Maurice F. Aburdene,et al.  A hardware implementation of the discrete Pascal transform for image processing , 2006, Electronic Imaging.