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
The Fast Fourier Transform and Its Applications
Language: en
Pages: 474
Authors: E. Oran Brigham
Categories: Mathematics
Type: BOOK - Published: 1988 - Publisher: Pearson

DOWNLOAD EBOOK

The Fast Fourier Transform (FFT) is a mathematical method widely used in signal processing. This book focuses on the application of the FFT in a variety of area
Computational Frameworks for the Fast Fourier Transform
Language: en
Pages: 285
Authors: Charles Van Loan
Categories: Mathematics
Type: BOOK - Published: 1992-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

The author captures the interplay between mathematics and the design of effective numerical algorithms.
Fast Fourier Transform - Algorithms and Applications
Language: en
Pages: 437
Authors: K.R. Rao
Categories: Mathematics
Type: BOOK - Published: 2011-02-21 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This book presents an introduction to the principles of the fast Fourier transform. This book covers FFTs, frequency domain filtering, and applications to video
The Fast Fourier Transform
Language: en
Pages: 272
Authors: E. Oran Brigham
Categories: Mathematics
Type: BOOK - Published: 1974 - Publisher: Prentice Hall

DOWNLOAD EBOOK

The fourier transform; Fourier transform properties; Convolution and correlation; Fourier series and sampled waveforms; The discrete fourier transform; Discrete