×

The AFD methods to compute Hilbert transform. (English) Zbl 1325.42002

Summary: In the literature adaptive Fourier decomposition is abbreviated as AFD that addresses adaptive rational approximation, or alternatively adaptive Takenaka-Malmquist system approximation. The AFD type approximations may be characterized as adaptive approximations by linear combinations of parameterized Szegö and higher order Szegö kernels. This note proposes two kinds of such analytic approximations of which one is called maximal-energy AFDs, including core AFD, Unwending AFD and Cyclic AFD; and the other is again linear combinations of Szegö kernels but generated through SVM methods. The proposed methods are based on the fact that the imaginary part of an analytic signal is the Hilbert transform of its real part. As consequence, when a sequence of rational analytic functions approximates an analytic signal, then the real parts and imaginary parts of the functions in the sequence approximate, respectively, the original real-valued signals and its Hilbert transform. The two approximations have the same errors in the energy sense due to the fact that Hilbert transformation is a unitary operator in the \(L^2\) space. This paper for the first time promotes the complex analytic method for computing Hilbert transforms. Experiments show that such computational methods are as effective as the commonly used one based on FFT.

MSC:

42A10 Trigonometric approximation
42A38 Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Zhou, C.; Yang, L.; Liu, Y.; Yang, Z., A novel method for computing the Hilbert transform with Haar multiresolution approximation, J. Comput. Appl. Math., 223 (2009), 585-579 · Zbl 1211.65170
[2] Micchelli, C. A.; Xu, Y.; Yu, B., On computing with the Hilbert spline transform, Adv. Comput. Math. (2011)
[3] Qian, T.; Wang, Y., Adaptive Fourier series—a variation of greedy algorithm, Adv. Comput. Math., 34, 3, 279-293 (2011) · Zbl 1214.30047
[4] Qian, T.; Wang, Y., Remarks on adaptive Fourier decomposition, Int. J. Wavelets Multiresolut. Inf. Process., 11, 1, 1-14 (2013) · Zbl 1267.42006
[5] Qian, T., Intrinsic mono-components decomposition of functions: an advance of Fourier theory, Math. Methods Appl. Sci., 33, 880-891 (2010) · Zbl 1188.42001
[6] Qian, T., Cyclic AFD algorithm for best rational approximation, Math. Methods Appl. Sci., 37, 846-859 (2013) · Zbl 1287.42018
[7] Mi, W.; Qian, T., Frequency domain identification: an algorithm based on adaptive rational orthogonal system, Automatica, 48, 6, 1154-1162 (2012) · Zbl 1244.93038
[8] Mi, W.; Qian, T., On backward shift algorithm for estimating poles of systems, Automatica, 50, 1603-1610 (2014) · Zbl 1296.93068
[9] Mi, W.; Qian, T.; Wan, F., A fast adaptive model reduction method based on Takenaka-Malmquist systems, Systems Control Lett., 61, 1, 223-230 (2012) · Zbl 1256.93029
[10] Qian, T.; Zhang, L.; Li, Z., Algorithm of adaptive Fourier transform, IEEE Trans. Signal Process., 59, 12, 5899-5906 (2011) · Zbl 1393.94142
[11] Mo, Y.; Qian, T., Support vector machine adapted Tikhonov regularization method to solve dirichlet problem, Appl. Math. Comput., 245, 509-519 (2014) · Zbl 1337.65172
[13] Garnett, J. B., Bounded Analytic Functions (1987), Academic Press
[14] Marple, L., Computing the discrete-time analytic signal via FFT, IEEE Trans. Signal Process., 47, 2600-2603 (2001) · Zbl 0990.94502
[15] Vapnik, V., The Nature of Statistical Learning Theory (1995), Springer-Verlag: Springer-Verlag New York · Zbl 0833.62008
[16] Qian, T.; Li, H.; Stessin, M., Comparison of adaptive mono-component decompositions, Nonlinear Anal. RWA, 14, 2 (2013), Pages 1055V1074 · Zbl 1270.94041
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.