Method and device for adaptively estimating a transfer function of an unknown system

Abstract: In an adaptive estimation of a transfer function by a projection algorithm, a forward linear prediction coefficient vector a (k) of an input signal x(k), the sum of forward a posteriori prediction-error squares F(k), a backward linear prediction coefficient vector b (k) of the input signal x(k) and the sum of backward a posteriori prediction-error squares B(k) are computed. Letting a step size and a pre-filter deriving coefficient vector be represented by µ and f (k), respectively, a pre-filter coefficient vector g (k) is calculated by a recursion formula for the pre-filter coefficient vector g (h), which is composed of the following first and second equations:

Description: BACKGROUND OF THE INVENTION The present invention relates to a method for adaptively estimating, with a projection algorithm, a transfer function of an unknown system and its output in an acoustic canceller, active noise control or the like and an estimating device using such a method. In the following description, time will be represented by a discrete time k. For example, the amplitude of a signal x at time k will be expressed by x(k). Fig. 1 is a diagram for explaining the estimation of the transfer function of an unknown system. Reference numeral 11 denotes a transfer function estimation part and 12 the unknown system, and reference character x(k) represents an input signal to the unknown system and y(k) an output signal therefrom. The transfer function h(k) of the unknown system is estimated using the input signal x(k) and the output signal y(k). Fig. 2 is a diagram for explaining an adaptive estimation of the transfer function. Reference numeral 21 denotes an estimated transfer function correcting vector calculation part, 22 an estimated transfer function correction part and 23 a convolution part, these parts constituting an estimated signal generation part 20. The transfer function h(k) of the unknown system 12 is estimated as a transfer function h ∧(k) of an FIR filter of a tap number L which forms the convolution part 23. More specifically, coefficients h ∧ 1 (k), ..., h ∧ L (k) of the FIR filter are estimated. Let it be assumed that the "transfer function" and the "FIR filter coefficient" will hereinafter be construed as the same. For the sake of brevity, the filter coefficient is represented as an estimated transfer function vector h ∧(k) defined by the following equation. h (k) = [ h 1 (k), h 2 (k), ..., h L (k)] T where T represents a transpose. In Fig. 2, the input signal x(k) to the unknown system 12 is fed to the convolution part 23 and a calculation is performed to obtain the estimated transfer function vector h ∧(k) that minimizes an expected value which is the square of an error signal e(k) available from a subtractor 24 which detects a difference between an output y ∧(k) from the convolution part 23 given by the following equation (2) and the output y(k) from the unknown system 12. y (k) = h (k) T x(k) x(k) = [x(k), x(k-1), ..., x(k-L+1)] T where y ∧(k) is an estimated value of the output from the unknown system, which is close to the value of the output y(k) when the estimated transfer function h ∧(k) is close to an unknown characteristic. In practice, the transfer function of an unknown system often varies with time as in the case where the transfer function of an acoustic path varies with movement of audiences or objects in a sound field such as a conference hall or theater. For this reason, the estimated transfer function h ∧(k) of the unknown system also needs to be adaptively corrected in accordance with a change in the acoustic path of the unknown system. The estimated transfer function correcting vector calculation part 21 calculates an estimated transfer function correcting vector δh ∧(k) on the basis of the error signal e(k) and the input signal x(k) to the unknown system 12. The estimated transfer function correction part 22 corrects the estimated transfer function by adding the estimated transfer function correcting vector δh ∧(k) to the estimated transfer function vector h ∧(k) as expressed by the following equation. h (k+1) = h (k) + µδ h (k) where µ is called a step size, which is a preselected quantity for controlling the range of each correction and is handled as a time-invariant constant. In the following description, the estimated transfer function correcting vector δh ∧(k) is calculated for µ = 1 and, if necessary, it is multiplied by a desired step size µ. In some applications the value of the step size µ is caused to vary with time, but in such a case, too, the following description is applicable. The corrected estimated transfer function vector is transferred to the convolution part 23. The above is a transfer function estimating operation at time k and the same operation is repeated after time k + 1 as well. T. Furukawa et al: "The Orthogonal Projection Algorithm for Block Adaptive Signal Processing" in Proceedings of ICASSP 98, IEEE New York USA, Vol. 2, 23-26 May 1989, Glasgow UK, pp. 1059-1062, disclose estimation of a transfer function of an unknown system by using orthogonal projection based on an Affine Projection Algorithm. The aim is to reduce the number of multiplications, wherein a filter coefficient vector is updated for each block of input vectors (or every r sample times) to reduce computational requirement. Since the coefficient vector is updated for each block L, the number of update times is reduced, resulting in decrease in convergence speed of the adaptive filter. The filter coefficient vector is adjusted according to an equation numbered 11 in the document and including the Moore-Penrose type generalized inverse matrix which still involves a high computational requirement. The projection algorithm proposed by T. Furukawa et al. is developed from the Affine Projection Algorithm proposed by Ozeki and Umeda and mentioned below. The estimated transfer function correcting method described above in respect of Fig. 2 is known as an adaptive algorithm. While an LMS (Least Mean Square) algorithm and an NLMS (Normalized LMS) are also well-known as adaptive algorithms, a description will be given of a projection algorithm proposed in a literature [Ozeki and Umeda: "An Adaptive Filtering Algorithm Using an Orthogonal Projection to an Affine Subspace and Its Properties", Journal of Institute of Electronics, Information and Communication Engineers of Japan (A), J67-App. 126-132, (1984-2).] This document discloses a method of adaptively estimating thetransfer function of an unknown system in accordance with the first portion of claims 1, 2 and 3. The projection algorithm requires a larger number of operations than does the NLMS but has an excellent adaptability to a speech signal input. With the projection algorithm, as referred to above, the vector δh ∧(k) is determined by Eq. (4) for µ = 1 so that simultaneous equations composed of the following p equations are satisfied. Eq. (5) indicates that the vector δh ∧(k) is determined so that the estimated transfer function h ∧(k+1) updated at time k provides the same values y(k), y(k-1), ..., y(k-p+1) as the outputs from the unknown system, respectively, for p input vectors x(k), x(k-1), ..., x(k-p+1) prior to time k. By this, it is expected that the characteristic of the estimated transfer function h ∧(k) will approach the characteristic of the unknown system as the adaptive updating of the estimated transfer function is repeated using the vector δh ∧(k). In the above, p is a quantity commonly called a projection order. As the projection order p increases, the adaptability of the projection algorithm increases but the computational complexity also increases. The conventional NLMS method corresponds to the case of p = 1. Now, transposing the first equation in Eq. (5), we have x(k) T δ h (k) = y(k) - x(k) T h (k) = e(k) Furthermore, transposing the second equation in Eq. (5) and using an equation obtainable by setting k in Eqs. (4) and (6) to k-1, we have x(k-1) T δ h (k) = y(k-1) - x(k-1) T h (k) = y(k-1) - x(k-1) T h (k-1) + µδ h (k-1)) = y(k-1) - x(k-1) T h (k-1) + µx(k-1) T δ h (k-1) = e(k-1) - µe(k-1) = (1-µ)e(k-1) Thereafter, the following relationship similarly holds. x(k-i) T δ h (k) = (1-µ) i e(k-i) Based on this, Eq. (5) can be rewritten as the following system of simultaneous equations. X p (k)δ h (k) = e(k) where X p (k) is a matrix with p rows and L columns and e(k) is a vector of the p rows; they are defined by the following equations. The vector e(k) will hereinafter be referred to as an error vector. Now, since p is usually smaller than L, Eq. (9) is an under-determined simultaneous equation or indeterminate equation for the vector δh ∧(k) and the minimum norm solution of the vector δh ∧(k) is given by the following equation. δ h (k) = X p (k) T (X p (k)X p (k) T ) -1 e(k) = [x(k)x(k-1), ..., x(k-p+1)]g(k) where g(k) = R p (k) -1 e(k) R p (k) = X p (k)X p (k) T R p is a matrix with p rows and p columns, which will hereinafter be referred to as a p-order covariance matrix or auto-correlation matrix, and g(k) a pre-filter coefficient vector. Letting elements of the pre-filter coefficient vector g(k) be represented by g 1 (k), g 2 (k), ..., g p (k), the estimated transfer function correcting vector δh ∧(k) can be expressed on the basis of Eq. (12) as follows: δ h (k) = i=1 p g i (k) x (k-i+1) Thus, when the projection algorithm is used, in accordance with the present invention the estimated transfer function correcting vector calculation part 21 in Fig. 2 has such a construction as depicted in Fig. 3. Reference numeral 31 denotes a pre-filter coefficient vector calculation part, which uses the input signal x(k) and the error signal e(k) to calculate the pre-filter coefficient g(k) on the basis of Eq. (13). Reference numeral 32 denotes a pre-filtering part, which performs the pre-filtering operation expressed by Eq. (15) to synthesize the estimated transfer correcting vector δh ∧(k) by use of the pre-filter coefficient g(k) that is transferred from the pre-filter coefficient vector calculation part 31. Now, a description will be given of the computational complexity of the projection scheme described above. The computational complexity mentioned herein is the number of multiplication-addition (or addition) operations necessary for estimating operations per unit discrete time. The computational complexity of Eq. (2) in the convolution part 23 of the tap number L in Fig. 2 is L. The computational complexity of Eq. (13) in the pre-filter coefficient vector calculation part 31 of the estimated transfer function correcting vector calculation part 21 is about p 3 /6 when using the Choleski method which is a typical computation method. The computational complexity of Eq. (15) in the pre-filtering part 32 is (p-1)L. The computational complexity of Eq. (4) in the estimated transfer function correction part 22 is L. Thus, the entire computational complexity NC of the projection scheme is given by the following equation. NC = L + p 3 /6 + (p-1)L + L On the other hand, the computational complexity of the NLMS scheme or LMS algorithm is about 2L. For example, when L = 500 and p = 20 (a typical value in the case of an acoustic echo canceler), the number of operations involved in the NLMS scheme is 1000, whereas the projection scheme requires as many as about 12000 operations on the basis of Eq. (16). The computational complexity p 3 /6 of Eq. (13), in particular, abruptly increases as the projection order p increases. Thus, the projection scheme has excellent convergence characteristics as compared with the NLMS scheme but poses the problem of increased computational complexity. SUMMARY OF THE INVENTION It is therefore an object of the present invention to provide an adaptive transfer function estimating method which permits reduction of the computational complexity involved and an estimating device using such a method. This object is achieved with a method as claimed in claim 1 or 2 and a device as claimed in claim 7 or 8. Preferred embodiments are subject-matter of the depnedent claims. To attain the above object, a first embodiment of the present invention reduces the computational complexity of the pre-filter coefficient vector calculation part 31 while a second embodiment and/or reduces the computational complexity of the pre-filtering part 32. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram illustrating an ordinary construction for the estimation of a transfer function; Fig. 2 is a block diagram of a transfer function estimation part 11 in Fig. 1; Fig. 3 is a block diagram of an estimated transfer function correcting vector calculation part 21 embodying the present invention in Fig. 2; Fig. 4 is a block diagram of a pre-filter coefficient vector calculation part 31 according to the first aspect of the invention in Fig. 3; Fig. 5 is a block diagram showing an estimated signal generating process according to the second aspect of the invention; Fig. 6 is a block diagram showing an application of the present invention to measurement of the transfer function of a loudspeaker; Fig. 7 is a block diagram showing an application of the present invention to an echo canceller; Fig. 8 is a block diagram showing an application of the present invention to noise control; Fig. 9 is a graph showing echo cancelling characteristics of an echo canceller embodying the present invention; and Fig. 10 is a graph showing, in comparison with a prior art example, the relationship between the number of operations for the estimation of the transfer function and the projection order. DESCRIPTION OF THE PREFERRED EMBODIMENTS A description will be given first of a method for reducing the computational complexity of the pre-filter coefficient vector calculation part 31. This method is characterized in that the pre-filter coefficient vector g(k) is obtained by a recursion formula utilizing a vector g(k-1) at one unit time before. Now, it will be demonstrated how the vector g(k) can be obtained from the immediately preceding vector g(k-1) on a recursive basis. The recursion formula is derived through utilization of the fact that elements of the error vector e(k) of Eq. (11) shift with time while being multiplied by 1-µ and the property of the inverse of the covariance matrix of the input signal given by Eq. (14). As is the case with Eq. (14), a covariance matrix R p-1 (k) of the p-1 order is defined by the following equation. It is known from a literature, S. Haykin, "Adaptive Filter Theory," 2nd edition, Prentice-Hall, 1991, pp. 577-578 that the inverse of the covariance matrix R p (k) and the inverse of the covariance matrix R p-1 (k) bear such a relationship as shown below. where a(k) is a forward linear prediction coefficient vector (p-order) which satisfies a normal equation R p (k)a(k) = [F(k), 0, ..., 0] T and its first element is a 1; F(k) is the minimum value of the sum of forward a posteriori prediction-error squares; b(k-1) is a backward linear prediction coefficient vector (p-order) which satisfies a normal equation R p (k-1)b(k-1) = [0, ..., 0, B(k-1)] T and its last element is a 1; and B(k-1) is the minimum value of the sum of backward a posteriori prediction-error squares. The linear prediction coefficients a(k), b(k-1) and the minimum values of the sums of forward and backward a posteriori prediction-error squares F(k) and B(k-1) could be calculated with less computational complexity through use of an FTF (Fast Transversal Filters) algorithm, for instance, as disclosed in J. M. Cioffi and T. Kailath, "Windowed fast transversal adaptive filter algorithms with normalization," IEEE Trans. Acoust, Speech Signal Processing, vol. ASSP-33, no. 3, pp. 607-625. The pre-filter coefficient vector g(k) of Eq. (13) is shown again below. g(k) = R p (k) -1 e(k) A pre-filter deriving coefficient vector f(k) of p-1 order is defined, corresponding to the vector g(k), by the following equation. f(k) = R p-1 (k) -1 e p-1 (k) where Since all elements of a vector (1-µ)e p-1 (k-1) of p-1 order, obtained by substituting (k-1) for k in Eq. (22) and multiplying both of its left and right sides by (1-µ), constitute elements of the p-order vector e(k) of Eq. (11) except its first element e(k), the relationship of the following equation holds. Furthermore, since all the elements of the p-1 order vector of Eq. (22) constitute all elements of the p-order vector of Eq. (11) except its last element, the relationship between the vectors e(k) and e p-1 (k) can also be expressed as follows: Multiplying the respective terms on both sides of Eq. (18) by e(k) from the right, we obtain the following equation from Eqs. (20), (21) and (23). Moreover, multiplying both sides of Eq. (19) by e(k-1) from the right, we obtain the following equation from Eqs. (20), (21) and (24). Transposing the right side to the left side, we have In this way, the pre-filter coefficient vector g(k) is calculated on the basis of the value of the pre-filter deriving coefficient vector f(k-1) as expressed by Eq. (25), and the vector f(k-1) is calculated from the vector g(k-1) as expressed by Eq. (27). That is, Eqs. (25) and (27) are recursion formulae for the vector g(k). On the right side of Eq. (25), to obtain the first term (1-µ)[ ] needs p-1 multiplications to obtain e(k) needs p-1 multiplications and to obtain the second term a(k) T e(k) needs p multiply-add operations, one division for division by F(k) and p multiply-add operations for multiplication by a(k) and addition to the first term on the right side. That is, a total of 4p operations are needed. Similarly, approximately 2p operations are required to obtain Eq. (27). Accordingly, the number of operations of Eqs. (25) and (27) is around 6p, which is a computational complexity proportional to p. On the other hand, it is disclosed in the afore-mentioned literature by J. M. Cioffi and T. Kailath that the linear prediction coefficient vectors a(k), b(k-1) and the minimum values of the sum of a posteriori prediction-error squares F(k), B(k-1), which are needed in Eqs. (25) and (27), can be calculated by a linear prediction scheme with a computational complexity of about 10p. Thus, it is evident that the recursion formulae of Eqs. (25) and (27) permits calculation of the vector g(k) with the computational complexity proportional to the projection order p. According to the present invention based on the above-described principles, the matters (A), (B) and (C) listed below are effective in reducing the computational complexity and in increasing the computational stability. (A) Eq. (27) is an equation for the p-order vector and its left side is zero with respect to a p-th element (the least significant element) of the vector. Since a p-th element of the vector b(k-1) is always a 1, the following equation holds using a p-th element g p (k-1) of the vector g(k-1). Therefore, the following equation may be calculated in place of Eq. (27). In this case, however, taking computational errors into account, it may sometimes be advantageous to obtain both g p (k-1) and the left side of Eq. (28) and average them. (B) When denominators F(k) and B(k-1) of the second terms on the right sides of Eqs. (25) and (27) are small, operations are unstable. The computational instability could be reduced by adding non-negative δ F (k) and δ B (k-1) to the denominators as shown in the following equations. In practice, the values δ F (k) and δ B (k-1) may be set to desired values about 40 dB smaller than the average power of the input signal x(k) (that is, about 1/10000 the average power) or may also be varied with time k in accordance with power variations. (C) In linear prediction analysis for obtaining the linear prediction coefficient vectors a (k), b (k-1) and the minimum values of the sum of prediction-error squares F(k), B(k-1) which are needed in Eqs. (25) and (27), the analysis frame of the input signal x(k) differs from that in an ordinary case. In concrete terms, the analysis frame in an ordinary linear prediction analysis ranges from time 0 to the current time, and when time k-1 is updated to k, x(k) needs only to be added to the analysis frame. In the projection algorithm, the analysis frame ranges from x(k) to x(k-L-p+2) in Eq. (5); so that when time k-1 is updated to k, it is necessary not only to add x(k) to the analysis frame but also to remove x(k-L-p+1) . On this account, the linear prediction analysis in the projection algorithm requires computational complexity twice that needed for ordinary linear prediction analysis. However, when the statistical property of the input signal does not change or when it is expected that its change is slow, the result of the linear prediction analysis does not largely depend on the analysis frame; hence, it is possible to use the ordinary linear prediction analysis in which x(k) needs only to be added to the analysis frame at time k -- this permits reduction of the computational complexity. Next, a description will be given of an embodiment of the adaptive transfer function estimating method of the present invention based on the above-described theoretical discussions, reference being made to Fig. 2 because the overall construction of its functional block is the same as shown in Fig. 2. Since the above-described theory underlying the present invention is related to the reduction of computational complexity in the estimated transfer function correcting vector calculation part 21 in Fig. 2, in particular, in the pre-filter coefficient vector calculation part 31 and the pre-filtering part 32 depicted in Fig. 3, these parts will hereinbelow be described in detail. Fig. 4 illustrates in block form the pre-filter coefficient vector calculation part 31 based on the discussion above. Reference numeral 41 denotes a linear prediction part, 42 a pre-filter deriving coefficient vector correcting part, 43 a pre-filter coefficient vector correcting part, and 44 an error vector generating part. The linear prediction part 41 calculates the forward linear prediction coefficient vector a(k) which satisfies a normal equation R p (k)a(k) = [F(k), 0, ..., 0] T and the sum of forward a posteriori prediction-error squares F(k) when the prediction coefficient a(k), the backward linear prediction coefficient vector b(k) which satisfies a normal equation R p (k-1)b(k-1) = [0, ..., 0, B(k-1)] T and the sum of backward a posteriori prediction-error squares B(k) when the prediction coefficient b(k) is used. These values can be calculated by methods disclosed in the afore-mentioned literature by J. M. Cioffi et al. The error signal vector generating part 44 stores p error signals e(k), e(k-1), ..., e(k-p+1) and constitutes the error signal vector e(k) of Eq. (11). In the pre-filter deriving coefficient vector correcting part 42, the pre-filter coefficient vector g(k-1), the backward linear prediction coefficient vector b(k-1), the error signal vector e(k-1) and the minimum value of the sum of backward a posteriori prediction-error squares B(k-1) are used to compute the pre-filter deriving coefficient vector f(k-1) on the basis of Eq. (27) or (30). In the pre-filter coefficient vector correcting part 43, the pre-filter deriving vector f(k-1), the error signal vector e(k), the forward linear prediction coefficient vector a(k) and the minimum value of the sum of forward a posteriori prediction-error squares F(k) are used to compute, by Eq. (25) or (29), the vector g(k) that satisfies Eq. (13). With the methods mentioned above, the computational complexity involved in the pre-filter coefficient vector calculation part 31 can substantially be reduced from p 3 /6 to 15p. Since the computational complexity (p-1)L in the pre-filtering part 32 remains unsolved, a large number of operations are still needed when L is large. Next, a description will be given of a solution to the above-noted problem by storing approximate values of the estimated transfer function vector h ∧(k+1) and averaging pre-filtering coefficients. At first, substituting k-1 for k in Eq. (4), the estimated transfer function h ∧(k) is expressed as follows: h (k) = h (k-1) + µδ h (k-1) Substituting this in Eq. (4), the estimated transfer function h ∧(k+1) is expressed as follows: h (k+1) = h (k-1) + µδ h (k) + µδh(k-1) Setting k-2, k-3, ... for k in Eq. (4) and repeating the above substitution, the estimated transfer function h ∧(k+1) is expressed by h (k+1) = µδ h (k) + µδ h (k-1) + ... + µδ h (0) In this instance, the estimated initial value h ∧(0) is set to 0 and this equation reveals that the estimated transfer function h ∧(k+1) is a summation of correcting vectors µδh ∧(k), µδh ∧(k-1), ..., µδh ∧(0) from time 0 (the transfer function estimation starting time) to the current time k. The correcting vector µδh ∧(k) is expressed by Eq. (15). Setting k-1, k-2, ..., for k in Eq. (15) and substituting Eq. (15) in Eq. (33), we get h (k+1) = µ[{g 1 (k)x(k)+g 2 (k)x(k-1)+ ... + g p (k)x(k-p+1)} + {g 1 (k-1)x(k-1)+g 2 (k-1)x(k-2) + ... +g p (k-1)x(k-p)} + ... + {g 1 (0)x(0)+g 2 (0)x(-1) + ... + g p (0)x(-p+1)}] = µ[g 1 (k)x(k) + {g 2 (k)+g 1 (k-1)}x(k-1) + {g 3 (k)+g 2 (k-1)+g 1 (k-2)}x(k-2) + ... + {g p-1 (k)+g p-2 (k-1)+ ... + g 1 (k-p+2)}x(k-p+2) + {g p (k)+g p-1 (k-1)+ ... + g 2 (k-p+2) + g 1 (k-p+1)}x(k-p+1) + {g p (k-1)+g p-1 (k-2) + ... + g 2 (k-p+1)+g 1 (k-p)}x(k-p) + {g p (k-2)+g p-1 (k-3)+ ... + g 2 (k-p) + g 1 (k-p-1)}x(k-p-1) + ... From this equation the following facts are expected. Firstly, the pre-filter coefficient g i (k) is calculated at every time k in the pre-filter coefficient calculation part 31 in Fig. 3 and provided to the pre-filtering part 32; in this case, it is expected that the computational complexity would be reduced by smoothing (or averaging) the pre-filter coefficient g i (k). Secondly, the term + g p (k-1)+ ... and the subsequent terms in Eq. (34) do not involve the pre-filter coefficient g i (k) which is fed at time k, and hence this portion does not change after time k. By storing these terms as approximate values of the vector h ∧(k+1), it is expected that the computational complexity would be reduced accordingly, because no calculations are needed for these terms after time k. Next, the above will be expressed by mathematical formulae. The smoothing of the pre-filter coefficient takes place for each corresponding input vector x(k-i). From Eq. (34), the smoothing corresponding to the input vector x(k-1), for example, is g 2 (k)+g 1 (k-1) , and the smoothing corresponding to the input vector x(k-2) is g 3 (k)+g 2 (k-1)+g 1 (k-2) . Letting the result of averaging (a smoothing coefficient) corresponding to the input vector x(k-i+1) , inclusive of the constant µ, be represented by s i (k), it is expressed by s i (k)= µ j=0 i-1 g i-j (k-j) for 1 ≤ i ≤ p s i (k)= µ j=i-p i-1 g i-j (k-j) for p < i Eq. (35) is expressed as follows: s i (k) = µ j=1 i-1 g i-j (k-j) + µg i (k) = µ j=0 i-2 g i-j-1 (k-j-1) + µg i (k) = s i-1 (k-1) + µg i (k) for 2 ≤ i ≤ p = µg i (k) for i = 1 On the other hand, letting the approximate value of the estimated transfer function h ∧(k+1) be represented by z(k+1), it is expressed by z(k+1) = {g p (k)+g p-1 (k-1)+ ... +g 2 (k-p+2)+g 1 (k-p+1)}x(k-p+1) +{g p (k-1)+g p-1 (k-2)+ ... +g 2 (k-p+1)+g 1 (k-p)}x(k-p) +{g p (k-2)+g p-1 (k-3)+ ... +g 2 (k-p)+g 1 (k-p-1)}x(k-p-1) + ... From Eqs. (34), (35) and (38) we have the estimated transfer function h ∧(k+1) expressed as follows: h (k+1) = z(k+1) + i=1 p-1 s i (k) x (k-i+1) Moreover, the following relationship holds between the approximate values z(k+1) and z(k). z(k+1) = {g p (k)+g p-1 (k-1)+ ... +g 2 (k-p+2) +g 1 (k-p+1)}x(k-p+1)+z(k) = s p (k)x(k-p+1)+z(k) The estimated value y ∧(k) of the output from the unknown system is expressed, from Eqs. (2) and (39), as follows: y (k) = x(k) T h (k) = x(k) T {z(k) + i=1 p-1 s i (k-1)x(k-i) } = x(k) T z(k) + i=1 p-1 s i (k-1)x(k) T x(k-i) = x(k) T z(k) + s p-1 (k-1) T r p-1 (k) In the above, s p-1 (k-1) is a smoothing coefficient vector and r p-1 (k) is a correlation vector, which are defined by the following equations. s p-1 (k-1) = [s 1 (k-1), s 2 (k-1), ..., s p-1 (k-1)] T r p-1 (k) = [x(k) T x(k-1), x(k) T x(k-2), ..., x(k) T x(k-p-1)] T Since the vector x(k), defined by Eq. (3), is given by x(k) = [x(k), x(k-1), ..., x(k-L+1)] T the following relationship holds x(k) T x(k-i) = x(k-1) T x(k-i-1) -x(k-L)x(k-L-i)+x(k)x(k-i) where i = 1, 2, ..., p-1 and the following equation holds r p-1 (k) = r p-1 (k-1)-x(k-L)x p-1 (k-L) +x(k)x p-1 (k) where x p-1 (k) = [x(k-1), x(k-2), ..., x(k-p+1)] T Next, a description will be given, with reference to Fig. 5, of the storage of the approximate value z(k) of the estimated transfer function h ∧(k) and the transfer function estimation procedure which is followed when the pre-filter coefficients are smoothed. At time k, a correlation calculation part 52, which is supplied with the input signal x(k), calculates the correlation vector r p-1 (k) by Eq. (46), using the input signal x(k), previous input values x(k-1), ..., x(k-L) and the correlation vector r p-1 (k-1) at the immediately preceding time. Then, an inner product s p-1 (k-1) T r p-1 (k) of the correlation vector r p-1 (k) and the smoothing coefficient vector s p-1 (k-1) of the pre-filter coefficients is calculated in an inner product calculation part 53. A convolution part 54 performs a convolution x(k) T z(k) of the stored approximate value z(k) of the estimated transfer function and the input signal. The results of the inner product calculation and the convolution are added together in an addition part 57 to synthesize the estimated value y ∧(k) of the unknown system output. These operations correspond to the operation of Eq. (41). Following this, the error e(k) between the unknown system output y(k) and the estimated value y ∧(k) is obtained by the subtractor 24 shown in Fig. 2 and the pre-filter coefficient g i (k) is calculated in the pre-filter coefficient vector calculation part 31 shown in Fig. 4. After this, the calculated pre-filter coefficients are sent to a pre-filter coefficient smoothing part 51 in Fig. 5, wherein they are smoothed to obtain p smoothing coefficients s 1 (k), s 2 (k), ..., s p-1 (k), s p (k). This smoothing operation is performed on the basis of Eq. (37). Of the smoothing coefficients, s 1 (k), s 2 (k), ..., s p-1 (k) are supplied, as elements of the smoothing coefficient vector s p-1 (k), to the inner product calculation part 53 and an estimated transfer function calculation part 56. The smoothing coefficient s p (k) is fed to an estimated transfer function approximate value storage part 55. The estimated transfer function approximate value storage part 55 updates the approximate value, using the smoothing coefficient s p (k) and the input signal vector x(k). That is, s p (k)x(k-p+1) is added to the approximate value z(k) stored until then and the added result is stored as z(k+1). This operation corresponds to the computation Eq. (40). Finally, in the estimated transfer calculation part 56 the smoothing coefficient vector s p-1 (k) and the input signal vector x(k) are used to calculate Eq. (39) to obtain the estimated transfer function h ∧(k+1). In the above-described operations, rough estimates of computational complexity involved in the respective parts are as follows: Correlation calculation part 52: 2p Inner product calculation part 53: p Convolution part 54: L Pre-filter coefficient vector calculation part 31: 16p Pre-filter coefficient smoothing part 51: p Linear approximate value storage part 55: L Estimated transfer function calculation part 56: Lp In the above, p-1 is regarded as nearly equal to p. The entire computational complexity is such as follows: (L+20)p+2L Now, attention should be paid to the following points. With the conventional transfer function estimation method depicted in Fig. 2, the estimated transfer function h ∧(k+1) corresponding to the transfer function is calculated at every time and is used to synthesize the estimated value y ∧(k) of the unknown system output. In contrast thereto, according to the present embodiment which utilizes the approximate value z(k) of the estimated transfer function, the estimated value y ∧(k) of the unknown system output can be synthesized without the need of calculating, directly, the estimated transfer function h ∧(k+1) as shown in Fig. 5. Once the estimated value y ∧(k) is obtained, the above-described operations can be performed. Accordingly, there is no need of calculating the estimated transfer function at every time in the cases where the estimated value h ∧(k+1) of the transfer function, obtained as the result of the long-time estimating operation, is needed and where the estimated value y ∧(k) of the unknown system output is needed rather than the estimated result of the transfer function (for example, in the case of the estimation of characteristics of a time-invariant system or in an acoustic echo canceller). On this account, the overall computational complexity at every time, except the computational complexity in the estimated transfer function calculation part 56, is as follows: 20p + 2L As referred to previously with respect to the prior art, the number of operations needed in the past is about 12000 when the tap number L of the filter is 500 and the projection order p is 20. From Eq. (49), however, the number of operations in the present invention is 1380; that is, the computational complexity is reduced to about 1/8 that in the prior art. As described above, the present invention permits substantial reduction of the computational complexity involved in the conventional projection scheme by the recursive synthesis of the pre-filter coefficient, storage of approximate values of the estimated transfer function vector and smoothing of the pre-filtering coefficients. While in the above the step size µ has been described to be handled as a scalar, it may also be provided as µA by use of a diagonal matrix A. For example, in the case where the energy of an impulse response of an unknown system decays exponentially, the transfer function estimation speed may sometimes be increased by arranging the elements of the diagonal matrix A as a progression which decays exponentially, as shown below. A = diag(α, αγ, αγ 2 , ..., αγ L-1 ), (0 < γ < 1) In this instance, the input to the linear prediction part is multiplied by a ratio γ 1/2 and R p (k) Eq. (14) is redefined by the following equation. This correction permits the application of the present invention described above. Next, a description will be given of examples of application of the transfer function estimating device of the present invention. A first example of application is the measurements of transfer functions of pieces of acoustic equipment. Fig. 6 illustrates a system for measuring the transfer function from a loudspeaker to a microphone. In Fig. 6, reference numeral 121 denotes a loudspeaker, 122 a microphone and 11 a transfer function estimating device. The output signal y(k) of the microphone 122 is a signal that has the characteristics of the loudspeaker 121 added to the input signal x(k). Regarding the loudspeaker 121 (including an acoustic path and the microphone as well) as an unknown system, the illustrated system is the same as that shown in Fig. 1, and by connecting the transfer function estimating device 11 of the present invention to the input of the loudspeaker 121 and the output of the microphone 122 as shown in Fig. 6, the transfer function h(k) of the loudspeaker can be estimated as the filter coefficient h ∧(k) of the FIR filter. The measurement is usually performed in an anechoic chamber to avoid the influence of room acoustical characteristics. A second example is an acoustic echo canceller which prevents howling or echo in a loudspeaker communication system such as a TV conference system or visual telephone. Fig. 7 is a diagram for explaining the acoustic echo canceller. In Fig. 7, reference numeral 121 denotes a receiving loudspeaker, 122 a transmitting microphone, 123 a room acoustic system and 20 an estimated echo generating part which is identical in construction with the estimated signal generating part 20 embodying the present invention in Fig. 2. The transfer function estimating device 11 of this embodiment operates as an acoustic echo canceller. In a hands-free communication system using the loudspeaker and the microphone, the other party's voice emanating from the receiving loudspeaker 121 is received by the transmitting loudspeaker via the room acoustic system of the transfer function h(k). The received signal y(k) is returned to the other party and reproduced there. At the other party side, the transmitted voice is sent back and reproduced; this phenomenon is called an acoustic echo and disturbs comfortable communication. The estimated echo generating part 20 of the acoustic echo canceller 11 estimates the room acoustical characteristics h(k) including characteristics of the loudspeaker and generates an estimated echo signal y ∧(k) based on the characteristics h ∧(k) estimated as those of the input signal x(k). The subtractor 24 subtracts the estimated echo signal y ∧(k) from the received signal y(k). When the estimation is performed well, the echo canceller 11 operates so that it minimizes the power of the error signal e(k) and hence makes the estimated echo signal y ∧(k) nearly equal to the received signal y(k), substantially reducing the acoustic echo. Comparison of the Fig. 7 system with the Fig. 2 system reveals that the transfer function estimating device of the present invention can be used directly as an echo canceller. The room acoustic system 123 in Fig. 7 corresponds to the unknown system 12 in Fig. 2 and the estimated echo y ∧(k) and the transmitted signal e(k) in Fig. 7 correspond to the output y(k) from the convolution part 23 and the error signal e(k) in Fig. 2, respectively. A third example is noise control. Fig. 8 illustrates the principles of noise control. In Fig. 8, reference numeral 131 denotes a noise source, 132 a noise transfer path expressed by the transfer function h(k), 133 a microphone for observation, 134 a noise monitor microphone, 20 an estimated noise generating part, 136 a phase inverter and 137 a loudspeaker. The purpose of noise control is to cancel noise that is observed via the noise transfer path of the transfer characteristics h(k) from the noise source 131, by generating negative estimated noise (letting a sound pressure be represented by y(k), a sound pressure represented by -y(k) is called a negative sound with respect to y(k)) from the loudspeaker 137. To attain this object, the transfer characteristics h(k) of the noise transfer path 132 is estimated in the estimated noise generating part 20 of the same construction as that of the estimated signal generating part 20 in Fig. 2. That is, noise is detected by the monitor microphone 134 in the vicinity of the noise source 131 and provided as the input signal x(k) to the estimated noise generating part 20, which generates an estimated value y ∧(k) of the noise signal y(k) at the observation point (i.e. the microphone 133). The estimated noise y ∧(k) is polarity inverted by the phase inverter 136 into a signal -y(k). Assuming, for the sake of brevity, that the loudspeaker characteristics are negligible, the signal -y ∧(k) from the loudspeaker 137 is a combination of the noise signal y(k) and the sound pressure in the microphone 133 at the observation point and the error signal e(k) is provided at the output of the microphone 133. In this instance, when the noise transfer path is estimated well, the signal y ∧(k) becomes similar to the noise y(k) from the noise source 131 and the noise y(k) is cancelled by the combined sound pressure -y ∧(k) from the loudspeaker 137. The microphone 133 in Fig. 8 corresponds to the subtractor 24 in Fig. 2; accordingly, the systems of Figs. 8 and 2 differ only in whether the error signal generated outside the estimating device 11 is provided thereto or the error signal is calculated in the estimating device 11. The principles of the present invention are applicable to the noise control device of Fig. 8. In the measurement of the transfer characteristics of the loudspeaker shown in Fig. 6, the loudspeaker characteristics do not change with time; hence, there is no need of learning measured results (transfer characteristics) in the course of measurement and the transfer characteristics need only to be made known as the result of measurement conducted after a certain period of time. In the acoustic echo canceller shown in Fig. 7, the room transfer function varies with time in response to movement of audiences or opening and closing of a door, for instance. As is evident from Fig. 7, however, the purpose of the acoustic echo canceller is attained by obtaining the estimated value y ∧(k) of the output y(k) of the room transfer function (the unknown system). Therefore, the estimated value h ∧(k) of the room transfer function itself is unnecessary in the acoustic echo canceller. Also in the noise control device of Fig. 8, its purpose can be attained by obtaining the estimated value y ∧(k) of the unknown system and no estimated value of the room transfer function itself is needed. As will be appreciated from the above, the transfer function estimating device of the present invention, when applied as described above, permits substantial reduction of the computational complexity as compared with the prior art. Furthermore, the present invention has a basic feature of minimizing the power of the error signal e(k) in such a system configuration as shown in Fig. 2. Thus, the present invention is applicable to all instances in which problems to be solved can be modelled as the error signal power minimizing problem shown in Fig. 2. In the embodiments described above, it will be effective to select the elements of the diagonal matrix A of Eq. (50) so that they provide the same attenuation as the room reverberation. Finally, a description will be given of experimental results of the acoustic echo canceller according to the present invention. Fig. 9 shows what are called learning curves, the ordinate representing echo return loss enhancement (hereinafter referred to as ERLE) and the abscissa representing time. As the estimation of the room transfer function proceeds with the lapse of time, the ERLE increases. In Fig. 9, the curve 211 is a learning curve in the case of the projection order p being 2, the curve 212 a learning curve in the case of the projection order p being 8 and the curve 213 a learning curve in the case of the projection order p being 32. It will be understood, from Fig. 9, that the larger the projection order, the higher the convergence speed (the ERLE increases in a short period of time). Fig. 10 is a graph showing the relationship between the projection order p and the required computational complexity, the abscissa representing the projection order p and the ordinate the number of multiply-add operations (including add operations as well). In Fig. 10, the curve 221 indicates the computational complexity in the prior art and the curve 222 the computational complexity when the present invention was used. The tap number L of the FIR filter for use in the estimation of the transfer function was 500. From Fig. 10 it will be seen that the computational complexity involved in the present invention is much smaller than in the case of the prior art when the projection order p is large. As described above, the present invention permits substantial reduction of the number of operations necessary for the estimation of the transfer function or output of an unknown system by the projection scheme. In concrete terms, letting the tap length of the FIR filter which represents the unknown system and the projection order be represented by L and p, respectively, the prior art requires multiply-add operations p 3 /6+(p+1)L , that is, the computational complexity is proportional to p 3 , whereas according to the present invention the computation complexity can be reduced down to 20p+2L. Such a reduction of computational complexity allows corresponding reduction in the scale of hardware, and hence significantly contributes to the downsizing of the device and reduction of its cost. Moreover, when the hardware is held on the same scale, the tap length L and the projection order can be chosen larger than in the past -- this speeds up the estimating operation and increases the estimation accuracy. Besides, when the present invention is embodied by a computer, the operation time can be greatly shortened.

Claims: A method of adaptively estimating the transfer function of an unknown technical system by use of a projection algorithm, said method comprising: (i) applying an input physical signal x(k) to said unknown system (12), k representing a discrete time; (ii) detecting an output physical signal y(k) from said unknown system (12); (iii) estimating the transfer function using said input signal x(k) and said output signal y(k) and generating an output signal y ∧(k) of an estimated system having said estimated transfer function h ∧(k), wherein said estimated system is implemented as a digital filter of tap number L; (iv) obtaining, as an error signal e(k)=y(k)- y (k) , the difference between the output signal y ∧(k) of said estimated system and the output signal y(k) of said unknown system (12); (v) calculating a correcting vector δh ∧(k) for the estimated transfer function from input signal vectors x(k), x(k-1), ..., x(k-p + 1) and error signals e(k), e(k-1), ... , e(k-p + 1) , where p is an integer equal to or greater than 2 and x(k) is defined as x(k)=[x(k), x(k-1),..., x(k-L+ 1)] T ; and (vi) using said correcting vector δh ∧(k) and a predetermined correcting step size µ to repeatedly correct said estimated transfer function h ∧(k) at each time k by the following equation: h (k+1) = h (k) + µδ h (k) so that said error signal e(k) approaches zero; characterized in that step (v) comprises the steps of: (v-1) calculating a pre-filter coefficient vector g(k) by solving the following simultaneous linear equation with p unknowns: R p (k)g(k)=e(k), wherein e(k) represents the vector of said error signal e(k) and is defined as e(k)=[e(k), (1-µ)e(k-1),..., (1-µ) p-1 e(k-p+1)] T , and R p (k) is a covariance matrix of said input signal x(k) defined as R p (k) = [x(k), x(k-1),..., x(k-p + 1)] T [x(k), x(k-1),..., x(k-p + 1)]; and (v-2) using said pre-filter coefficient vector 9(k) to calculate said correcting vector δh ∧(k) by the following equation: δ h (k) =[x(k), x(k-1), ..., x(k-p+1)]g(k), wherein x(k) represents the vector of said input signal x(k); wherein step (v-1) comprises the steps of: (v-1-a) calculating a forward linear prediction coefficient vector a(k) of said input signal x(k), the sum of its a posteriori prediction-error squares F(k), a backward linear prediction coefficient vector b(k) of said input signal x(k) and the sum of its a posteriori prediction-error squares B(k), and (v-1-b) letting a pre-filter deriving coefficient vector be represented by f(k), obtaining said pre-filter coefficient vector g(k) by a recursion formula composed of the following first and second equations: A method of adaptively estimating the transfer function of an unknown technical system by use of a projection algorithm, said method comprising: (i) applying an input physical signal x(k) to said unknown system (12), k representing a discrete time; (ii) detecting an output physical signal y(k) from said unknown system (12); (iii) estimating the transfer function using said input signal x(k) and said output signal y(k) and generating an output signal y ∧(k) of an estimated system having said estimated transfer function h ∧(k), wherein said estimated system is implemented as a digital filter of tap number L; (iv) obtaining, as an error signal e(k)=y(k)- y (k) , the difference between the output signal y ∧(k) of said estimated system and the output signal y(k) of said unknown system (12); (v) repeating the calculation of the estimated transfer function at each time k so that said error signal e(k) approaches zero; characterized in that step (v) comprises steps of: (v-1) calculating a pre-filter coefficient vector g(k) by solving the following simultaneous linear equation with p unknowns: R p (k)g(k)=e(k), wherein e(k) represents the vector of said error signal e(k) and is defined as e(k)=[e(k), (1-µ)e(k-1),..., (1-µ) p-1 e(k-p+1)] T , and R p (k) is a covariance matrix of said input signal x(k) defined as R p (k) = [x(k), x(k-1),..., x(k-p+1)] T [x(k), x(k-1),..., x(k-p+1)]; (v-2) smoothing pre-filter coefficients g i (k) which are elements of said pre-filter coefficient vector g(k) by the following equations: s i (k)=s i-1 (k-1)+µg i (k) for 2≤i≤p =µg 1 (k) for i=1 to obtain a smoothing coefficient s i (k); (v-3) obtaining an approximate estimated transfer function z(k + 1) as an approximation of said estimated transfer function using the smoothing coefficient s p (k) based on the following equation z(k + 1)=z(k) + s p (k)x(k-p + 1); (v-4) calculating the convolution x(k) T z(k) of said approximate estimated transfer function z(k) with an input signal vector x(k) defined as x(k)=[x(k), x(k-1),..., x(k-L + 1)] T ; (v-5) calculating the inner product s p-1 (k-1) T r p-1 (k) , setting the vector of said smoothing coefficient s i (k) and a correlation vector r p-1 (k) of said input signal to s p-1 (k-1)=[s 1 (k-1), s 2 (k-1), ..., s p-1 (k-1)] T , and r p-1 (k)=[x(k) T x(k-1), x(k) T x(k-2), ..., x(k) T x(k-p+1)] T , respectively; and (v-6) obtaining the sum of said convolution result x(k) T z(k) and said inner product as said estimated output signal y ∧(k). The method of claim 2, wherein step (v-1) comprises: (a) calculating a forward linear prediction coefficient vector a(k) of said input signal x(k), the sum of its a posteriori prediction-error squares F(k), a backward linear prediction coefficient vector b(k) of said input signal x(k) and the sum of its a posteriori prediction-error squares B(k), and (b) letting a pre-filter deriving coefficient vector be represented by f(k), obtaining said pre-filter coefficient vector g(k) by a recursion formula composed of the following first and second equations: The method of claim 1 or 3, wherein, letting the last element of said pre-filter coefficient vector g(k-1) be represented by g p (k-1), said pre-filter coefficient vector g(k) is calculated using the following equation which is a modified version of said second equation: The method of claim 1 or 3, wherein, letting predetermined two non-negative numbers be represented by δ F (k) and δ B (k-1), said pre-filter coefficient vector g(k) is calculated by the following equations which are modified versions of said first and second equations: The method of claim 2 or 3 wherein step (v-5) comprises calculating said correlation vector r p-1 (k) of said input signal x(k) by r p-1 (k) = r p-1 (k-1)-x(k-L)x p-1 (k-L)+x(k)x p-1 (k) where x p-1 (k) represents the vector of said input signal x(k) expressed as: x p-1 (k) = [x(k-1), x(k-2), ..., x(k-p+1)] T . A device for adaptive estimation of the transfer function of an unknown technical system by use of a projection algorithm, said device comprising: means for applying an input physical signal x(k) to said unknown system (121, k representing a discrete time; means for detecting an output physical signal y(k) from said unknown system (12); means (11) for estimating the transfer function using said input signal x(k) and said output signal y(k) and generating an output signal y ∧(k) of an estimated system (23) having said estimated transfer function h ∧(k), wherein said estimated system is implemented as a digital filter of tap number L; means (24) for obtaining, as an error signal e(k)=y(k)- y (k) , the difference between the output signal y ∧(k) of said estimated system and the output signal y(k) of said unknown system (12); means (21) for calculating a correcting vector δh ∧(k) for the estimated transfer function from input signal vectors x(k), x(k-1), ... , x(k-p+1) and error signals e(k), e(k-1), ... , e(k-p+1) , where p is an integer equal to or greater than 2 and x(k) is defined as x(k)=[x(k), x(k-1),..., x(k- L+1)] T ; and means (22) for repeatedly correcting, at each time k using said correcting vector δh ∧(k) and a predetermined correcting step size µ, said estimated transfer function h ∧(k) by the following equation: h (k+1) = h (k) + µδ h (k) so that said error signal e(k) approaches zero; characterized in that said means (21) for calculating the correcting vector δh ∧(k) comprises: means (31) for calculating a pre-filter coefficient vector g(k) by solving the following simultaneous linear equation with p unknowns: R p (k)g(k)=e(k), wherein e(k) represents the vector of said error signal elk) and is defined as e(k)=[e(k), (1-µ)e(k-1),..., (1-µ) p-1 e(k-p+1)] T , and R p (k) is a covariance matrix of said input signal x(k) defined as R p (k)=[x(k), x(k-1),..., x(k-p+1)] T [x(k), x(k-1),..., x(k-p+1)]; and means (32) for calculating, using said pre-filter coefficient vector g(k), said correcting vector δh ∧(k) by the following equation: δ h (k) =[x(k), x(k-1), ..., x(k-p+1)]g(k), where x(k) represents the vector of said input signal x(k); and said means (31) for calculating said pre-filter coefficient vector g(k) comprises: means (41) for calculating a forward linear prediction coefficient vector a(k) of said input signal x(k), the sum of its a posteriori prediction-error squares F(k), a backward linear prediction coefficient vector b(k) of said input signal x(k) and the sum of its a posteriori prediction-error squares B(k), and means (42, 43, 44) for obtaining said pre-filter coefficient vector g(k) by a recursion formula composed of the following first and second equations: where f(k) represents a pre-filter deriving coefficient vector. A device for adaptive estimation of the transfer function of an unknown technical system by use of a projection algorithm, said device comprising: means for applying an input physical signal x(k) to said unknown system (12), k representing a discrete time; means for detecting an output technical signal g(k) from said unknown system (12); means (11) for estimating the transfer function using said input signal x(k) and said output signal y(k) and generating an output signal y ∧(k) of an estimated system (23) having said estimated transfer function h ∧(k), wherein said estimated system is implemented as a digital filter of tap number L; means (24) for obtaining, as an error signal e(k) = y(k)- y (k) , the difference between the output signal y ∧(k) of said estimated system and the output signal y(k) of said unknown system (12); and means (20) for calculating the estimated transfer function at each time k so that said error signal e(k) approaches zero; characterized in that said means (20) for calculating the estimated transfer function comprises: means (31) for calculating a pre-filter coefficient vector g(k) by solving the following simultaneous linear equation with p unknowns: R p (k)g(k) = e(k), wherein e(k) represents the vector of said error signal e(k) and is defined as e(k)=[e(k), (1-µ)e(k-1),..., (1-µ) p-1 e(k-p+1)] T , and R p (k) is a covariance matrix of said input signal x(k) defined as R p (k) = [x(k), x(k-1),..., x(k-p + 1)] T [x(k), x(k-1),..., x(k-p+1)]; means (51) for smoothing pre-filter coefficients g i (k), which are elements of said pre-filter coefficient vector g(k), by the following equations: s i (k)=s i-1 (k-1)+µg i (k) for 2≤i≤p = µg 1 (k) for i=1 to obtain a smoothing coefficient s i (k); and means (55) for obtaining an approximate estimated transfer function z(k + 1) as an approximation of said estimated transfer function using the smoothing coefficient s p (k) based on the following equation z(k + 1) = z(k) + s p (k)x(k-p + 1); and said estimated system (23) comprises: means (54) for calculating the convolution x(k) T z(k) of said approximate estimated transfer function z(k) with an input signal vector x(k) defined as x(k)=[x(k), x(k-1),..., x(k- L+1)] T ; means (53) for calculating the inner product s p-1 (k-1) T r p-1 (k) , setting the vector of said smoothing coefficient s i (k) and a correlation vector r p-1 (k) of said input signal to s p-1 (k-1)=[s 1 (k-1), s 2 (k-1), ..., s p-1 (k-1)] T and r p-1 (k)=[x(k) T x(k-1), x(k) T x(k-2), ..., x(k) T x(k-p + 1)] T respectively; and means (57) for obtaining the sum of said convolution result x(k) T z(k) and said inner product as said estimated output signal y ∧(k). The device of claim 8, wherein said means (31) for solving said simultaneous linear equation with p unknowns comprises: means (41) for calculating a forward linear prediction coefficient vector a(k) of said input signal x(k), the sum of its a posteriori prediction-error squares F(k), a backward linear prediction coefficient vector b(k) of said input signal x(k) and the sum of its a posteriori prediction-error squares B(k), and means (42, 43, 44) for obtaining said pre-filter coefficient vector g(k) by a recursion formula composed of the following first and second equations: where f(k) represents a pre-filter deriving coefficient vector. The device of claim 8 or 9, wherein said inner product calculating means includes correlation calculating means for calculating said correlation vector r p-1 (k) of said input signal x(k) by r p-1 (k) = r p-1 (k-1)-x(k-L)x p-1 (k-L) + x(k)x p-1 (k), where x p-1 (k) represents the vector of said input signal x(k) expressed as: x p-1 (k) = [x(k-1), x(k-2), ..., x(k-p+1)] T . The device of claim 7 or 9, wherein said pre-filter deriving coefficient vector correcting means is means which, letting the last element of said pre-filter coefficient vector g(k-1) be represented by g p (k-1), calculates said pre-filter coefficient vector g(k) by the following equation which is a modified version of said second equation: The device of claim 7 or 9, wherein, letting predetermined non-negative numbers be represented by δ F (k) and δ B (k-1), respectively, said pre-filter coefficient vector correcting means and said pre-filter deriving coefficient vector correcting means calculate said pre-filter coefficient vector g(k) by the following equations, respectively, which are modified versions of said first and second equations: The device of claim 7 or 10, further comprising subtracting means for providing, as said error signal e(k), the difference y(k)-y ∧(k) between said output signal y(k) of said unknown system (12) and said estimated signal y ∧(k) which is the output of said estimated system.

Inventors: HANEDA YOICHI, KANEDA YUTAKA, KOJIMA JUNJI, MAKINO SHOJI, TANAKA MASASHI, HANEDA, YOICHI, KANEDA, YUTAKA, KOJIMA, JUNJI, MAKINO, SHOJI, TANAKA, MASASHI
Applicants: NIPPON TELEGRAPH & TELEPHONE, NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Application year: 1994
Main classification: G06F17
IPC codes: G06F17, G05B13, G05B23