Efficient computation of the discrete Pascal transform

The recently proposed discrete Pascal transform possesses a computational complexity for an N-point vector of the order of N
²
for both multiplications and additions. In the present work an efficient structure is proposed, which eliminates the multiplications and halves the number of additions.