Fast transform algorithms for signal processing
The document describes some fast transform algorithms for signal processing, with a precise description of all the routines developed, focusing on calling interfaces. The discrete theory point of view is taken, letting the reader refer to the continuous theory for a wider vision of the subject. All these algorithms are based on Cooley-Tukey flow graphs, and have been coded in C. These routines have been put in a library (libTR.a) for easier use. Some useful tools are described and then the coding of Fourier, Walsh, Paley, Hadamard and Haar transforms.
Bibliographic Reference: EUR 16328 FR (1995) 70pp., FS, free of charge
Availability: Available from the Public Relations and Publications Unit, JRC Ispra, I-21020 Ispra (IT)
Record Number: 199512189 / Last updated on: 1996-01-26
Original language: fr
Available languages: fr,en,fr