John K. Gotwals
- 1.Enders A. Robinson, 'A Historical Perspective of Spectrum Estimation," Proceedings of the IEEE, Vol. 70, No. 9, 885- 907 (1982).Google Scholar
Cross Ref
- 2.Douglas F. Elliott and K. Ramamohan Rao, Fast, Transforms, Academic Press, Orlando, Florida, 1982.Google Scholar
- 3.E. Oran Brigham, T h~__?as~t .. ~ou~{i_e~-~Tran~f~~rm, Prentice-Hall, Englewood Cliffs, New Jersey, 1974.Google Scholar
- 4.Data Translation Inc., 100 Locke Drive, Marlboro, NA, 01752.Google Scholar
- 5.Techmar, 6225 Cochran Road, Cleveland, OH, 44139, specializes on IBN peripherals.Google Scholar
- 6.Steve Weitzner, "Poor strategy for a rich technology," Electronic Products, Vol. 26, No. 15, 9 (1984).Google Scholar
- 7.Winn L. Rosch, "LOGO Goes Professional," Hardcop~, Vol. 13, No. 7, 27-32 (1984).Google Scholar
- 8.P. Lemmons, "The Standards Craze," B_B_B_~, Vol. 9, No. 1, 5 (1984).Google Scholar
- 9.C. Gordon Bell, "Standards can help us," Computer, Vo}. 17, No. 6, 71-78 (1984).Google ScholarDigital Library
- 10.Borland International, 4113 Scotts Valley Drive, Scotts Valley, CA 95066.Google Scholar
- 11.NL Computer Systems, 1910 Newman Road, W. Lafayette, IN 47906.Google Scholar
- 12.Peter M. Kogge, "An Architectural Trail to Threaded-Code Systems," Computer, Vol. 15, No. 3, 22-32 (1982).Google ScholarDigital Library
- 13.J. S. Cooley and J. W. Tuke~, "An algorithm for the machine calculation of Fourier series," Math. Comput., Vol. 19, 297- 301 (1965).Google ScholarCross Ref
- 14.Ronald N. Bracewell, "The Fast Hartley Transform," Proceedinffs of the {BEE, Vol. 72, No. 8, 1010-1018 (1984).Google Scholar
- Performing the fast Fourier transform with a personal computer
Recommendations
Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
Fast Fourier transform (FFT)-based computations can be far more accurate than the slow transforms suggest. Discrete Fourier transforms computed through the FFT are far more accurate than slow transforms, and convolutions computed via FFT are far more ...
Split vector-radix fast Fourier transform
The split-radix approach for computing the discrete Fourier transform (DFT) is extended for the vector-radix fast Fourier transform (FFT) to two and higher dimensions. It is obtained by further splitting the ( N /2× N /2) transforms with twiddle factors ...
A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform
In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplisbed by performing the cyclic convolution, required by Winograd's method, with the ...
Comments