Life in the Fast Lane: Yates’s Alogrithm, Fast Fourier and Walsh Transforms
Orthogonal functions play an important role in factorial experiments and time series models. In the latter half of the twentieth century orthogonal functions became prominent in industrial experimentation methodologies that employ complete and fractional factorial experiment designs, such as Taguchi orthogonal arrays. Exact estimates of the parameters of linear model representations can be computed effectively and efficiently using “fast algorithms.” The origin of “fast algorithms” can be traced to Yates in 1937. In 1958 Good created the ingenious fast Fourier transform, using Yates’s concept as a basis. This paper is intended to illustrate the fundamental role of orthogonal functions in modeling, and the close relationship between two of the most significant of the fast algorithms. This in turn yields insights into the fundamental aspects of experiment design.
KeywordsFast Fourier Transform Discrete Fourier Transform Modeling Uncertainty Fast Algorithm Generate Vector
Unable to display preview. Download preview PDF.
- Beauchamp, K.G. (1984), “Applications of Walsh and related functions.” Aca-demic Press, London.Google Scholar
- Heideman, M.T., D. H. Johnson, and C. S. Burrus. (1984), “Gauss and the History of the Fast Fourier Transform.” IEEE ASSP Magazine, Oct. 1984, 14–21.Google Scholar
- Hoadley, A.B., and J. R. Kettenring. (1990), “Communications Between Statisticians and Engineers/Physical Scientists.” Technometrics Vol 32No. 3,243–247.Google Scholar
- Nelson, L.S. (1982), “Analysis of Two-Level Factorial Experiments.” JQT Vol 14,2, 95–98.Google Scholar
- Yates, F. (1937), “The Design and Analysis of Factorial Experiments.” Technical Communication No. 35, Imperial Bureau of Soil Science, London.Google Scholar