Fast Fourier Transform - Algorithms and Applications (Hardcover, 2010)

Fast Fourier Transform presents an introduction to the principles of the fast Fourier transform. This book covers FFTs, frequency domain filtering, and applications to video and audio signal processing. As fields like communications, speech and image processing, and related areas are rapidly developing, the FFT as one of essential parts in digital signal processing has been widely used. Thus there is a pressing need from instructors and students for a book dealing with the latest FFT topics.Fast Fourier Transform provides thorough and detailed explanation of important or up-to-date FFTs. It also has adopted modern approaches like MATLAB examples and projects for better understanding of diverse FFTs. Fast Fourier transform (FFT) is an efficient implementation of the discrete Fourier transform (DFT). Of all the discrete transforms, DFT is most widely used in digital signal processing. The emphasis of the book is on the foundation of FFTs such as the decimation-in-time FFT, decimation-in-frequency FFT algorithms, integer FFT, prime factor DFT and so on.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Signals and Communication Technology
Release date:	October 2010
First published:	October 2010
Authors:	K.R. Rao • Do Nyeon Kim • Jae Jeong Hwang
Dimensions:	235 x 155 x 32mm (L x W x T)
Format:	Hardcover
Pages:	426
Edition:	2010
ISBN-13:	978-1-4020-6628-3
Categories:	Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Functional analysis Promotions
LSN:	1-4020-6628-7
Barcode:	9781402066283

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!