Transforms and fast algorithms for signal analysis and representations. (Q703855)

This is a text devoted to the exposition of discrete-time transforms, their representations and associated algorithms. One can see immediately that the attention is focussed on the following main directions: a) basic transforms largely used in most applications: al) Fast Fourier Transform in variant 1D (dimension) and MD (multidimensional) variant (ch. 3); a2) Discrete Hartley Transform in 1D variant and MD variant (ch. 4 and 5); a3) Discrete Cosine Transform 1D variant and MD variant (ch. 6 and 7); b) Polynomial Transforms and their Fast Algorithms (ch. 2) with an excellent introduction on number theory allowing to develop MD algoritms for the classical transforms; c) Integer Transforms (ch. 8) containing some recently developed algorithms; d) New Methods in Time-Frequency Analysis (ch. 9) an excellent introduction to some interesting approaches (Fractional Fourier Transform, Tomographic Time-Frequency Analysis). Each chapter contains, apart its proper content, an introduction and a summary. The exposition is very clear, the text is excellent and suggestively arranged in the page, the comments are always pertinent so that this volume constitutes a true ``instrument de travail'' for students in electric and electronic engineering and will soon become a reference book in the domain of Digital Signal Processing.