Algorithms for discrete fourier transform and convolution
著者
書誌事項
Algorithms for discrete fourier transform and convolution
Springer-Verlag, c1989
- : us
- : gw
大学図書館所蔵 件 / 全25件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This is a broad view of the latest developments in the field of fast Digital Signal Processing (DSP) algorithms. The purpose of this book is to offer a textbook for graduate courses and a reference book of DSP algorithms for those who are in the field of signal processing. It attempts to bridge the gap between DSP algorithms and their implementation on a variety of serial and super computers. The mathematical concept of tensor product can be matched to machine implementation, and the tensor product formulation of DSP algorithms provides computer implementation options. Modifications of Winograd FFT algorithms are presented with a diversity of arithmetic (multiplication and addition) choices. The methods of tensor product formulation of DSP algorithms and multiplicative algorithms for different transform sizes are all new. The method of presenting an algorithm by its algebra structure which matches the computer architecture is a highlight of this text.
目次
Contents: Introduction to Abstract Algebra.- Tensor Product and Stride Permutation.- Cooley-Tukey FFF Algorithms.- Variants of FFT Algorithms and Their Implementations.- Good-Thomas PFA.- Linear and Cyclic Convolutions.- Agarwal-Cooley Convolution Algorithm.- Introduction to Multiplicative Fourier Transform Algorithms (MFTA).- MFTA: The Prime Case.- MFTA: Product of Two Distinct Primes.- MFTA: Transform Size N = Mr. M-Composite Integer and r-Prime.- MFTA: Transform Size N = p2.- Periodization and Decimation.- Multiplicative Character and the FFT.- Rationality.- Index.
「Nielsen BookData」 より
