Algorithms for Discrete Fourier Transform and Convolution
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
181.89 €
Produktdetails
Produktinformationen zu „Algorithms for Discrete Fourier Transform and Convolution “
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.
Klappentext zu „Algorithms for Discrete Fourier Transform and Convolution “
The main goal of this graduate-level textis to provide a language for understanding, unifying , and implementing a wide variety of algorithms for dgital signal processing -- in particular, to provide ruls 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: tensor product factors have a direct interpretation on on many vector and parallel computers and tensor product idetities can be matched to machine implementation. These formulations also highlight the data flow, which is is especially important on supercomputers, where data flow may be the factor limiting the efficiency of a computation. Because of its importance in many appications, much of the discussion centers on algorithms related to the finite Fourier transform and to multiplicative FFT algorithms; other topics covered include convolution algorithms and prime-factor algorithms. This second edition has been revised and brought up to date throughout.
Inhaltsverzeichnis zu „Algorithms for Discrete Fourier Transform and Convolution “
1 Review of Applied Algebra.- 2 Tensor Product and Stride Permutation.- 3 Cooley-Tukey FFT Algorithms.- 4 Variants of FT Algorithms and Implementations.- 5 Good-Thomas PFA.- 6 Linear and Cyclic Convolutions.- 7 Agarwal-Cooley Convolution Algorithm.- 8 Multiplicative Fourier Transform Algorithm.- 9 MFTA: The Prime Case.- 10 MFTA: Product of Two Distinct Primes.- 11 MFTA: Composite Size.- 12 MFTA: p2.- 13 Periodization and Decimation.- 14 Multiplicative Characters and the FT.- 15 Rationality.
Bibliographische Angaben
- Autoren: Richard Tolimieri , Myoung An , Chao Lu
- 1997, 2nd ed., 268 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer, New York
- ISBN-10: 0387982612
- ISBN-13: 9780387982618
- Erscheinungsdatum: 30.10.1997
Sprache:
Englisch
Kommentar zu "Algorithms for Discrete Fourier Transform and Convolution"
0 Gebrauchte Artikel zu „Algorithms for Discrete Fourier Transform and Convolution“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Algorithms for Discrete Fourier Transform and Convolution".
Kommentar verfassen