Transforms and fast algorithms for signal analysis and representations
Author(s)
Bibliographic Information
Transforms and fast algorithms for signal analysis and representations
(Applied and numerical harmonic analysis / series editor, John J. Benedetto)
Birkhauser, c2004
- : Boston
- : Berlin
Available at / 8 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
This book is a comprehensive presentation of recent results and developments on several widely used transforms and their fast algorithms. In many cases, new options are provided for improved or new fast algorithms, some of which are not well known in the digital signal processing community. The book is suitable as a textbook for senior undergraduate and graduate courses in digital signal processing. It may also serve as an excellent self-study reference for electrical engineers and applied mathematicians whose work is related to the fields of electronics, signal processing, image and speech processing, or digital design and communication.
Table of Contents
Introduction Polynomial Transforms and Their Fast Algorithms Fast Fourier Transform Algorithms Fast Algorithms for 1D Discrete Hartley Transforms Fast Algorithms for MD Discrete Hartley Transforms Fast Algorithms for 1D Discrete Cosine Transforms Fast Algorithms for MD Discrete Cosine Transform Integer Transforms and Fast Algorithms New Methods of Time-Frequency Analysis Index
by "Nielsen BookData"