Browsing Engineering by Subject "Fast Fourier transform (FFT)"
Now showing items 1-1 of 1
-
Fast transform algorithm for legendre polynomial transforms
(2013)Let P={p0,p1,...,pn-1] denote the collection of the first n Legendre polynomials pk of degree k and let X={x0,x1,...,xn-1} be a set of n sample points. The Discrete Legendre polynomial transform (DLT) of an input ...