Title

Efficient computation of discrete polynomial transforms

Publication Date

10-2003

Journal

Signal Processing Letters, IEEE

Volume

10

Issue

10

First Page

285

Last Page

288

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

This document is currently not available here.

Share

COinS