Skip to main content

Timeline for FFT and Butterfly Diagram

Current License: CC BY-SA 3.0

10 events
when toggle format what by license comment
Jun 12, 2012 at 13:22 vote accept Papiro
Jun 4, 2012 at 20:13 comment added Peter McNamara quoth the FAQ: "research level math questions" Doesn't this belong on math.SE?
Jun 4, 2012 at 19:46 answer added Barry Cipra timeline score: 3
Jun 4, 2012 at 18:39 history edited Papiro CC BY-SA 3.0
deleted 201 characters in body
Jun 4, 2012 at 17:50 comment added Papiro @Patricia Hersh: Thank you! Unfortunatelly, I have no access to Leighton's book. BTW, Oppenheim and Schafer, Digital Signal Processing, Prentice Hall, 1975, Fig. 6.3, pp. 291, presents a "Flow graph of... DFT computations (N=8)". Fig. 6.8, pp. 296, "Flow graph of basic butterfly computation...".
Jun 4, 2012 at 15:35 comment added Patricia Hersh The book I mentioned by Leighton indeed says on p. 778 "The butterfly network has its origins in the early work on discrete Fourier transforms". Various references for this and related networks are given in the bibliographic notes for Section 3.2 of Leighton's book.
Jun 4, 2012 at 15:14 history edited Papiro CC BY-SA 3.0
added 18 characters in body
Jun 4, 2012 at 15:07 comment added cardinal Is the question asking for a reference to the first presentation of the butterfly diagram? Or, is it asking if the butterfly diagram was presented in the first discovery of the FFT? I believe it's the former, but I'm unsure. Regarding the latter, it seems unlikely given the FFT was known to Gauss.
Jun 4, 2012 at 12:18 comment added Patricia Hersh You might find the answer in the textbook "Introduction to parallel algorithms and architectures: arrays, trees, hypercubes" by Frank Thomson Leighton. He certainly discusses the FFT and butterfly diagram in the graduate course he teaches in conjunction with this book, or at least he did in the 90s.
Jun 4, 2012 at 10:52 history asked Papiro CC BY-SA 3.0