Related Experiment Videos
Denoising algorithm of Φ-OTDR systems based on adaptive fractional wavelet transform denoising
Optics Express
|July 2, 2026
Summary
A novel fractional wavelet transform (NFRWT) effectively suppresses background noise in phase-sensitive optical time-domain reflectometry (Φ-OTDR) signals. This method enhances signal-to-noise ratio (SNR) for long-range sensing and intrusion monitoring.
Area of Science:
- Photonics and Sensing Technologies
- Signal Processing
- Wavelet Theory
Background:
- Phase-sensitive optical time-domain reflectometry (Φ-OTDR) is crucial for long-range sensing.
- Background noise and low signal-to-noise ratio (SNR) challenge Φ-OTDR performance in complex environments.
- Existing denoising methods struggle to preserve signal fidelity while suppressing broadband noise.
Purpose of the Study:
- To propose a novel adaptive fractional wavelet transform (NFRWT) for denoising Φ-OTDR signals.
- To enhance SNR and suppress background noise in long-range sensing and engineering applications.
- To improve the performance of distributed acoustic sensing (DAS) signal analysis.
Main Methods:
- Constructed a time-domain coupled wavelet basis with fractional-order phase modulation and translation phase compensation.
- Developed an adaptive fractional-order selection strategy maximizing NFRWT-domain energy concentration.
- Applied multiscale wavelet decomposition and soft-threshold shrinkage for noise suppression and waveform preservation.
Main Results:
- The NFRWT method effectively distinguishes useful signal components from broadband background noise.
- Demonstrated superior performance compared to existing denoising algorithms in 20.2 km long-range sensing.
- Achieved an average SNR of 63.38 dB and a noise floor of -84.32 dB rad²/Hz in intrusion monitoring.
Conclusions:
- The proposed NFRWT-based denoising method significantly improves Φ-OTDR signal quality.
- NFRWT offers robust background noise suppression and waveform fidelity preservation.
- The method is effective for long-range sensing and real-world engineering scenarios like intrusion detection.
Related Concept Videos
Deconvolution
Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
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]...
For a discrete-time periodic signal x[n]...
Downsampling
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
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...
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...
One of the notable...
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...