Regularized Fast Recursive Least Squares Algorithms for Adaptive Filtering

IEEE Transactions on Signal Processing

Volumn 39, Issue 4, 1991, Pages 860-871

  Houacine, Amrane ^a  

^a UNIVERSITY OF SCIENCES AND TECHNOLOGY HOUARI BOUMEDIENE   (Algeria)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--LEAST SQUARES APPROXIMATIONS;

ADAPTIVE FILTERING; FACTORIZATION TECHNIQUES;

SIGNAL FILTERING AND PREDICTION;

EID: 0026136844     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.80908     Document Type: Article

References (27)

1. H. Akaike, “Likelihood and the Bayes procedure,” in Bayesian Statistics, Bernardo et al., Eds. Valencia, Spain: University Press, 1980, pp. 141–166.
2. G. Carayannis, D. Manolakis, and N. Kalouptsidis, “Fast Kalman type algorithms for sequential signal processing,” in Proc. IEEE ICASS P-83, (Boston, MA), 1983, pp. 186–189.
3. G. Carayannis, D. Manolakis, and N. Kalouptsidis, “A unified view of parametric processing algorithms for prewindowed signals,” Signal Processing, vol. 10, pp. 335–368, 1986.
4. J. M. Cioffi, “Limited-precision effects in adaptive filtering,” IEEE Trans. Circuits Syst., vol. CAS-34, pp. 821–833, 1987.
5. J. M. Cioffi and T. Kailath, “Fast, fixed-order, least squares algorithms for adaptive filtering,” in Proc. IEEE ICASSP-83 (Boston. MA), 1983. pp. 679–682.
6. J. M. Cioffi and T. Kailath, “Fast, recursive least squares transversal filters for adaptive filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 304–337, 1984.
7. G. Demoment and R. Reynaud, “Equations de Shur et de Chandrasekhar généralisées pour des problémes généraux d'estimation linéaire,” presented at the 1 l eme colloque GRETSI, Nice, France, 1987
8. J. N. Franklin, “Well-posed stochastic extensions of ill-posed linear problems,” J. Math. Anal. Appl., vol. 31, pp. 682–716, 1970.
9. D. Falconer and L. Ljung, “Application of fast Kalman estimation to adaptive equalization,” IEEE Trans. Commun., vol. COM-26, no. 10, pp. 1439–1446.
10. G. H. Golub, M. Heath, and G. Wahba, “Generalized cross validation as a method for choosing a good Ridge parameter,” Technometrics, vol. 21, no. 2, pp. 215–222, 1979.
11. C. Gueguen, “An introduction to displacement ranks and related fast algorithms,” presented at the USMG NATO, Summer School on Digital Signal Processing, Les Houches, 1985.
12. C. C. Halkias, G. Carayannis, J. Dologlou, and D. Emmanoulopoulos, “A new generalized recursion for the fast computation of the Kalman gain to solve the covariance equations,” in Proc. IEEE ICASSP-82 (Paris. France), 1982, pp. 1760–1763.
13. P. Hall and D. M. Titterington, “Common structure of techniques for choosing smoothing parameters in regression problems,” J. Roy. Statist. Soc. B. vol. 49, no. 2, pp. 184–198, 1987.
14. Y. C. Ho and R. C. K. Lee, “A Bayesian approach to problems in stochastic estimation and control,” IEEE Trans. Automat. Contr., vol. AC-9, pp. 333–339, 1964.
15. A. Houacine, “Regularization approach to the stabilization of last recursive least squares algorithms,” Inst. Electron., Univ. of Sciences and Technol. of Algiers, Internal Rep.
16. A. Houacine and G. Demoment, “Chandrasekhar adaptive regularizer for adaptive filtering,” in Proc. IEEE ICASSP-86 (Tokyo, Japan), 1986, pp. 2967–2970.
17. A. Houacine and G. Demoment, “Fast adaptive spectrum estimation: Bayesian approach and long AR models,” in Proc. IEEE ICASSP-87 (Dallas. TX), 1987, pp. 2085–2088.
18. J.-D. Wang and H. J. Trussell, “A unified derivation of fast RLS algorithms,” in Proc. IEEE ICASSP-86 (Tokyo, Japan), 1986, pp. 261–264.
19. G. Kitagawa and W. Gersch, “A smoothness priors time varying AR coefficient modeling of nonstationary covariance time series,” IEEE Trans. Automat. Contr., vol. AC-30, pp. 48–56, 1985.
20. F. Ling and J. Proakis, “Numerical accuracy and stability: Two problems of adaptive estimation algorithms caused by roundoff errors,” in Proc. IEEE ICASSP-84 (San Diego, CA), Pap. 30.3, 1984.
21. L. Ljung, M. Morf, and D. Falconer, “Fast calculation of gain for recursive estimation schemes,” Int. J. Contr., vol. 27, no. 1, pp. 1–19. 1978.
22. S. L. Marple and L. R. Rabiner, “Performance of a fast algorithm for FIR system identification using least-squares analysis,” Bell Tech. J., vol. 62. pp. 717-742. 1983.
23. M. Morf, G. S. Sidhu, and T. Kailath, “Some new algorithms for recursive estimation in constant, linear, discrete time systems,” IEEE Trans. Automat. Contr., vol. AC-19, pp. 315–323, 1974.
24. D. L. Phillips, “A technique for numerical solution of certain integral equations of the first kind,” J. Assoc. Comput. Mach., vol. 9, pp. 84–97, 1962.
25. C. M. Rader and A. O. Steinhardt, “Hyperbolic Householder transformations,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 6. pp. 1589–1602, 1986.
26. O. N. Strand and R. Westwater, “Statistical estimation of the numerical solution of the Fredholm integral equation of the first kind,” J. Assoc. Comput. Mach., vol. 15, pp. 100–114, 1968.
27. S. Twomey, “On the numerical solution of Fredholm integral equations of the first kind by inversion of the linear system produced by quadrature,” J. Assoc. Comput. Mach., vol. 10, pp. 97–101, 1962.