...
首页> 外文期刊>IEEE Transactions on Signal Processing >The poorman's transform: approximating the Fourier transform without multiplication
【24h】

The poorman's transform: approximating the Fourier transform without multiplication

机译:穷人变换:近似傅立叶变换而无乘法

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

获取外文期刊封面封底 >>

       

摘要

A time-domain to frequency-domain transformation for sampled signals which is computed with only additions and trivial complex multiplications is described. This poorman's transform is an approximation to the usual Fourier transform, obtained by quantizing the Fourier coefficients to the four values (+or-1, +or-j), and is especially useful when multiplication is expensive. For the general case of an N-point quantization, an analytic formula is given for the error in the approximation, which involves only contributions from aliased harmonics. Continuous-time signals are considered; in this case the approximation is exact for bandlimited signals.
机译:描述了仅通过加法和平凡复数乘法计算的采样信号的时域到频域变换。该穷人变换是通过将傅立叶系数量化为四个值(+或-1,+或-j)而获得的通常的傅立叶变换的近似值,当乘法昂贵时特别有用。对于N点量化的一般情况,给出了近似误差的解析公式,该公式仅涉及混叠谐波的贡献。考虑连续时间信号;在这种情况下,近似值对于带限信号是精确的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号