Transforms and fast algorithms for signal analysis and representations.
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Other transformations of harmonic type (42C20) Numerical methods for discrete and fast Fourier transforms (65T50) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
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.
- Algorithms for fast multidimensional signal extraction
- Fast adaptive Fourier-based transform and its use in multidimensional data compression
- Invariant spaces and fast transforms
- Arithmetical methods of the synthesis of fast algorithms of discrete orthogonal transforms
- Fast algorithms for signal processing.
- scientific article; zbMATH DE number 3896264 (Why is no real title available?)
- scientific article; zbMATH DE number 3977189 (Why is no real title available?)
- scientific article; zbMATH DE number 44159 (Why is no real title available?)
- scientific article; zbMATH DE number 44299 (Why is no real title available?)
- scientific article; zbMATH DE number 46528 (Why is no real title available?)
- Multidimensional orthogonal FM transforms
- Binary polynomial transforms and nonlinear digital filters
- scientific article; zbMATH DE number 194569 (Why is no real title available?)
- scientific article; zbMATH DE number 195038 (Why is no real title available?)
- scientific article; zbMATH DE number 2205361 (Why is no real title available?)
- The fast Ahmed-Rao transform with subsampling in time
This page was built for publication: Transforms and fast algorithms for signal analysis and representations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703855)
