Algorithms for Discrete Fourier Transform and Convolution

Author:   Richard Tolimieri ,  Myoung An ,  Chao Lu
Publisher:   Springer-Verlag New York Inc.
Edition:   2nd ed. 1997
ISBN:  

9780387982618


Pages:   268
Publication Date:   30 October 1997
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $287.76 Quantity:  
Add to Cart

Share |

Algorithms for Discrete Fourier Transform and Convolution


Add your own review!

Overview

The main goal of this graduate-level text is 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.

Full Product Details

Author:   Richard Tolimieri ,  Myoung An ,  Chao Lu
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2nd ed. 1997
Dimensions:   Width: 15.60cm , Height: 1.70cm , Length: 23.40cm
Weight:   1.270kg
ISBN:  

9780387982618


ISBN 10:   0387982612
Pages:   268
Publication Date:   30 October 1997
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List