Efficient index mapping for computing discrete cosine transform

DOI10.1049/EL:19891006MaRDI QIDQ4710942zbMATH OpenOpenAlexFDO

Authors

Publication date 25 June 1992

Published in Electronics Letters (Search for Journal in Brave)

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

zbMATH Keywords

discrete cosine transformfast Fourier transformFFT algorithmsindex mappingprime factor algorithmsignal processing

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Fast algorithms for computing the discrete cosine transform
• An efficient algorithm for the 2-D discrete cosine transform
• A refined fast 2-D discrete cosine transform algorithm
• A new algorithm to compute the discrete cosine Transform

Cited in

(7)

• An efficient FFT algorithm based on the discrete sine transform
• Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
• Computation of an odd-length DCT from a real-valued DFT of the same length
• Fast algorithms for computing the discrete cosine transform
• Efficient prime factor algorithm and address generation techniques for the discrete cosine transform
• The Hadamard transform-a tool for index assignment
• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.

This page was built for publication: Efficient index mapping for computing discrete cosine transform

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