Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms

ISBN-10: 1420049968
ISBN-13: 9781420049961
Category: Mathematics
Pages: 336
Language: English
Published: 1999-11-11
Publisher: CRC Press
Authors: Alan George, Eleanor Chu

Description

Are some areas of fast Fourier transforms still unclear to you? Do the notation and vocabulary seem inconsistent? Does your knowledge of their algorithmic aspects feel incomplete? The fast Fourier transform represents one of the most important advancements in scientific and engineering computing. Until now, however, treatments have been either brief, cryptic, intimidating, or not published in the open literature. Inside the FFT Black Box brings the numerous and varied ideas together in a common notational framework, clarifying vague FFT concepts. Examples and diagrams explain algorithms completely, with consistent notation. This approach connects the algorithms explicitly to the underlying mathematics. Reviews and explanations of FFT ideas taken from engineering, mathematics, and computer science journals teach the computational techniques relevant to FFT. Two appendices familiarize readers with the design and analysis of computer algorithms, as well. This volume employs a unified and systematic approach to FFT. It closes the gap between brief textbook introductions and intimidating treatments in the FFT literature. Inside the FFT Black Box provides an up-to-date, self-contained guide for learning the FFT and the multitude of ideas and computing techniques it employs.

Get the book

Other editions

Inside the Fft Black Box
- 2019-08-30
- 336 pages
- Paperback
- CRC Press

Similar books

Fast Fourier Transform - Algorithms and Applications
By K.R. Rao, Do Nyeon Kim, Jae Jeong Hwang
ASSP 37, 665–675 (May 1989) P. Sathyanarayana, P.S. Reddy, M.N.S. Swamy, Interpolation of 2-D signals. IEEE Trans. CAS 37, 623–625 (May 1990) T. Smith, M.R. Smith, S.T. Nichols, Efficient sinc function interpolation techniques for ...
Discrete and Continuous Fourier Transforms: Analysis, Applications and Fast Algorithms
By Eleanor Chu
... FFTs exclusively. While Part II of this book is self-contained, the material in Chapters 11 through 13 is more advanced than the previous book: Eleanor Chu and Alan George, Inside the FFT Black Box: Serial and Parallel Fast Fourier ...
The Regularized Fast Hartley Transform: Optimal Formulation of Real-Data Fast Fourier Transform for Silicon-Based Implementation in Resource-Constrained Environments
By Keith Jones
The research described in The Regularized Fast Hartley Transform: Optimal Formulation of Real-Data Fast Fourier Transform for Silicon-Based Implementation in Resource-Constrained Environments deals with the problem by exploiting directly ...
CRC Concise Encyclopedia of Mathematics
By Eric W. Weisstein
See also CHVA THEOREM , DIRAC'S THEOREM , EULERIAN ́TAL'S CIRCUIT , EULER GRAPH , GRINBERG FORMULA , HAMILTONIAN GRAPH , HAMILTONIAN PATH , ICOSIAN GAME , KOZYREV- GRINBERG THEORY , ORE'S THEOREM , PO THEOREM , SMITH'S NETWORK THEOREM ...
Handbook of Linear Algebra
By Leslie Hogben
Indefinite Linear Algebra and Applications. Birkhäuser-Verlag, Basel, Switzerland, 2005. [HGK07] M. Hazewinkel, N. Gubareni, and V.V. Kirichenko. Algebras, Rings and Modules. Vol. 2. Springer, 2007. [HM95] R.A. Horn and D.I. Merino.
The Regularized Fast Hartley Transform: Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions
By Keith John Jones
Using the normalized definition of the DHT, as given by Eq. 3.1 – with a similar scaling ## Description : The real and imaginary components of the 40 3 The Discrete Hartley Transform 3.4.2 Complex-Data DFT 3.5 Fundamental Theorems for ...
Euro-Par 2021: Parallel Processing Workshops: Euro-Par 2021 International Workshops, Lisbon, Portugal, August 30-31, 2021, Revised Selected Papers
By Laura Ricci, Dora B. Heras, Andrea Bracciali
... Computing, pp. 1–15 (2013) 3. Boucher, S., et al.: Putting the “micro” back in microservice. In: 2018 USENIX Annual Technical Conference (USENIX ATC 2018), pp. 645–650 (2018) 4. Burns, B., et al.: Borg, omega, and kubernetes. Queue 14(1) ...
Principles of Fourier Analysis
By Kenneth B. Howell
Kenneth B. Howell. is a continuous function on (a, b). From part 3 we know | soda = X | voodo 0 k=1 **0 XXIV.(s) – W. (so)] k=1 = XXV (s) – XXV (so) = h(s) – h(so) k=1 k=1 So, s h(s) = h(so) + | g(o) do SO and h'6) = #160) #.
OpenCL Programming Guide
By Dan Ginsburg, Benedict Gaster, Timothy G. Mattson
Bill Mark subsequently went to work at NVIDIA, where he developed Cg. More recently, I have been working with Tim Foley at Intel, who has developed a new shading language called Spark. Spark takes shading languages to the next level by ...
Signals and Systems Analysis In Biomedical Engineering
By Robert B. Northrop
... FFT algorithm . 6.4.4 Discussion There are very good odds that you , the reader , will never need to develop your ... inside the FFT " black box , " however . Note that the FFT { f ( n ) } can be displayed as : [ F ( k ) | and ≤F ( k ) ...