Dispersive Fourier transform based dual-comb ranging

Bing Chang1, Teng Tan1,2,3, Junting Du1

  • 1Key Laboratory of Optical Fiber Sensing and Communications (Education Ministry of China), University of Electronic Science and Technology of China, Chengdu, 611731, China.

Nature Communications
|June 11, 2024
PubMed
Summary

This study introduces a new dispersive Fourier transform (DFT) Light Detection and Ranging (LIDAR) method using dual soliton laser combs. This innovative approach achieves high-precision distance measurements and eliminates dead zones for improved LIDAR performance.

Related Concept Videos

IR Spectrometers01:25

IR Spectrometers

There are two main infrared (IR) spectrophotometers: dispersive IR spectrometers and Fourier transform infrared (FTIR) spectrometers. In a dispersive IR spectrometer, a beam of infrared radiation produced by a hot wire is divided into two parallel equal-intensity beams using mirrors. One beam passes through the sample, while another is a reference beam. The beams then move through the monochromator, which separates the radiations into a continuous spectrum of different frequencies. The...
1.1K
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
260
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
305
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
305
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
252
Electronic Distance Measuring Instruments01:30

Electronic Distance Measuring Instruments

Electronic Distance Measuring Instruments (EDMs) are essential tools in modern surveying, offering precise distance measurements by emitting electromagnetic signals and calculating the time required for these signals to travel to a target and return. Two primary types of signals are used in EDMs — light waves and microwaves — each suited to specific environmental and distance requirements. Light-wave-based EDMs utilize either infrared or laser light, providing high accuracy over short...
32