首页> 外文会议>Conference on Applications of Digital Image Processing >Low Complexity ID IDCT for 16-bit Parallel Architectures
【24h】

Low Complexity ID IDCT for 16-bit Parallel Architectures

机译:对于16位并行架构的低复杂度ID IDCT

获取原文

摘要

This paper shows that using the Loeffler, Ligtenberg, and Moschytz factorization of 8-point IDCT [2] one-dimensional (1-D) algorithm as a fast approximation of the Discrete Cosine Transform (DCT) and using only 16 bit numbers, it is possible to create in an IEEE 1180-1990 compliant and multiplierless algorithm with low computational complexity. This algorithm as characterized by its structure is efficiently implemented on parallel high performance architectures as well as due to its low complexity is sufficient for wide range of other architectures, Additional constraint on this work was the requirement of compliance with the existing MPEG standards. The hardware implementation complexity and low resources where also part of the design criteria for this algorithm. This implementation is also compliant with the precision requirements described in MPEG IDCT precision specification ISO/IEC 23002-1. Complexity analysis is performed as an extension to the simple measure of shifts and adds for the multiplierless algorithm as additional operations are included in the complexity measure to better describe the actual transform implementation complexity.
机译:本文展示了使用Loeffler,LigTenBerg和MoSchytz分解8点IDCT [2]一维(1-D)算法作为离散余弦变换(DCT)的快速近似,并且仅使用16位数字,它可以在IEEE 1180-1990中创建具有低计算复杂度的兼容乘法算法。该算法以其结构为特征,在并行高性能架构上有效地实现,并且由于其低复杂性足以用于广泛的其他架构,因此对该工作的额外约束是要求遵守现有的MPEG标准。硬件实现复杂性和低资源,其中该算法的设计标准也是一部分。此实现还符合MPEG IDCT精密规范ISO / IEC 23002-1中描述的精度要求。复杂性分析作为扩展到简单的换档量度的扩展,并且对于多平台算法的增加,因为附加操作包括在复杂度测量中以更好地描述实际变换实现复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号