【24h】

A fast Fourier transform compiler

机译:快速的傅立叶变换编译器

获取原文

摘要

The FFTW library for computing the discrete Fourier transform (DFT) has gained a wide acceptance in both academia and industry, because it provides excellent performance on a variety of machines (even competitive with or faster than equivalent libraries supplied by vendors). In FFTW, most of the performance-critical code was generated automatically by a special-purpose compiler, called genfft, that outputs C code. Written in Objective Caml, genfft can produce DFT programs for any input length, and it can specialize the DFT program for the common case where the input data are real instead of complex. Unexpectedly, genfft "discovered" algorithms that were previously unknown, and it was able to reduce the arithmetic complexity of some other existing algorithms. This paper describes the internals of this special-purpose compiler in some detail, and it argues that a specialized compiler is a valuable tool.
机译:用于计算离散傅立叶变换(DFT)的FFTW库在学术界和工业界都得到了广泛认可,因为它在各种机器上均具有出色的性能(甚至可以与供应商提供的同等库竞争或比其更快)。在FFTW中,大多数性能关键代码是由专用的编译器genfft自动生成的,该编译器输出C代码。 genfft写在Objective Caml中,可以为任何输入长度生成DFT程序,并且可以将DFT程序专门用于输入数据为实数而不是复数的常见情况。出乎意料的是,genfft“发现”了以前未知的算法,并且能够降低某些其他现有算法的算术复杂性。本文详细介绍了此专用编译器的内部结构,并认为专用编译器是一种有价值的工具。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号