摘要:
Any analytic signal fa(eit) can be written as a product of its minimum-phase signal part (the outer function part) and its all-phase signal part (the inner function part).Due to the importance of such decomposition,Kumarasan and Rao (1999),implementing the idea of the Szeg(o) limit theorem (see below),proposed an algorithm to obtain approximations of the minimum-phase signal of a polynomial analytic signal fa(eit) =eiN0t M∑k=0 akeikt,(0.1)where a0 ≠ 0,aM ≠ 0.Their method involves minimizing the energy E(fa,h1,h2,...,hH) =1/2π∫2π0|1+H∑k=1hkeikt|2|fa(eit)|2dt (0.2) with the undetermined complex numbers hk's by the least mean square error method.In the limiting procedure H → ∞,one obtains approximate solutions of the minimum-phase signal.What is achieved in the present paper is two-fold.On one hand,we rigorously prove that,if fa(eit) is a polynomial analytic signal as given in (0.1),then for any integer H ≥ M,and with |fa(eit)|2 in the integrand part of (0.2) being replaced with 1/|fa(eit)|2,the exact solution of the minimum-phase signal of fa(eit) can be extracted out.On the other hand,we show that the Fourier system eikt used in the above process may be replaced with the Takenaka-Malmquist (TM) system,rk(eit):=√1-|ακ|2eit/1-(ακ)eit∏k-1j=1 eit-αj/1-(ακ)eit,k=1,2,...,r0(eit)=,i.e.,the least mean square error method based on the TM system can also be used to extract out approximate solutions of minimum-phase signals for any functions fa in the Hardy space.The advantage of the TM system method is that the parameters α1,...,αn,...determining the system can be adaptively selected in order to increase computational efficiency.In particular,adopting the n-best rational (Blaschke form) approximation selection for the n-tuple [α 1,…,αn],n ≥ N,where N is the degree of the given rational analytic signal,the minimum-phase part of a rational analytic signal can be accurately and efficiently extracted out.