Discrete Transforms
Download Discrete Transforms PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Discrete Transforms book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Integral and Discrete Transforms with Applications and Error Analysis
This reference/text desribes the basic elements of the integral, finite, and discrete transforms - emphasizing their use for solving boundary and initial value problems as well as facilitating the representations of signals and systems.;Proceeding to the final solution in the same setting of Fourier analysis without interruption, Integral and Discrete Transforms with Applications and Error Analysis: presents the background of the FFT and explains how to choose the appropriate transform for solving a boundary value problem; discusses modelling of the basic partial differential equations, as well as the solutions in terms of the main special functions; considers the Laplace, Fourier, and Hankel transforms and their variations, offering a more logical continuation of the operational method; covers integral, discrete, and finite transforms and trigonometric Fourier and general orthogonal series expansion, providing an application to signal analysis and boundary-value problems; and examines the practical approximation of computing the resulting Fourier series or integral representation of the final solution and treats the errors incurred.;Containing many detailed examples and numerous end-of-chapter exercises of varying difficulty for each section with answers, Integral and Discrete Transforms with Applications and Error Analysis is a thorough reference for analysts; industrial and applied mathematicians; electrical, electronics, and other engineers; and physicists and an informative text for upper-level undergraduate and graduate students in these disciplines.
Mathematics of the Discrete Fourier Transform (DFT)
"The DFT can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, and that is the focus of this book. The DFT is normally encountered as the Fast Fourier Transform (FFT)--a high-speed algorithm for computing the DFT. The FFT is used extensively in a wide range of digital signal processing applications, including spectrum analysis, high-speed convolution (linear filtering), filter banks, signal detection and estimation, system identification, audio compression (such as MPEG-II AAC), spectral modeling sound synthesis, and many others. In this book, certain topics in digital audio signal processing are introduced as example applications of the DFT"--Back cover
Discrete Cosine and Sine Transforms
The Discrete Cosine Transform (DCT) is used in many applications by the scientific, engineering and research communities and in data compression in particular. Fast algorithms and applications of the DCT Type II (DCT-II) have become the heart of many established international image/video coding standards. Since then other forms of the DCT and Discrete Sine Transform (DST) have been investigated in detail. This new edition presents the complete set of DCT and DST discrete trigonometric transforms, including their definitions, general mathematical properties, and relations to the optimal Karhunen-Loéve transform (KLT), with the emphasis on fast algorithms (one-dimensional and two-dimensional) and integer approximations of DCTs and DSTs for their efficient implementations in the integer domain. DCTs and DSTs are real-valued transforms that map integer-valued signals to floating-point coefficients. To eliminate the floating-point operations, various methods of integer approximations have been proposed to construct and flexibly generate a family of integer DCT and DST transforms with arbitrary accuracy and performance. The integer DCTs/DSTs with low-cost and low-powered implementation can replace the corresponding real-valued transforms in wireless and satellite communication systems as well as portable computing applications. The book is essentially a detailed excursion on orthogonal/orthonormal DCT and DST matrices, their matrix factorizations and integer aproximations. It is hoped that the book will serve as a valuable reference for industry, academia and research institutes in developing integer DCTs and DSTs as well as an inspiration source for further advanced research. - Presentation of the complete set of DCTs and DSTs in context of entire class of discrete unitary sinusoidal transforms: the origin, definitions, general mathematical properties, mutual relationships and relations to the optimal Karhunen-Loéve transform (KLT) - Unified treatment with the fast implementations of DCTs and DSTs: the fast rotation-based algorithms derived in the form of recursive sparse matrix factorizations of a transform matrix including one- and two-dimensional cases - Detailed presentation of various methods and design approaches to integer approximation of DCTs and DSTs utilizing the basic concepts of linear algebra, matrix theory and matrix computations leading to their efficient multiplierless real-time implementations, or in general reversible integer-to-integer implementations - Comprehensive list of additional references reflecting recent/latest developments in the efficient implementations of DCTs and DSTs mainly one-, two-, three- and multi-dimensional fast DCT/DST algorithms including the recent active research topics for the time period from 1990 up to now