首页> 外文期刊>Computers and Artificial Intelligence >A Unified Approach To Fast computation Of Discrete Sinusoidal Transforms II: DFT And DWT Transforms
【24h】

A Unified Approach To Fast computation Of Discrete Sinusoidal Transforms II: DFT And DWT Transforms

机译:快速计算离散正弦变换的统一方法II:DFT和DWT变换

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

摘要

Discrete Fourier transform (DFT), discrete Hartley transform (DHT), and various types of discrete W transform (DWT) are also members of discrete si- nusoidal transform family. A unified approach to the fast computation of the DFT and DWT transforms for real data sequences is presented. It takes advantage of the regular universal DCT-II/DST-II and DCT-II/DST-III computational structure in existing real sparse matrix factorizations leading to simple, numerically stable, in place and efficient algorithms for any N=2~m, m>0.
机译:离散傅里叶变换(DFT),离散Hartley变换(DHT)和各种类型的离散W变换(DWT)也是离散正弦变换族的成员。提出了一种用于实际数据序列的快速计算DFT和DWT变换的统一方法。在现有的实际稀疏矩阵分解中,它利用常规的通用DCT-II / DST-II和DCT-II / DST-III计算结构,可为任何N = 2〜m带来简单,数值稳定,就地有效的算法, m> 0。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号