Algorithms for Discrete Fourier Transform and Convolution

Descripción

Neuware -This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 284 pp. Englisch.

N° de ref. del artículo 9780387982618

Contactar al vendedor

Denunciar este artículo

Detalles bibliográficos

Título

Algorithms for Discrete Fourier Transform and Convolution

Editor

Springer New York, Springer US Okt 1997

Fecha de publicación

1997

Idioma

Inglés

ISBN 10

0387982612

ISBN 13

9780387982618

Encuadernación

Buch

Edición

2ª Edición

Estado

Neu

Acerca de