Fast Fourier Transform and Convolution Algorithms

✍ Scribed by Dr. Henri J. Nussbaumer (auth.)

Publisher: Springer Berlin Heidelberg
Year: 1981
Tongue: English
Leaves: 259
Series: Springer Series in Information Sciences 2
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Front Matter....Pages I-X
Introduction....Pages 1-3
Elements of Number Theory and Polynomial Algebra....Pages 4-31
Fast Convolution Algorithms....Pages 32-79
The Fast Fourier Transform....Pages 80-111
Linear Filtering Computation of Discrete Fourier Transforms....Pages 112-150
Polynomial Transforms....Pages 151-180
Computation of Discrete Fourier Transforms by Polynomial Transforms....Pages 181-210
Number Theoretic Transforms....Pages 211-240
Back Matter....Pages 241-250

✦ Subjects

Numerical Analysis

📜 SIMILAR VOLUMES

Fast Fourier Transform and Convolution A

📁 Fast Fourier Transform and Convolution Algorithms

✍ Professor Henri J. Nussbaumer (auth.) 📂 Library 📅 1982 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

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 d

Fast Fourier Transform and Convolution A

📁 Fast Fourier Transform and Convolution Algorithms

✍ Professor Henri J. Nussbaumer (auth.) 📂 Library 📅 1982 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

Fast Fourier transform and convolution a

📁 Fast Fourier transform and convolution algorithms

✍ Nussbaumer H.J. 📂 Library 📅 1981 🏛 Springer 🌐 English

Algorithms for discrete Fourier transfor

📁 Algorithms for discrete Fourier transform and convolution

✍ Tolimieri R., An M., Lu C. 📂 Library 📅 1997 🏛 Springer 🌐 English

This graduate-level text provides a language for understanding, unifying, and implementing a wide variety of algorithms for digital signal processing - in particular, to provide rules and procedures that can simplify or even automate the task of writing code for the newest parallel and vector machin

Algorithms for Discrete Fourier Transfor

📁 Algorithms for Discrete Fourier Transform and Convolution

✍ R. Tolimieri, Myoung An, Chao Lu (auth.), C. S. Burrus (eds.) 📂 Library 📅 1989 🏛 Springer New York 🌐 English

Fast Fourier Transform - Algorithms and

📁 Fast Fourier Transform - Algorithms and Applications

✍ K.R. Rao, D.N. Kim, J.-J. Hwang (auth.) 📂 Library 📅 2010 🏛 Springer Netherlands 🌐 English

Fast Fourier Transform - Algorithms and Applications presents an introduction to the principles of the fast Fourier transform (FFT). It covers FFTs, frequency domain filtering, and applications to video and audio signal processing.As fields like communications, speech and image