Title :
Efficient computation of the discrete Pascal transform
Author :
Skodras, Athanassios
Author_Institution :
Comput. Sci., Hellenic Open Univ., Patras, Greece
Abstract :
The recently proposed discrete Pascal transform possesses a computational complexity for an N-point vector of the order of N2 for both multiplications and additions. In the present work an efficient structure is proposed, which eliminates the multiplications and halves the number of additions.
Keywords :
computational complexity; discrete transforms; vectors; N-point vector; computational complexity; discrete Pascal transform; Abstracts; Electronic publishing; Encyclopedias; Internet; Manganese;
Conference_Titel :
Signal Processing Conference, 2006 14th European
Conference_Location :
Florence
