The author describes the fast algorithm he discovered for spectral analysis and indeed any purpose to which Fourier Transforms and the Fast Fourier Transform are normally applied.

Most real-world spectrum analysis problems involve the computation of the real-data discrete Fourier transform (DFT), a unitary transform that maps elements N of the linear space of real-valued N-tuples, R , to elements of its complex-valued N counterpart, C , and when carried out in hardware it is conventionally achieved via a real-from-complex strategy using a complex-data version of the fast Fourier transform (FFT), the generic name given to the class of fast algorithms used for the ef?cient computation of the DFT. Such algorithms are typically derived by explo- ing the property of symmetry, whether it exists just in the transform kernel or, in certain circumstances, in the input data and/or output data as well. In order to make effective use of a complex-data FFT, however, via the chosen real-from-complex N strategy, the input data to the DFT must ?rst be converted from elements of R to N elements of C . The reason for choosing the computational domain of real-data problems such N N as this to be C , rather than R , is due in part to the fact that computing equ- ment manufacturers have invested so heavily in producing digital signal processing (DSP) devices built around the design of the complex-data fast multiplier and accumulator (MAC), an arithmetic unit ideally suited to the implementation of the complex-data radix-2 butter?y, the computational unit used by the familiar class of recursive radix-2 FFT algorithms.

This book describes how a key signal/image processing algorithm – that of the fast Hartley transform (FHT) or, via a simple conversion routine between their outputs, of the real‐data version of the ubiquitous fast Fourier transform (FFT) – might best be formulated to facilitate computationally-efficient solutions. The author discusses this for both 1-D (such as required, for example, for the spectrum analysis of audio signals) and m‐D (such as required, for example, for the compression of noisy 2-D images or the watermarking of 3-D video signals) cases, but requiring few computing resources (i.e. low arithmetic/memory/power requirements, etc.). This is particularly relevant for those application areas, such as mobile communications, where the available silicon resources (as well as the battery-life) are expected to be limited. The aim of this monograph, where silicon‐based computing technology and a resource‐constrained environment is assumed and the data is real-valued in nature, has thus been to seek solutions that best match the actual problem needing to be solved.

Updating the original, Transforms and Applications Handbook, Third Edition solidifies its place as the complete resource on those mathematical transforms most frequently used by engineers, scientists, and mathematicians. Highlighting the use of transforms and their properties, this latest edition of the bestseller begins with a solid introduction to signals and systems, including properties of the delta function and some classical orthogonal functions. It then goes on to detail different transforms, including lapped, Mellin, wavelet, and Hartley varieties. Written by top experts, each chapter provides numerous examples and applications that clearly demonstrate the unique purpose and properties of each type. The material is presented in a way that makes it easy for readers from different backgrounds to familiarize themselves with the wide range of transform applications. Revisiting transforms previously covered, this book adds information on other important ones, including: Finite Hankel, Legendre, Jacobi, Gengenbauer, Laguerre, and Hermite Fraction Fourier Zak Continuous and discrete Chirp-Fourier Multidimensional discrete unitary Hilbert-Huang Most comparable books cover only a few of the transforms addressed here, making this text by far the most useful for anyone involved in signal processing—including electrical and communication engineers, mathematicians, and any other scientist working in this field.