Mathematics of Multidimensional Fourier Transform Algorithms
Title | Mathematics of Multidimensional Fourier Transform Algorithms PDF eBook |
Author | Richard Tolimieri |
Publisher | Springer Science & Business Media |
Pages | 241 |
Release | 2012-12-06 |
Genre | Technology & Engineering |
ISBN | 1468402056 |
The main emphasis of this book is the development of algorithms for processing multi-dimensional digital signals, and particularly algorithms for multi-dimensional Fourier transforms, in a form that is convenient for writing highly efficient code on a variety of vector and parallel computers.
Mathematics of Multidimensional Fourier Transform Alogrithms
Title | Mathematics of Multidimensional Fourier Transform Alogrithms PDF eBook |
Author | Richard Tolimieri |
Publisher | |
Pages | 256 |
Release | 1993 |
Genre | Mathematics |
ISBN |
Fast Fourier Transform and Convolution Algorithms
Title | Fast Fourier Transform and Convolution Algorithms PDF eBook |
Author | H.J. Nussbaumer |
Publisher | Springer Science & Business Media |
Pages | 260 |
Release | 2013-03-08 |
Genre | Mathematics |
ISBN | 3662005514 |
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
Title | Fast Fourier Transform and Convolution Algorithms PDF eBook |
Author | Henri J Nussbaumer |
Publisher | |
Pages | 292 |
Release | 1982-09-01 |
Genre | |
ISBN | 9783642818981 |
Multidimensional Discrete Unitary Transforms
Title | Multidimensional Discrete Unitary Transforms PDF eBook |
Author | Artyom M. Grigoryan |
Publisher | CRC Press |
Pages | 540 |
Release | 2003-07-31 |
Genre | Computers |
ISBN | 1482276321 |
This reference presents a more efficient, flexible, and manageable approach to unitary transform calculation and examines novel concepts in the design, classification, and management of fast algorithms for different transforms in one-, two-, and multidimensional cases. Illustrating methods to construct new unitary transforms for best algorithm sele
Computational Frameworks for the Fast Fourier Transform
Title | Computational Frameworks for the Fast Fourier Transform PDF eBook |
Author | Charles Van Loan |
Publisher | SIAM |
Pages | 285 |
Release | 1992-01-01 |
Genre | Mathematics |
ISBN | 0898712858 |
The author captures the interplay between mathematics and the design of effective numerical algorithms.
Fast Fourier Transforms
Title | Fast Fourier Transforms PDF eBook |
Author | C. Sidney Burrus |
Publisher | Lulu.com |
Pages | 256 |
Release | 2012-11-30 |
Genre | Technology & Engineering |
ISBN | 1300461640 |
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.