Comments on "Selection criteria for efficient implementation of FFT algorithms

[1]  C. Burrus,et al.  An in-place, in-order prime factor FFT algorithm , 1981 .

[2]  D. Luenberger.  An introduction to observers , 1971 .

[3]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[4]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[5]  D. Luenberger.  Observing the State of a Linear System , 1964, IEEE Transactions on Military Electronics.

[6]  G. D. Bergland,et al.  A guided tour of the fast Fourier transform , 1969, IEEE Spectrum.

[7]  G.H. Hostetter.  Fourier analysis using spectral observers , 1980, Proceedings of the IEEE.

[8]  J. Tukey,et al.  Modern techniques of power spectrum estimation , 1967, IEEE Transactions on Audio and Electroacoustics.

[9]  Peter D. Welch,et al.  Fast Fourier Transform , 2011, Starting Digital Signal Processing in Telecommunication Engineering.

[10]  J. Blanken,et al.  Selection criteria for efficient implementation of FFT algorithms , 1982 .

[11]  Joseph H. Rothweiler.  Implementation of the in-order prime factor transform for variable sizes , 1982 .