Fast Fourier Transform and Convolution Algorithms

Fast Fourier Transform and Convolution Algorithms
Author :
Publisher : Springer Science & Business Media
Total Pages : 260
Release :
ISBN-10 : 9783662005514
ISBN-13 : 3662005514
Rating : 4/5 (14 Downloads)

Book Synopsis Fast Fourier Transform and Convolution Algorithms by : H.J. Nussbaumer

Download or read book Fast Fourier Transform and Convolution Algorithms written by H.J. Nussbaumer and published by Springer Science & Business Media. This book was released on 2013-03-08 with total page 260 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents in a unified way the various fast algorithms that are used for the implementation of digital filters and the evaluation of discrete Fourier transforms. The book consists of eight chapters. The first two chapters are devoted to background information and to introductory material on number theory and polynomial algebra. This section is limited to the basic concepts as they apply to other parts of the book. Thus, we have restricted our discussion of number theory to congruences, primitive roots, quadratic residues, and to the properties of Mersenne and Fermat numbers. The section on polynomial algebra deals primarily with the divisibility and congruence properties of polynomials and with algebraic computational complexity. The rest of the book is focused directly on fast digital filtering and discrete Fourier transform algorithms. We have attempted to present these techniques in a unified way by using polynomial algebra as extensively as possible. This objective has led us to reformulate many of the algorithms which are discussed in the book. It has been our experience that such a presentation serves to clarify the relationship between the algorithms and often provides clues to improved computation techniques. Chapter 3 reviews the fast digital filtering algorithms, with emphasis on algebraic methods and on the evaluation of one-dimensional circular convolutions. Chapters 4 and 5 present the fast Fourier transform and the Winograd Fourier transform algorithm.


Fast Fourier Transform and Convolution Algorithms Related Books

Fast Fourier Transform and Convolution Algorithms
Language: en
Pages: 260
Authors: H.J. Nussbaumer
Categories: Mathematics
Type: BOOK - Published: 2013-03-08 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This book presents in a unified way the various fast algorithms that are used for the implementation of digital filters and the evaluation of discrete Fourier t
Algorithms for Discrete Fourier Transform and Convolution
Language: en
Pages: 363
Authors: Richard Tolimieri
Categories: Technology & Engineering
Type: BOOK - Published: 2013-06-29 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This easily accessible book provides a broad view of the latest developments in the field of fast digital signal processing algorithms. It bridges the gap betwe
DFT/FFT and Convolution Algorithms and Implementation
Language: en
Pages: 256
Authors: C. S. Burrus
Categories: Technology & Engineering
Type: BOOK - Published: 1985-01-18 - Publisher: Wiley-Interscience

DOWNLOAD EBOOK

This readable handbook provides complete coverage of both the theory and implementation of modern signal processing algorithms for computing the Discrete Fourie
Partitioned convolution algorithms for real-time auralization
Language: en
Pages: 278
Authors: Frank Wefers
Categories: Computers
Type: BOOK - Published: 2015-05-11 - Publisher: Logos Verlag Berlin GmbH

DOWNLOAD EBOOK

This work discusses methods for efficient audio processing with finite impulse response (FIR) filters. Such filters are widely used for high-quality acoustic si
Discrete and Continuous Fourier Transforms
Language: en
Pages: 423
Authors: Eleanor Chu
Categories: Mathematics
Type: BOOK - Published: 2008-03-19 - Publisher: CRC Press

DOWNLOAD EBOOK

Long employed in electrical engineering, the discrete Fourier transform (DFT) is now applied in a range of fields through the use of digital computers and fast