Efficient parallel adder based design for one-dimensional discrete cosine transform

2000 ◽  
Vol 147 (5) ◽  
pp. 276 ◽  
Author(s):  
J.-I. Guo
2014 ◽  
Vol 644-650 ◽  
pp. 1488-1493
Author(s):  
Xiao Hui Huang ◽  
Wei Zhi Huang ◽  
Ke Yuan ◽  
Kun He

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.


Sign in / Sign up

Export Citation Format

Share Document