Efficient computation of discrete polynomial transforms
This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )
Signal Processing Letters, IEEE
Aburdene, Maurice F.; Jin, Xie; and Kozick, R. J.. "Efficient computation of discrete polynomial transforms." Signal Processing Letters, IEEE (2003) : 285-288.