Uncertainty Propagation of Missing Data Signals with the Interval Discrete Fourier Transform

Abstract

The interval discrete Fourier transform (DFT) algorithm can propagate signals carrying interval uncertainty. By addressing the repeated variables problem, the interval DFT algorithm provides exact theoretical bounds on the Fourier amplitude and estimates of the power spectral density (PSD) function while running in polynomial time. Thus, the algorithm can be used to assess the worst-case scenario in terms of maximum or minimum power, and provide insights into the amplitude spectrum bands of the transformed signal. To propagate signals with missing data, an upper and lower value for the missing data present in the signal must be assumed, such that the uncertainty in the spectrum bands can also be interpreted as an indicator of the quality of the reconstructed signal. For missing data reconstruction, there are a number of techniques available that can be used to obtain reliable bounds in the time domain, such as Kriging regressors and interval predictor models. Alternative heuristic strategies based on variable—as opposed to fixed—bounds can also be explored. This work aims to investigate the sensitivity of the algorithm against interval uncertainty in the time signal. The investigation is conducted in different case studies using signals of different lengths generated from the Kanai-Tajimi PSD function, representing earthquakes, and the Joint North Sea Wave Observation Project (JONSWAP) PSD function, representing sea waves as a narrowband PSD model.