Skip to main content
Article
Efficient computation of discrete polynomial transforms
Signal Processing Letters, IEEE
  • Maurice F. Aburdene, Bucknell University
  • Xie Jin
  • R. J. Kozick
Publication Date
10-1-2003
Volume
10
Issue
10
Disciplines
Abstract

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 ( )

Citation Information
Maurice F. Aburdene, Xie Jin and R. J. Kozick. "Efficient computation of discrete polynomial transforms" Signal Processing Letters, IEEE (2003) p. 285 - 288
Available at: http://works.bepress.com/maurice_aburdene/11/