...
首页> 外文期刊>IEEE Transactions on Signal Processing >Fast computation of transform coefficients for a subadjacent block for a transform family
【24h】

Fast computation of transform coefficients for a subadjacent block for a transform family

机译:快速计算变换族下相邻块的变换系数

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

摘要

The authors examine several different kinds of subadjacent blocks, and consider fast computation for a transform family including the Walsh-Hadamard transform and the Rh transform as special cases. The approach proposed here provides a direct frequency-frequency procedure. Results indicate that, for this transform family, a reduction of the number of multiplications and additions is achieved by a factor of two-thirds. An example for the Rh transform shows that further reduction of arithmetic operations is also possible. The results of this method are even better for the Walsh-Hadamard transform. The new algorithms can reduce the number of additions from the level O(N log/sub 2/ N) to the level O(N), as compared to the traditional method.
机译:作者研究了几种不同类型的次相邻块,并考虑了包括Walsh-Hadamard变换和Rh变换在内的变换族的快速计算作为特例。这里提出的方法提供了直接的频率-频率程序。结果表明,对于该变换族,乘法和加法的数量减少了三分之二。 Rh变换的示例表明,进一步减少算术运算也是可能的。对于Walsh-Hadamard变换,此方法的结果更好。与传统方法相比,新算法可以减少从级别O(N log / sub 2 / N)到级别O(N)的加法数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号