Discrete and Continuous Fourier Transforms
Analysis, Applications and Fast Algorithms
Published on 19. March 2008
424 pages
978-1-4200-6364-6 (ISBN)
Description
Long employed in electrical engineering, the discrete Fourier transform (DFT) is now applied in a range of fields through the use of digital computers and fast Fourier transform (FFT) algorithms. But to correctly interpret DFT results, it is essential to understand the core and tools of Fourier analysis. Discrete and Continuous Fourier Transform
More details
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
Professional and scholarly
Senior undergraduate and graduate students, researchers, and professionals in mathematics, computer science, engineering, and physics.
Illustrations
115 s/w Abbildungen
115 b/w images
File size
6,91 MB
ISBN-13
978-1-4200-6364-6 (9781420063646)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
12/2019
1st Edition
Chapman & Hall/CRC
€126.30
Shipment within 15-20 days
Book
03/2008
1st Edition
Chapman & Hall/CRC
€282.73
Shipment within 15-20 days
Content
Preface. Analytical and Graphical Representation of Function Contents. Sampling and Reconstruction of Functions-Part I. The Fourier Series. DFT and Sampled Signals. Sampling and Reconstruction of Functions-Part II. Sampling and Reconstruction of Functions-Part III. The Fourier Transform of a Sequence. The Discrete Fourier Transform of a Windowed Sequence. Discrete Convolution and the DFT. Applications of the DFT in Digital Filtering and Filters. Index Mapping and Mixed-Radix FFTs. Kronecker Product Factorization and FFTs. The Family of Prime Factor FFT Algorithms. On Computing the DFT of Large Prime Length. Bibliography. Index.
