首页> 外国专利> METHOD AND APPARATUS FOR EFFICIENT COMPUTATION OF DISCRETE FOURIER TRANSFORM (DFT)AND INVERSE DISCRETE FOURIER TRANSFORM (IDFT)

METHOD AND APPARATUS FOR EFFICIENT COMPUTATION OF DISCRETE FOURIER TRANSFORM (DFT)AND INVERSE DISCRETE FOURIER TRANSFORM (IDFT)

机译:有效计算离散傅里叶变换(DFT)和逆离散傅里叶变换(IDFT)的方法和装置

摘要

The present invention significantly reduces the number of complex computations that must be performed in computing the discrete Fourier transform (DFT) and inverse DFT (IDFT) operations. In particular, the DFT and IDFT operations are computed using the same computing device. The computation operations are substantially identical for both operations with the exception that for the IDFT operation, the data are complex conjugated before and after processing. Using the same computing device/operations, both DFT and IDFT computations are optimized for maximum efficiency. A common transform process is selectively connected to first and second data processing paths. A DFT operation is performed on an N-point sequence on the first data processing path, and an IDFT operation is performed on an N-point sequence on the second data processing path using the same N-point fast Fourier transform (FFT).
机译:本发明大大减少了在计算离散傅里叶变换(DFT)和逆DFT(IDFT)操作中必须执行的复杂计算的数量。特别地,使用相同的计算设备来计算DFT和IDFT操作。除了对于IDFT操作而言,数据在处理之前和之后都经过复杂的共轭处理,这两个操作的计算操作基本上相同。使用相同的计算设备/操作,可以优化DFT和IDFT计算以实现最大效率。通用变换过程选择性地连接到第一和第二数据处理路径。使用相同的N点快速傅立叶变换(FFT),在第一数据处理路径上的N点序列上执行DFT操作,并在第二数据处理路径上的N点序列上执行IDFT操作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号