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

DOI10.1016/j.sigpro.2008.01.004zbMath1186.94306arXivcs/0703150OpenAlexW1660233191WikidataQ61657822 ScholiaQ61657822MaRDI QIDQ971426

Steven G. Johnson, Xuancheng Shao

Publication date: 19 May 2010

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

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

zbMATH Keywords

fast Fourier transformdiscrete cosine transformarithmetic complexity

Mathematics Subject Classification ID

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

Related Items (4)

DCT-former: efficient self-attention with discrete cosine transform ⋮ Recursive calculation of discrete cosine transform for low resolution signal processing ⋮ Improvement of the discrete cosine transform calculation by means of a recursive method ⋮ 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