Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms

DOI10.1007/BF01599167zbMath0572.65120MaRDI QIDQ1062442

B. George

Publication date: 1984

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

factorizationsine transformcosine transformsdecimation-in-time versioninverse transforms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40) Algorithms in computer science (68W99)

Related Items

The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms, Sine transform based preconditioners for symmetric Toeplitz systems, Preconditioning of elliptic problems by approximation in the transform domain, Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems, Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms, The eigen-structures of real (skew) circulant matrices with some applications

Cites Work

• On the computation and the effectiveness of discrete sine transform
• A fast cosine transform in one and two dimensions
• A fast algorithm for the discrete sine transform implemented by the fast cosine transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• A Fast Computational Algorithm for the Discrete Sine Transform
• A Symmetric Cosine Transform
• A Storage Efficient Way to Implement the Discrete Cosine Transform
• A Fast Karhunen-Loeve Transform for a Class of Random Processes
• A Fast Computational Algorithm for the Discrete Cosine Transform
• On Computing the Discrete Cosine Transform
• Discrete Cosine Transform