Integer DCTs and fast algorithms

DOI10.1109/78.960425MaRDI QIDQ5353568zbMATH OpenOpenAlexFDO

Authors Yonghong Zeng, Guoan Bi, Li-zhi Cheng, Alex C. Kot

Publication date 8 September 2017

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

Full work available at URL https://doi.org/10.1109/78.960425

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Invertible integer DCT algorithms
• A fast algorithm for computing multidimensional dct on certain small sizes
• scientific article; zbMATH DE number 2020194
• scientific article; zbMATH DE number 733445
• Integer MDCT with enhanced approximation of the DCT-IV
• Fast DCT-I, DCT-III, and DCT-IV via moments
• Fast algorithms for multidimensional DCT-to-DCT computation between a block and its associated subblocks
• Fast algorithms for the discrete cosine transform
• Fast Algorithm for the 3-D DCT-II

Cited in

(7)

• Invertible integer DCT algorithms
• A global method for invertible integer DCT and integer wavelet algorithms
• Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations
• An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput
• scientific article; zbMATH DE number 926141 (Why is no real title available?)
• Worst-case error analysis of lifting-based fast DCT-algorithms
• DCT hardware structure for sequentially presented data

This page was built for publication: Integer DCTs and fast algorithms

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