Polynomial transform based DCT implementation
نویسندگان
چکیده
Discrete Cosine Transform (DCT) is an important transform of particular interest in still image compression and compression of individual video frames, while multidimensional DCT is mostly used for compression of video streams and volume spaces. An FPGA implementation of a Polynomial Transform DCT (PTDCT) algorithm, recently proposed by Zeng et al. [10], is presented. The regularity of Zeng’s algorithm and careful operation scheduling have resulted in a very efficient implementation of a two-dimensional DCT in Xilinx Virtex-II FPGA in the terms of logic requirements.
منابع مشابه
A Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملA GPU Accelerated Local Polynomial Approximation Algorithm for Efficient Denoising of MR Images
This paper presents a parallelized implementation of the Local Polynomial Approximation algorithm targetted at CUDA-enabled GPU hardware. Although the application area of LPA in the image processing domain is very wide, here the focus is put on magnetic resonance image denoising. In this case, LPA serves as a pre-processing step in the method based on Shape-Adaptive Discrete Cosine Transform. I...
متن کاملDerivation of fast DCT algorithms using algebraic technique based on Galois theory
The paper presents an algebraic technique for derivation of fast discrete cosine transform (DCT) algorithms. The technique is based on the algebraic signal processing theory (ASP). In ASP a DCT associates with a polynomial algebra AC = C[x]/p(x). A fast algorithm is obtained as a stepwise decomposition of AC. In order to reveal the connection between derivation of fast DCT algorithms and Galois...
متن کاملFast multiplierless approximations of the DCT with the lifting scheme
In this paper, we present the design, implementation, and application of several families of fast multiplierless approximations of the discrete cosine transform (DCT) with the lifting scheme called the binDCT. These binDCT families are derived from Chen’s and Loeffler’s plane rotation-based factorizations of the DCT matrix, respectively, and the design approach can also be applied to a DCT of a...
متن کاملInverse polynomial reconstruction method in DCT domain
The discrete cosine transform (DCT) offers superior energy compaction properties for a large class of functions and has been employed as a standard tool in many signal and image processing applications. However, it suffers from spurious behavior in the vicinity of edge discontinuities in piecewise smooth signals. To leverage the sparse representation provided by the DCT, in this article, we der...
متن کامل