In various applications of data classification and clustering problems, multi-parameter analysis is effective and crucial because data are usually defined in multi-parametric space. Multi-parameter persistent homology, an extension of persistent homology of one-parameter data analysis, has been developed for topological data analysis (TDA). Although it is conceptually attractive, multi-parameter persistent homology still has challenges in theory and practical applications. In this study, we consider time-series data and its classification and clustering problems using multi-parameter persistent homology. We develop a multi-parameter filtration method based on Fourier decomposition and provide an exact formula and its interpretation of one-dimensional reduction of multi-parameter persistent homology. The exact formula implies that the one-dimensional reduction of multi-parameter persistent homology of the given time-series data is equivalent to choosing diagonal ray (standard ray) in the multi-parameter filtration space. For this, we first consider the continuousization of time-series data based on Fourier decomposition towards the construction of the exact persistent barcode formula for the Vietoris-Rips complex of the point cloud generated by sliding window embedding. The proposed method is highly efficient even if the sliding window embedding dimension and the length of time-series data are large because the method precomputes the exact barcode and the computational complexity is as low as the fast Fourier transformation of $O(N \log N)$. Further the proposed method provides a way of finding different topological inferences by trying different rays in the filtration space in no time. Comment: 31 pages, Second Edition(Fixed the wrongs and supplemented more explanations)