The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms

DOI10.1007/BF01600005zbMath0648.65094MaRDI QIDQ1105346

S. H. Smith

Publication date: 1988

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

zbMATH Keywords

complexityDecimation-in-frequency algorithmsdiscrete sine and cosine transformsrecursive and modular structure

Mathematics Subject Classification ID

Numerical methods for integral transforms (65R10) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (3)

Low-complexity 8-point DCT approximation based on angle similarity for image and video coding ⋮ An orthogonal 16-point approximate DCT for image and video compression ⋮ Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms

Cites Work

• Unnamed Item
• Simple FFT and DCT algorithms with reduced number of operations.
• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• A new algorithm to compute the discrete cosine Transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• On computing the discrete Fourier and cosine transforms
• A Fast Computational Algorithm for the Discrete Sine Transform
• A Symmetric Cosine Transform
• A Fast Karhunen-Loeve Transform for a Class of Random Processes
• A Fast Computational Algorithm for the Discrete Cosine Transform
• Discrete Cosine Transform

This page was built for publication: The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms