A Fast Algorithm Based on Discrete Cosine Transform(DCT)

2014 ◽  
Vol 644-650 ◽  
pp. 1488-1493
Author(s):  
Xiao Hui Huang ◽  
Wei Zhi Huang ◽  
Ke Yuan ◽  
Kun He
Keyword(s):  
Discrete Cosine Transform ◽  
Fast Algorithm ◽  
Fast Algorithms ◽  
Two Dimensional ◽  
Cosine Transform ◽  
One Dimensional

Traditional fast algorithms for DCT are aimed at sequences with 2N length and it is math-intensive for sequences which contain odd numbers of elements. This paper analyzes the redundant calculation of cosine transform of non-2N-point sequences and put forward a fast algorithm for one-dimensional DCT with odd length. Also, according to the separability of two-dimensional DCT, we can generalize the fast algorithm for one-dimensional DCT to two-dimensional DCT to implement and complete the fast algorithm. The simulation suggests that this algorithm improves the speed of calculation.

scholarly journals A new VLSI algorithm and architecture for the hardware implementation of type IV discrete cosine transform using a pseudo-band correlation structure

2011 ◽  
Vol 1 (2) ◽  
Author(s):  
Doru Chiper
Keyword(s):  
Discrete Cosine Transform ◽  
Systolic Array ◽  
Correlation Structure ◽  
Efficient Design ◽  
Hardware Complexity ◽  
Cosine Transform ◽  
Type Iv ◽  
Vlsi Chip ◽  
Array Architecture ◽  
Vlsi Algorithm

AbstractA new VLSI algorithm and its associated systolic array architecture for a prime length type IV discrete cosine transform is presented. They represent the basis of an efficient design approach for deriving a linear systolic array architecture for type IV DCT. The proposed algorithm uses a regular computational structure called pseudoband correlation structure that is appropriate for a VLSI implementation. The proposed algorithm is then mapped onto a linear systolic array with a small number of I/O channels and low I/O bandwidth. The proposed architecture can be unified with that obtained for type IV DST due to a similar kernel. A highly efficient VLSI chip can be thus obtained with good performance in the architectural topology, computing parallelism, processing speed, hardware complexity and I/O costs similar to those obtained for circular correlation and cyclic convolution computational structures.

Sign in / Sign up

Export Citation Format

Share Document