Algorithms for Discrete Fourier Transform and Convolution / Edition 2

Algorithms for Discrete Fourier Transform and Convolution / Edition 2

by Richard tolimieri, Myoung An, Chao Lu
     
 

View All Available Formats & Editions

ISBN-10: 1441931155

ISBN-13: 9781441931153

Pub. Date: 12/06/2010

Publisher: Springer New York

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

Overview

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.

Product Details

ISBN-13:
9781441931153
Publisher:
Springer New York
Publication date:
12/06/2010
Series:
Signal Processing and Digital Filtering Series
Edition description:
Softcover reprint of hardcover 2nd ed. 1997
Pages:
268
Product dimensions:
6.10(w) x 9.25(h) x 0.24(d)

Table of Contents

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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >