希尔伯特变换
快速傅里叶变换
算法
希尔伯特谱分析
干涉测量
绝对相位
计算机科学
傅里叶变换
信号(编程语言)
反三角函数
Cooley–Tukey FFT算法
光学
数学
作者
Xiuming Li,Fajie Duan,Xiao Fu,Ruijia Bao,Jiajia Jiang,Cong Zhang
出处
期刊:Applied Optics
[The Optical Society]
日期:2022-04-10
卷期号:61 (11): 3150-3155
摘要
Frequency scanning interferometry using state-of-the-art high-speed frequency-swept laser source can be utilized to measure absolute distance on the order of micrometers to centimeters. Current distance demodulation methods based on fast Fourier transform (FFT) or fringe counting cannot achieve satisfactory accuracy when the number of sampling points within a frequency-sweeping period is small; the conventional Hilbert transform is more accurate, but it needs arctangent calculation and phase unwrapping, which is time consuming. So we propose a fast algorithm based on the conventional Hilbert transform to recover the distance from the interference signal. The algorithm is implemented by first performing a Hilbert transform and then solving the phase and the distance from the Hilbert signal with a novel, to the best of our knowledge, method that eliminates the need for arctangent calculation and phase unwrapping. The whole process took only 40 µs, and it is almost 2 times faster than the conventional Hilbert algorithm with little accuracy lost. Simulation results demonstrate that the proposed algorithm is more accurate than the FFT algorithm, and it achieved a standard deviation of 0.062 µm, which was less than that of the FFT, in our experiment at a distance of approximately 16 mm and measurement speed of 1 kHz.
科研通智能强力驱动
Strongly Powered by AbleSci AI