On the odd-DFT and its applications to DCT/IDCT computation

DOI10.1109/TSP.2006.874808MaRDI QIDQ4587860zbMATH OpenOpenAlexFDO

Authors Mohamed F. Mansour

Publication date 30 October 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2006.874808

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Recommendations

• Computation of an odd-length DCT from a real-valued DFT of the same length
• General approach for the realization of DCT/IDCT using convolutions
• On the computation of two-dimensional DCT
• A new look at DCT-type transforms
• Fast odd discrete cosine transform algorithms
• A new algorithm to compute the DCT and its inverse
• Odd-factor algorithms for multidimensional discrete \(W\) transform
• On the structure of efficient DFT algorithms
• A Deterministic Low-Complexity Approximate (Multiplier-Less) Technique for DCT Computation
• scientific article; zbMATH DE number 11434

Cited in

(2)

• General approach for the realization of DCT/IDCT using convolutions
• Algorithms for a small-sized type II discrete Fourier transform

This page was built for publication: On the odd-DFT and its applications to DCT/IDCT computation

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