首页> 外文会议>2011 IEEE 3rd International Conference on Communication Software and Networks >On-the-fly and memory-scalable implementation of Hierarchical Lapped Transforms with minimum memory requirement
【24h】

On-the-fly and memory-scalable implementation of Hierarchical Lapped Transforms with minimum memory requirement

机译:快速且可扩展内存的分层重叠变换实现,具有最低的内存需求

获取原文

摘要

We propose an on-the-fly and memory-scalable implementation of Hierarchical Lapped Transforms (HLT) with minimum memory budget. Both the forward and inverse transforms have the advantages of low memory requirement unrelated to the length of the input signal. Experimental results suggest that the proposed algorithm outperforms the existing algorithms with respect to computation efficiency and memory requirement.
机译:我们提出了一种具有最小内存预算的动态且可扩展内存的分层重叠变换(HLT)实现。正向变换和逆向变换都具有与输入信号的长度无关的低存储需求的优点。实验结果表明,在计算效率和内存需求方面,该算法优于现有算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号