【24h】

Partial Sum Based Algorithm for the Discrete Cosine Transform

机译:基于部分和的离散余弦变换算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, a fast algorithm and its corresponding hardware structure are developed for the 2~M × 2~M type Discrete Cosine Transform. The transform output is transformed into a mul-add format by the definition of the 2-D DCT/IDCT. The output data set is partitioned into several subsets each having the same multiplicands that we call partial sum. By computing partial sum, the addition and multiplication operation times can be greatly reduced. In final, its corresponding hardware architecture is presented for VLSI implementation. The synthesis result shows that the algorithm is efficient and reliable.
机译:本文针对2〜M×2〜M型离散余弦变换,开发了一种快速算法及其相应的硬件结构。通过二维DCT / IDCT的定义,将转换输出转换为mul-add格式。输出数据集被分为几个子集,每个子​​集具有相同的被乘数,我们称之为部分和。通过计算部分和,可以大大减少加法和乘法运算时间。最后,介绍了其相应的硬件架构,以用于VLSI实现。综合结果表明,该算法是有效和可靠的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号