Overview
- Authors:
-
-
Richard Tolimieri
-
Department of Electrical Engineering, City College of CUNY, New York, USA
-
Chao Lu
-
Department of Computer and Information Sciences, Towson State University, Towson, USA
-
Myoung An
-
A.J. Devaney Associates, Allston, USA
- Provides a broad view of the latest developments in the field of fast digital signal processing algorithms - Provides procedures that simplify or even automate the task of writing code for the newest parallel and vector machines
Access this book
Other ways to access
Table of contents (15 chapters)
-
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 1-25
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 27-54
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 55-70
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 71-90
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 91-100
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 101-135
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 137-145
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 147-154
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 155-172
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 173-191
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 193-202
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 203-215
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 217-227
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 229-248
-
- Richard Tolimieri, Chao Lu, Myoung An
Pages 249-264
-
Back Matter
Pages 265-267
About this book
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.
Authors and Affiliations
-
Department of Electrical Engineering, City College of CUNY, New York, USA
Richard Tolimieri
-
Department of Computer and Information Sciences, Towson State University, Towson, USA
Chao Lu
-
A.J. Devaney Associates, Allston, USA
Myoung An
