scientific article; zbMATH DE number 1737498

MaRDI QIDQ4529611zbMATH OpenFDO

Authors Vladimir Britanak

Publication date 5 May 2002

zbMATH Keywords

algorithmscomputational complexitydiscrete cosine transformdiscrete sine transformdiscrete sinusoidal transformsdiscrete trigonometric transformsorthogonal transforms

Mathematics Subject Classification ID

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

Recommendations

• A unified discrete cosine and discrete sine transform computation
• scientific article; zbMATH DE number 1737503
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
• The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
• New fast recursive algorithms for the computation of discrete cosine and sine transforms

Cited in

(11)

• Discrete cosine and sine transforms-regular algorithms and pipeline architectures
• Fast unified computation of the multi-dimensional discrete sinusoidal transforms
• The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
• Signal flow graph approach to efficient and forward stable DST algorithms
• Architecture-oriented regular algorithms for discrete sine and cosine transforms
• A new look at DCT-type transforms
• New fast recursive algorithms for the computation of discrete cosine and sine transforms
• A Unified Treatment of Discrete Fast Unitary Transforms
• scientific article; zbMATH DE number 1737503 (Why is no real title available?)
• A new square wave transform based on the DCT
• A unified discrete cosine and discrete sine transform computation

This page was built for publication:

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