Showing papers on "Split-radix FFT algorithm published in 1968"
TL;DR: The problem of computing N Chebyshev coefficients is considered when , and two methods are discussed.
Abstract: The problem of computing N Chebyshev coefficients is considered when . Two methods are discussed. The first method is related to the Fast Fourier Transform (FFT) and required a total number of operations proportional to N log2 N. The second method, although not as efficient as efficient as the FFT exemplified interesting properties of the discrete Chebyshev polynomials.
12 citations