Title :
Fast discrete Pascal transform
Author_Institution :
Dept. of Comput. Sci., Hellenic Open Univ., Patras
Abstract :
An efficient structure for the fast computation of the discrete Pascal transform (DPT) is presented. Only frac12N(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
Keywords :
computational complexity; discrete transforms; polynomial matrices; N-point transform; computational complexity; fast discrete Pascal transform;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20062588
