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

DOI10.1007/BF01600005MaRDI QIDQ1105346zbMATH OpenFDO

Authors S. H. Smith

Publication date 1988

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Review text

Decimation-in-frequency algorithms for discrete sine and cosine transforms are developed. Their feature is the recursive and modular structure, and thereby, these algorithms are ready to realize fertile hardware organization. The complexity of these algorithms is also discussed.

Recommendations

• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• A fast recursive algorithm for the discrete sine transform
• New fast recursive algorithms for the computation of discrete cosine and sine transforms
• Fast discrete sine transform algorithms
• A prime-factor decomposed algorithm for the discrete sine transform

Cites work

• A Fast Computational Algorithm for the Discrete Cosine Transform
• A Fast Computational Algorithm for the Discrete Sine Transform
• A Fast Karhunen-Loeve Transform for a Class of Random Processes
• A new algorithm to compute the discrete cosine Transform
• A Symmetric Cosine Transform
• Discrete Cosine Transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• scientific article; zbMATH DE number 3896264 (Why is no real title available?)
• On computing the discrete Fourier and cosine transforms
• Simple FFT and DCT algorithms with reduced number of operations.

Cited in

(6)

• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
• 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
• Discrete sine transform and its inverse - realization through recursive algorithms
• A prime-factor decomposed algorithm for the discrete sine transform

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

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