A new fast algorithm for computing prime-Length DCT through cyclic convolutions.

DOI10.1016/S0165-1684(00)00251-6MaRDI QIDQ5941167zbMATH OpenWikidataFDO

Authors Rui-Xiang Yin, W. C. Siu

Publication date 20 August 2001

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0165-1684(00)00251-6

Mathematics Subject Classification ID

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

Recommendations

• Bilinear algorithms for discrete cosine transforms of prime lengths
• Convolution-based DCT algorithm
• Computation of an odd-length DCT from a real-valued DFT of the same length
• Efficient index mapping for computing discrete cosine transform
• Fast algorithms for computing the discrete cosine transform

Cited in

(6)

• Bilinear algorithms for discrete cosine transforms of prime lengths
• Convolution-based DCT algorithm
• Computation of an odd-length DCT from a real-valued DFT of the same length
• An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput
• Hardware Efficient Fast DCT Based on Novel Cyclic Convolution Structures
• scientific article; zbMATH DE number 926141 (Why is no real title available?)

This page was built for publication: A new fast algorithm for computing prime-Length DCT through cyclic convolutions.

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