首页> 外国专利> Methods and apparatus for performing reduced complexity discrete fourier transforms using interpolation

Methods and apparatus for performing reduced complexity discrete fourier transforms using interpolation

机译:使用插值执行降低复杂度的离散傅立叶变换的方法和装置

摘要

Methods and apparatus are provided for performing reduced complexity discrete Fourier transforms using interpolation An input sequence of length N is transformed by extending the input sequence to an extended input sequence of length M, where M is greater than N (a power of two greater than N); performing a discrete Fourier Transform (DFT), such as a power-of-two DFT, on the extended input sequence to obtain an interpolated sequence; and applying a conversion matrix to the interpolated sequence to obtain a DFT output for the input sequence of length N. The input sequence of length N can be extended to an extended input sequence of length M, for example, by employing a zero padding technique, a cyclic extension technique, a windowing of a cyclic extended sequence technique or a resampling-based interpolation technique to extend the input sequence. The conversion matrix is substantially a sparse matrix.
机译:提供了用于使用插值来执行降低复杂度的离散傅立叶变换的方法和装置。通过将输入序列扩展为长度为M的扩展输入序列来变换长度为N的输入序列,其中M大于N(N的2的幂) );在扩展的输入序列上执行离散傅里叶变换(DFT),例如二乘幂DFT,以获得插值序列;然后将转换矩阵应用于插值序列以获得长度为N的输入序列的DFT输出。长度为N的输入序列可以扩展为长度为M的扩展输入序列,例如,采用零填充技术,循环扩展技术,循环扩展序列技术的窗口化或基于重采样的插值技术来扩展输入序列。转换矩阵实质上是稀疏矩阵。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号