首页> 外文会议>Applied optics and optoelectronics 1998 >Computation Reduction in the Fast Fourier Transform in Fourier Fringe Analysis
【24h】

Computation Reduction in the Fast Fourier Transform in Fourier Fringe Analysis

机译:傅里叶条纹分析中快速傅里叶变换的计算约简

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

This paper describes a method of reducing the time involved in the computation of the two dimensional Fast Fourier Transforms required in Fourier Fringe Analysis. The technique computes only the values of the frequencies that are close to the frequency of the fringe pattern. The rest of the values are usually filtered out and are of no interest. High reductions in time can be achieved by the use of this technique and no information is usually lost.
机译:本文介绍了一种减少傅立叶条纹分析中所需的二维快速傅立叶变换计算所需时间的方法。该技术仅计算接近条纹图案频率的频率值。其余的值通常会被过滤掉,因此没有意义。通过使用此技术可以大大减少时间,并且通常不会丢失任何信息。

著录项

  • 来源
  • 会议地点 Brighton(GB)
  • 作者单位

    Coherent and Electro-Optics Research Group, School of Engineering Liverpool John Moores University, Byrom Street, Liverpool, L3 3AF, UK;

    Coherent and Electro-Optics Research Group, School of Engineering Liverpool John Moores University, Byrom Street, Liverpool, L3 3AF, UK;

    Coherent and Electro-Optics Research Group, School of Engineering Liverpool John Moores University, Byrom Street, Liverpool, L3 3AF, UK;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 应用;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号