Fast Fourier Transform and Convolution Algorithms

Fast Fourier Transform and Convolution Algorithms

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.


Algorithms for Discrete Fourier Transform and Convolution

Algorithms for Discrete Fourier Transform and Convolution

Author: Richard Tolimieri

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 363

ISBN-13: 1475738544

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 between DSP algorithms and their implementation on a variety of serial and super computers.


DFT/FFT and Convolution Algorithms and Implementation

DFT/FFT and Convolution Algorithms and Implementation

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.


Fast Fourier Transform - Algorithms and Applications

Fast Fourier Transform - Algorithms and Applications

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

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

Author: Eleanor Chu

Publisher: CRC Press

Published: 2008-03-19

Total Pages: 423

ISBN-13: 1420063642

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

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.


Fast Fourier Transform Algorithms for Parallel Computers

Fast Fourier Transform Algorithms for Parallel Computers

Author: Daisuke Takahashi

Publisher: Springer Nature

Published: 2019-10-05

Total Pages: 120

ISBN-13: 9811399654

DOWNLOAD EBOOK

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. Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniques relevant to the FFT in state-of-the-art parallel computers. Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers.


Digital Signal Processing Algorithms

Digital Signal Processing Algorithms

Author: Hari Krishna

Publisher:

Published: 2017

Total Pages:

ISBN-13: 9781351454957

DOWNLOAD EBOOK

"Digital Signal Processing Algorithms describes computational number theory and its applications to deriving fast algorithms for digital signal processing. It demonstrates the importance of computational number theory in the design of digital signal processing algorithms and clearly describes the nature and structure of the algorithms themselves. The book has two primary focuses: first, it establishes the properties of discrete-time sequence indices and their corresponding fast algorithms; and second, it investigates the properties of the discrete-time sequences and the corresponding fast algorithms for processing these sequences. Digital Signal Processing Algorithms examines three of the most common computational tasks that occur in digital signal processing; namely, cyclic convolution, acyclic convolution, and discrete Fourier transformation. The application of number theory to deriving fast and efficient algorithms for these three and related computationally intensive tasks is clearly discussed and illustrated with examples. Its comprehensive coverage of digital signal processing, computer arithmetic, and coding theory makes Digital Signal Processing Algorithms an excellent reference for practicing engineers. The authors' intent to demystify the abstract nature of number theory and the related algebra is evident throughout the text, providing clear and precise coverage of the quickly evolving field of digital signal processing."--Provided by publisher.


Mathematics of the Discrete Fourier Transform (DFT)

Mathematics of the Discrete Fourier Transform (DFT)

Author: Julius O. Smith

Publisher: Julius Smith

Published: 2008

Total Pages: 323

ISBN-13: 097456074X

DOWNLOAD EBOOK

"The DFT can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, and that is the focus of this book. The DFT is normally encountered as the Fast Fourier Transform (FFT)--a high-speed algorithm for computing the DFT. The FFT is used extensively in a wide range of digital signal processing applications, including spectrum analysis, high-speed convolution (linear filtering), filter banks, signal detection and estimation, system identification, audio compression (such as MPEG-II AAC), spectral modeling sound synthesis, and many others. In this book, certain topics in digital audio signal processing are introduced as example applications of the DFT"--Back cover