Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

DOI10.1016/J.SIGPRO.2008.01.004zbMATH Open1186.94306arXivcs/0703150OpenAlexW1660233191WikidataQ61657822 ScholiaQ61657822MaRDI QIDQ971426FDOQ971426

Authors: Xuancheng Shao, Steven G. Johnson 

Publication date: 19 May 2010

Published in: Signal Processing (Search for Journal in Brave)

Abstract: We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ~ 2N log_2 N to ~ (17/9) N log_2 N for a power-of-two transform size N. Furthermore, we show that a further N multiplications may be saved by a certain rescaling of the inputs or outputs, generalizing a well-known technique for N=8 by Arai et al. These results are derived by considering the DCT to be a special case of a DFT of length 4N, with certain symmetries, and then pruning redundant operations from a recent improved fast Fourier transform algorithm (based on a recursive rescaling of the conjugate-pair split radix algorithm). The improved algorithms for DCT-III, DST-II, and DST-III follow immediately from the improved count for the DCT-II.

Full work available at URL: https://arxiv.org/abs/cs/0703150

Recommendations

• Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
• Simple FFT and DCT algorithms with reduced number of operations.
• Fast discrete sine transform algorithms
• scientific article; zbMATH DE number 24367
• Fast algorithms for computing the discrete cosine transform

zbMATH Keywords

fast Fourier transformdiscrete cosine transformarithmetic complexity

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (14)

• Improved DCT-DST prime factor algorithms.
• Low-Complexity Scaling Methodsfor DCT-II Approximations
• New algorithm for multidimensional type-III DCT
• Improvement of the discrete cosine transform calculation by means of a recursive method
• Simple FFT and DCT algorithms with reduced number of operations.
• DCT-former: efficient self-attention with discrete cosine transform
• Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lowest complexity self-recursive radix-2 DCT II/III algorithms
• A new look at DCT-type transforms
• Recursive calculation of discrete cosine transform for low resolution signal processing
• A faster multipole Legendre-Chebyshev transform
• Cosine manifestations of the Gelfand transform

Uses Software

• DCT-III
• FFTW

This page was built for publication: Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

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