Fast Fourier Transform Algorithms And Applications

Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems.

. . . that is what learning is. You suddenly understand something you've un­ derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies.

In the first edition of this book, we covered in Chapter 6 and 7 the applications to multidimensional convolutions and DFT's of the transforms which we have introduced, back in 1977, and called polynomial transforms. Since the publication of the first edition of this book, several important new developments concerning the polynomial transforms have taken place, and we have included, in this edition, a discussion of the relationship between DFT and convolution polynomial transform algorithms. This material is covered in Appendix A, along with a presentation of new convolution polynomial transform algorithms and with the application of polynomial transforms to the computation of multidimensional cosine transforms. We have found that the short convolution and polynomial product algorithms of Chap. 3 have been used extensively.

New technological innovations and advances in research in areas such as spectroscopy, computer tomography, signal processing, and data analysis require a deep understanding of function approximation using Fourier methods. To address this growing need, this monograph combines mathematical theory and numerical algorithms to offer a unified and self-contained presentation of Fourier analysis.

This volume is dedicated to
This book contains the method of chaos to detect the level of chaotic motion such as entropy, Lyapunov exponent, Poincare map, and phase-plane diagram.

Sampling is a fundamental topic in the engineering and physical sciences. This new edited book focuses on recent mathematical methods and theoretical developments, as well as some current central applications of the Classical Sampling Theorem. The Classical Sampling Theorem, which originated in the 19th century, is often associated with the names of Shannon, Kotelnikov, and Whittaker; and one of the features of this book is an English translation of the pioneering work in the 1930s by Kotelnikov, a Russian engineer. Following a technical overview and Kotelnikov's article, the book includes a wide and coherent range of mathematical ideas essential for modern sampling techniques.