一种基于Loeffler算法的快速实现2D DCT/IDCT的方法  

Fast Implementation of 2D DCT/IDCT Based on Loeffler's Algorithm

作　　者：罗天煦[1] 邝继顺[1] 

机构地区：[1]湖南大学计算机与通信学院,湖南长沙410082

出　　处：《计算机应用研究》2007年第1期224-226,231,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(60173042)

摘　　要：提出了一种基于Loeffler[8]算法的快速实现二维离散余弦变换/反离散余弦变换(2D DCT/IDCT)的方法。采用行列分解的方式,仅使用一个1D DCT/IDCT处理核快速完成8×8的2D DCT/IDCT变换。通过合理安排时钟周期数和简化各周期内的操作,使1D DCT/IDCT模块能在八个时钟周期内快速完成一次变换。仿真试验表明,与目前使用相同FPGA芯片的商业IP核相比,所使用的资源减少了10%,而速度却提高了10%。This paper presents a new Loeffler algorithm-based approach to two dimensional forward and Inverse Discrete Cosine Transform （2D DCT/IDCT） for image compressions. The 2D DCT/IDCT is implemented by two times of ID DCT/IDCT due to the separability of the 2D DCT/IDCT. After the number of clock cycle has been properly lengthened and the operations during the cycle simplified, the 1D DCT/IDCT can be executed within 8 clock cycles at high speed. Experimental results show that our design cuts down 10% of hardware cost and saves 10% of time compared with some similar commercial IP cores.

关 键 词：二维离散余弦变换 行列分解法 现场可编程门阵列 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]