A prime-factor decomposed algorithm for the discrete sine transform

DOI10.1016/0045-7906(90)90007-3MaRDI QIDQ803771zbMATHOpenAlexFDO

Authors N. E. Zubov

Publication date 1990

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7906(90)90007-3

zbMATH Keywords

decompositiondiscrete cosine transformdiscrete sine transformprime factorprime factor algorithmindex mapping

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
• Prime factor algorithm for multidimensional discrete cosine transform
• A fast recursive algorithm for the discrete sine transform
• Fast and stable algorithms for discrete sine transformations having orthogonal factors
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• Symmetric Prime Factor Fast Fourier Transform Algorithms
• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
• An integer approximation method for discrete sinusoidal transforms
• Fast discrete sine transform algorithms

Cited in

(4)

• Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• On the computation of the prime factor DST
• On prime factor mapping for the discrete Hartley transform

This page was built for publication: A prime-factor decomposed algorithm for the discrete sine transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803771)