期刊文献+

H.26L中整数变换的研究及改进

Research and Improvement of the Inte ger Transform in H.26L
原文传递
导出
摘要 针对DCT变换存在浮点运算、运算量大等问题,H.26L提出了整数变换,它能够很好地消除浮点运算,避免逆变换不匹配,但存在精度不高的问题。在基于提升结构(liftingstructure)的无乘法二进制DCT(binDCT)的基础上,对参数进行选择优化,并将浮点DCT、整数变换和binDCT在结构和性能上进行比较分析,选择一组binDCT参数,使binDCT既能避免浮点运算又能降低运算量,且更有利于压缩。 Because the true DCT is a floating -point transform and has the IDCT mismatch problem,H.26L proposes the integer transforms approximati on to the DCT.It can well avoid these p roblems,but has low performance.Then a lifting -based fast approximation of the 4-point DCT,named the binDCT is proposed,which can be implemented with only a ddition and right -shift operations.We comp are and analyze the DCT,the integer t ransforms and the binDCT.The experimental results show that the binDCT with right param eters can not only reduce the complexity but also be more efficient.
出处 《通信技术》 2003年第10期5-7,共3页 Communications Technology
关键词 H.26L DCT 整数变换 binDCT H.26L,DCT,integer transform,binD CT
  • 相关文献

参考文献6

  • 1[1]H. 26L Document Q. 6/SG16 - P - 07: Draft ITU - T Recommendation H. 264 (a. k.a. "H. 26L"). May, 2002
  • 2[2]H. 26L Document Q15 - K - 59: H. 26L Test Model Long Term Number5 (TML-5) Draft 0. Oct. 2000
  • 3[3]H. 26L Document Q. 6/SG16 - M - 16: A 16 - bit architecture for H. 26L, treating DCT transforms and quantization. April, 2001
  • 4[4]Chen W, Harrison C, Fralick S. A fast computational algorithm for the discrete cosine transform. IEEE Trans. Com., 1977; 25(9): 1004 ~ 1011
  • 5[5]Wang Z. Fast algorithm for the discrete W transform and for the discrete Fourier transform. IEEE Trans. ASSP, 1984; 32 (4): 803 ~ 816
  • 6[6]Daubechies I, Sweldens W. Factoring wavelet transforms into lifting steps. Journal of Fourier Anal., 1998; 4 (3): 247 ~ 269

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部