论文信息 - Deriving the Fast Fourier Algorithm by Calculation

Deriving the Fast Fourier Algorithm by Calculation

This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran [1] and Bird and Meertens [2, 3]. We have claimed that these techniques are applicable to digital signal processing circuits, and have previously applied them to regular array circuits [4, 5, 6].

Geraint Jones | Geraint Jones

[1] Manfred Broy,et al. Logic of Programming and Calculi of Discrete Design , 1987, NATO ASI Series.

[2] Peter B. Denyer,et al. VLSI Signal Processing: A Bit-Serial Approach , 1985 .

[3] Mary Sheeran,et al. Timeless Truths about Sequential Circuits , 1988 .

[4] Roland Carl Backhouse. Making Formality Work For Us , 1989 .

[5] K. Mani Chandy,et al. Parallel program design - a foundation , 1988 .

[6] M. Sheeran. Design and verification of regular synchronous circuits , 1986 .

[7] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .

[8] Richard S. Bird,et al. Lectures on Constructive Functional Programming , 1989 .

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

[10] K. Mani Chandy. Parallel program design , 1989 .

[11] Richard S. Bird,et al. An introduction to the theory of lists , 1987 .

[12] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[13] W. Luk,et al. The derivation of regular synchronous circuits , 1988, [1988] Proceedings. International Conference on Systolic Arrays.