Abstract
Phase unwrapping is a crucial technique in phase-sensitive optical time domain reflectometry (Φ-OTDR) systems. Due to the effects of system under-sampling, I/Q imbalance and environmental noise, the traditional method of unwrapping the phase is prone to wrapping or even distortion. In this work, a two-dimensional phase unwrapping method based on the recursive-branch-cut (RBC) algorithm is proposed and studied to improve the accuracy of the demodulated phase waveform. The data near the vibration location is expanded into a two-dimensional wrapped phase map along the time direction. According to the abnormal phase distribution law, the two-dimensional wrapped phase map is divided into sliding windows of different lengths. Under the constraint of ensuring the global continuity of the phase, the local phase is optimized by selecting an appropriate integration path, and the error is minimized, thereby suppressing the propagation of abnormal noise in the global. The experimental results show that in the range of 1-80 Hz, the method can stably increase the upper limit of the system dynamic range by 3.21 dB. At the same time, the system has a good linear strain response capability, and the strain sensitivity is 22.46rad/με×m and R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> =0.9997. In addition, the method greatly improves the demodulation characteristics without increasing the generality and practicability of the system, which is beneficial to the fully digital realization of the heterodyne detection technology.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.