Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms

DOI10.1007/BF01599762zbMath0747.65101OpenAlexW1997255410MaRDI QIDQ1812878

Yanyan Li

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1007/bf01599762

zbMATH Keywords

computational complexitydiscrete trigonometric transformsfast prime factor decomposition algorithms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Simple FFT and DCT algorithms with reduced number of operations.
• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• 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
• A new algorithm to compute the discrete cosine Transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• A Symmetric Cosine Transform
• A Fast Karhunen-Loeve Transform for a Class of Random Processes
• On the Computation of the Discrete Cosine Transform
• Discrete Cosine Transform

This page was built for publication: Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms