使用融合乘加加速快速傅里叶变换计算的向量化方法
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金资助项目(61133007,61472432)


Vectorization of accelerating fast Fourier transform computation  based on fused multiply-add instruction
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    融合乘加指令加速快速傅里叶变换计算的向量化方法,通过变换快速傅里叶变换的蝶形单元运算流程,将传统计算方式中独立的乘法和加法操作组合成次数更少的融合乘加操作,使得时间抽取法基2 快速傅里叶变换算法的蝶形单元计算的实数浮点操作由原来的10次乘(加)操作减少到6次融合乘加操作,时间抽取法基4 快速傅里叶变换算法的蝶形单元计算的实数浮点操作由原来的34次乘(加)操作减少到24次融合乘加操作;优化了蝶形因子的向量访问,减少存储开销。实验结果表明,提出的方法能够显著加速快速傅里叶变换的计算,取得高效的计算性能和效率。

    Abstract:

    A vectorization of accelerating fast Fourier transform computation based on fused multiply-add instruction was presented. Separate multiplication and addition operations in conventional computation were manipulated into less fused multiply-add operations by transforming process of fast Fourier transform butterfly computation, which decreased the real floating-point operations of radix-2 decimation in time fast Fourier transform butterfly computation from 10 multiplication (addition) operations to 6 multiply-add operations and decreased the real floating-point operations of radix-4 decimation in time fast Fourier transform butterfly computation from 34 multiplication (addition) operations to 24 multiply-add operations. Vector data access on twiddle factors was optimized to reduce memory cost. Experimental results show that the presented method can greatly accelerate fast Fourier transform computation and achieve efficient performance and efficiency.

    参考文献
    相似文献
    引证文献
引用本文

刘仲,陈海燕,向宏卫.使用融合乘加加速快速傅里叶变换计算的向量化方法. Vectorization of accelerating fast Fourier transform computation  based on fused multiply-add instruction[J].国防科技大学学报,2015,37(2):72-78.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2014-06-12
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2015-05-16
  • 出版日期:
文章二维码