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 machin
Algorithms for Discrete Fourier Transform and Convolution
โ Scribed by R. Tolimieri, Myoung An, Chao Lu (auth.), C. S. Burrus (eds.)
- Publisher
- Springer New York
- Year
- 1989
- Tongue
- English
- Leaves
- 363
- Series
- Signal Processing and Digital Filtering
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
Front Matter....Pages i-xv
Introduction to Abstract Algebra....Pages 1-35
Tensor Product and Stride Permutation....Pages 36-71
Cooley-Tukey FFT Algorithms....Pages 72-93
Variants of FFT Algorithm and Their Implementations....Pages 94-118
Good-Thomas PFA....Pages 119-131
Linear and Cyclic Convolution....Pages 132-175
Agarwal-Cooley Convolution Algorithm....Pages 176-186
Introduction to Multiplicative Fourier Transform Algorithm (MFTA)....Pages 187-197
MFTA : The Prime Case....Pages 198-221
MFTA : Product of Two Distinct Primes....Pages 222-245
MFTA : Transform Size N = Mr M -Composite Integer and r -Prime....Pages 246-261
MFTA : Transform Size N = p 2 ....Pages 262-279
Periodization and Decimation....Pages 280-294
Multiplicative Characters and the FFT....Pages 295-321
Rationality....Pages 322-347
Back Matter....Pages 348-350
โฆ Subjects
Communications Engineering, Networks;Algorithm Analysis and Problem Complexity
๐ SIMILAR VOLUMES
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 machin
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 machin
<p>In the first edition of this book, we covered in Chapter 6 and 7 the applications to multidimensional convolutions and DFT's of the transforms which we have introduced, back in 1977, and called polynomial transforms. Since the publication of the first edition of this book, several important new d
<p>In the first edition of this book, we covered in Chapter 6 and 7 the applications to multidimensional convolutions and DFT's of the transforms which we have introduced, back in 1977, and called polynomial transforms. Since the publication of the first edition of this book, several important new d