An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput

DOI10.1109/TSP.2007.893746MaRDI QIDQ4564655zbMATH OpenFDO

Authors Doru Florin Chiper, M. N. S. Swamy, M. Omair Ahmad

Publication date 12 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Hardware-Efficient Realization of Prime-Length DCT Based on Distributed Arithmetic
• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• scientific article; zbMATH DE number 926141
• Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length
• scientific article; zbMATH DE number 621949
• Improved DCT-DST prime factor algorithms.
• Integer DCTs and fast algorithms
• Efficient prime factor algorithm and address generation techniques for the discrete cosine transform
• A Deterministic Low-Complexity Approximate (Multiplier-Less) Technique for DCT Computation
• Integer MDCT with enhanced approximation of the DCT-IV

Cited in

(1)

• scientific article; zbMATH DE number 926141 (Why is no real title available?)

This page was built for publication: An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput

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