Efficient Time-Recursive Least-Squares Algorithms for Finite-Memory Adaptive Filtering

IEEE Transactions on Circuits and Systems

Volumn 34, Issue 4, 1987, Pages 400-408

  Manolakis, Dimitris ^a   Ling, Fuyun ^b   Proakis, John G ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - LEAST SQUARES APPROXIMATIONS;

ADAPTIVE ELECTRIC FILTERS;

ELECTRIC FILTERS;

EID: 0023330105     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1987.1086148     Document Type: Article

References (19)

1. G. Goodwin, R. Payne, Dynamic Systems Identification New york:ademic, 1977
2. L. Ljung, M. Morf, and D. Falconer, “Fast calculation of gain matrices for recursive estimation schemes,” Int. J. Control, vol. 27, no. 1, pp. 1–19, Jan. 1973.
3. B. Friedlander, “Lattice filters for adaptive processing,” Proc. IEEE, vol. 70, no. 8, pp. 829–867, Aug. 1982.
4. G. Carayannis, D. Manolakis, and N. Kalouptisids, “A fast sequential algorithm for LS filtering and prediction,” IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-31, 1394–1402, Dec. 1983.
5. J. Cioffi and T. Kailath, “Fast recursive LS, transversal filters for adaptive processing,” IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-32, pp. 304–337, Apr. 1984.
6. A. Jazwinsky, Stochastic Processes and Filtering Theory. New York: Academic, 1970.
7. N. Kalouptsidis, G. Carayannis, and D. Manolakis, “A fast covariance type algorithm for sequential LS filtering and prediction,” IEEE Trans. Automat. Contr., Sept. 1984, to be published; also in Proc. CDD Conf. (San Antonio, TX), 1983.
8. J. Cioffi and T. Kailath, “Windowed fast transversal filters adaptive algorithms with normalization,” vol. ASSP-33, pp. 607–625, June 1985.
9. L. Ljung and T. Soderstorm, Theory and Practice of Recursive Identification. Cambridge, MA: MIT Press, 1983.
10. D. Manolakis, G. Carayannis, and N. Kalouptsidis, “On the computational organization of fast sequential algorithms,” in Proc. ICASSP'84 (San Diego, CA), 1984.
11. G. Bierman, Factorization Methods for Discrete Sequential Estimation. New York: Academic, 1977.
12. F. Ling and J. Proakis, “A recursive modified Gram—Schmidt algorithm with application to LS estimation and adaptive filtering,” Proc. ISCS’84, Montreal, Canada, 1984.
13. B. Widrow et al., “Stationary and nonstationary learning characteristics of the LMS adaptive filter,” IEEE Proc., vol. 64, pp. 1156–1162, Aug. 1976.
14. S. Godard, “Channel equalization using Kalman filter for fast data transmission,” IBM J. Res. Develop., pp. 267–273, May 1974.
15. R. M. Johnstone et al.,“Exponential convergence of recursive least squares with exponential forgetting factor,” in IEEE Proc. CDC’ 82, 1982, pp. 994–997.
16. F. Long and J. Proakis, “Nonstationary learning Characteristics of LS adaptive estimation algorithms,” in Proc. of ICASSP'84 (San Diego, CA), 1984.
17. D. Manolakis, F. Ling, and J. Proakis, “Efficient least-squares algorithms for finite memory adaptive filtering,” in Proc. 1984 Conf. Inform. Sciences and Syst. (Princeton, NJ), Mar. 14-16, 1984.
18. F. Ling and J. G. Proakis, “Numerical accuracy and stability: Two problems of adaptive algorithms caused by round off error,” in IEEE Proc. ICASSP'84 (San Diego, CA), Mar. 1984.
19. S. Ljung and L. Ljung, “Error propagation properties of recursive least-squares adaptation algorithms, Automatica, vol. 21, no. 2, pp. 157-167,1985.