Fast discrete Pascal transform
Athanassios N. Skodras · Electronics Letters · 2006
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.