A Unified Square-Root-Free Approach for QRD-Based Recursive Least Squares Estimation

IEEE Transactions on Signal Processing

Volumn 41, Issue 3, 1993, Pages 1405-1409

  Hsieh, S F ^a   Liu, K J R ^b   Yao, K ^c  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b UNIVERSITY OF MARYLAND   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ESTIMATION; LEAST SQUARES APPROXIMATIONS; OPTIMIZATION;

GIVENS ROTATION; LEAST SQUARES ESTIMATION; QR DECOMPOSITION;

VLSI CIRCUITS;

EID: 0027557332     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.205742     Document Type: Article

References (15)

1. E. H. Bareiss, "Numerical solution of the weighted least squares problems by G-transformations," Tech. Rep. 82-03-NAM-03, Dep. Elec. Eng. Comput. Sci., Northwestern University, Evanston, IL, Apr. 1982.
2. J. L. Barlow and I. C. F. Ipsen, "Scaled Givens rotations for the solution of linear least squares problems on systolic arrays," SIAM J. Sci. Stat. Comput., vol. 8, no. 5, pp. 716–733, Sept. 1987.
3. G. J. Bierman, Factorization Methods for Discrete Sequential Estimation. New York: Academic, 1977, p. 44.
4. M. J. Chen and K. Yao, "Comparisons of QR least squares algorithms for systolic array processing," Proc. Conf. Inform. Sci. Syst., Mar. 1988. pp. 683-688.
5. W. M. Gentleman, "Least squares computations by Givens transformations without square roots," J. Inst. Math. Appl., vol. 12, pp.329-336, 1973.
6. W. M. Gentleman and H. T. Kung, "Matrix triangularization by systolic arrays," Proc. SPIE Int. Soc. Opt. Eng., vol. 298, pp. 19–26, 1981.
7. G. H. Golub and C. F. Van Loan, Matrix Computations, 2nd ed. Baltimore, MD: Johns Hopkins Press, 1989.
8. J. Gotze and U. Schwiegelshohn, "An orthogonal method for solving systems of linear equations without square roots and with few divisions," Proc. IEEE ICASSP, 1989, pp. 1298-1301.
9. S. Hammarling, "A note on modifications to the Givens plane rotation," J. Inst. Math. Appl., vol. 13, pp. 215–218, 1974.
10. S. Kalson and K. Yao, "Systolic array processing for order and time recursive generalized least squares estimation," Proc. SPIE Int. Soc. Opt. Eng., vol. 564, pp. 28–38, 1985.
11. F. Ling, D. Manolakis, and J. G. Proakis, "A recursive modified Gram-Schmidt algorithm for least squares estimation," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 4, pp. 829–836, Aug. 1986.
12. F. Ling, "Efficient least squares lattice algorithm based on Givens rotations with systolic array implementation," Proc. IEEE ICASSP, 1989, pp. 1290-1293.
13. J. G. McWhirter, "Recursive least squares minimization using a systolic array," Proc. SPIE Int. Soc. Opt. Eng., vol. 431, pp. 105–112, 1983.
14. I. Proudler, J. G. McWhirter, and T. J. Shepherd, "The QRD-based least squares lattice algorithm: Some computer simulations using finite wordlength," Proc. IEEE ISCAS, New Orleans, May 1990. pp. 258-261.
15. S. F. Hsieh, K. J. R. Liu, and K. Yao, "A unified sqrt-free rank-1 up/downdating approach for recursive least squares problems," Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing (ICASSP), Toronto, May 1991, pp. 1017-1020.