Fast Fourier Transform and Convolution Algorithms

Fast Fourier Transform and Convolution Algorithms PDF

Author: H.J. Nussbaumer

Publisher: Springer Science & Business Media

Published: 2013-03-08

Total Pages: 260

ISBN-13: 3662005514

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 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.

DFT/FFT and Convolution Algorithms and Implementation

DFT/FFT and Convolution Algorithms and Implementation PDF

Author: C. S. Burrus

Publisher: Wiley-Interscience

Published: 1985-01-18

Total Pages: 256

ISBN-13: 9780471819325

DOWNLOAD EBOOK →

This readable handbook provides complete coverage of both the theory and implementation of modern signal processing algorithms for computing the Discrete Fourier transform. Reviews continuous and discrete-time transform analysis of signals and properties of DFT, several ways to compute the DFT at a few frequencies, and the three main approaches to an FFT. Practical, tested FORTRAN and assembly language programs are included with enough theory to adapt them to particular applications. Compares and evaluates various algorithms.

Algorithms for Discrete Fourier Transform and Convolution

Algorithms for Discrete Fourier Transform and Convolution PDF

Author: Richard Tolimieri

Publisher: Springer Science & Business Media

Published: 2013-03-09

Total Pages: 273

ISBN-13: 1475727674

DOWNLOAD EBOOK →

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 machines. It thus bridges the gap between digital signal processing algorithms and their implementation on a variety of computing platforms. The mathematical concept of tensor product is a recurring theme throughout the book, since these formulations highlight the data flow, which is especially important on supercomputers. Because of their importance in many applications, much of the discussion centres on algorithms related to the finite Fourier transform and to multiplicative FFT algorithms.

Fast Fourier Transforms

Fast Fourier Transforms PDF

Author: C. Sidney Burrus

Publisher: Lulu.com

Published: 2012-11-30

Total Pages: 256

ISBN-13: 1300461640

DOWNLOAD EBOOK →

This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are provided.

Fast Fourier Transform - Algorithms and Applications

Fast Fourier Transform - Algorithms and Applications PDF

Author: K.R. Rao

Publisher: Springer Science & Business Media

Published: 2011-02-21

Total Pages: 437

ISBN-13: 1402066295

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 and audio signal processing. As fields like communications, speech and image processing, and related areas are rapidly developing, the FFT as one of essential parts in digital signal processing has been widely used. Thus there is a pressing need from instructors and students for a book dealing with the latest FFT topics. This book provides thorough and detailed explanation of important or up-to-date FFTs. It also has adopted modern approaches like MATLAB examples and projects for better understanding of diverse FFTs.

Partitioned convolution algorithms for real-time auralization

Partitioned convolution algorithms for real-time auralization PDF

Author: Frank Wefers

Publisher: Logos Verlag Berlin GmbH

Published: 2015-05-11

Total Pages: 278

ISBN-13: 3832539433

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 signal processing, e.g. for headphone or loudspeaker equalization, in binaural synthesis, in spatial sound reproduction techniques and for the auralization of reverberant environments. This work focuses on real-time applications, where the audio processing is subject to minimal delays (latencies). Different fast convolution concepts (transform-based, interpolation-based and number-theoretic), which are used to implement FIR filters efficiently, are examined regarding their applicability in real-time. These fast, elementary techniques can be further improved by the concept of partitioned convolution. This work introduces a classification and a general framework for partitioned convolution algorithms and analyzes the algorithmic classes which are relevant for real-time filtering: Elementary concepts which do not partition the filter impulse response (e.g. regular Overlap-Add and Overlap-Save convolution) and advanced techniques, which partition filters uniformly and non-uniformly. The algorithms are thereby regarded in their analytic complexity, their performance on target hardware, the optimal choice of parameters, assemblies of multiple filters, multi-channel processing and the exchange of filter impulse responses without audible artifacts. Suitable convolution techniques are identified for different types of audio applications, ranging from resource-aware auralizations on mobile devices to extensive room acoustics audio rendering using dedicated multi-processor systems.

Discrete and Continuous Fourier Transforms

Discrete and Continuous Fourier Transforms PDF

Author: Eleanor Chu

Publisher: CRC Press

Published: 2008-03-19

Total Pages: 272

ISBN-13: 1000687570

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 Fourier transform (FFT) algorithms. But to correctly interpret DFT results, it is essential to understand the core and tools of Fourier analysis. Discrete and Continuous Fourier Transform

The Fast Fourier Transform

The Fast Fourier Transform PDF

Author: E. Oran Brigham

Publisher: Prentice Hall

Published: 1974

Total Pages: 272

ISBN-13:

DOWNLOAD EBOOK →

The fourier transform; Fourier transform properties; Convolution and correlation; Fourier series and sampled waveforms; The discrete fourier transform; Discrete convolutiion and correlation; Applying the discrete fourier transform.