Fast Fourier Transforms
by C. Sidney Burrus, at al.
Publisher: Connexions 2008
Number of pages: 254
This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are provided.
Home page url
Download or read it online for free here:
by Vedran Kordic - InTech
The Kalman filter has been successfully employed in diverse knowledge areas over the last 50 years. The aim of this book is to provide an overview of recent developments in Kalman filter theory and their applications in engineering and science.
by Raghu Raj Bahadur, at al. - IMS
In this volume the author covered what should be standard topics in a course of parametric estimation: Bayes estimates, unbiased estimation, Fisher information, Cramer-Rao bounds, and the theory of maximum likelihood estimation.
by R. M. Gray, L. D. Davisson - Cambridge University Press
The book covers basic probability, random objects, expectation, second order moment theory with examples of the random process models and their basic properties, specific applications for communication, estimation, detection, modulation.
by Sophocles J. Orfanidis - Prentice Hall
An applications-oriented introduction to digital signal processing. The author covers all the basic DSP concepts, such as sampling, DFT/FFT algorithms, etc. The book emphasizes the algorithmic, computational, and programming aspects of DSP.