Fast odd discrete cosine transform algorithms

DOI10.1049/EL:19900327MaRDI QIDQ3981761zbMATH OpenOpenAlexFDO

Authors

Publication date 26 June 1992

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19900327

zbMATH Keywords

discrete Fourier transformfast algorithmindex mappingsodd discrete cosine transformsrecurrence formulas

Mathematics Subject Classification ID

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

Recommendations

• Fast algorithms for the discrete cosine transform
• Fast algorithms for computing the discrete cosine transform
• Fast algorithms for the discrete cosine transformation
• scientific article; zbMATH DE number 4106249
• scientific article; zbMATH DE number 1372528
• scientific article; zbMATH DE number 24367
• A fast algorithm for the \(n\)-D discrete cosine transform
• scientific article; zbMATH DE number 1190625
• Fast and numerically stable algorithms for discrete cosine transforms
• scientific article; zbMATH DE number 4197369

Cited in

(6)

• Fast algorithms for the discrete cosine transformation
• scientific article; zbMATH DE number 4147461 (Why is no real title available?)
• Improved algorithm for ODCT computation of a running data sequence
• Fast algorithms for computing the discrete cosine transform
• On the odd-DFT and its applications to DCT/IDCT computation
• Canonical transformations of the discrete cosine transform

This page was built for publication: Fast odd discrete cosine transform algorithms

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