A recursive modified gram-schmidt algorithm for least-squares estimation

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 34, Issue 4, 1986, Pages 829-836

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

^a MOTOROLA INC   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747253647     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1986.1164877     Document Type: Article

References (23)

1. D. Godard, “Channel equalization using a Kalman filter for fast data transmission,” IBM J. Res. Develop., pp. 267–273, May 1974
2. G. J. Bierman, Factorization Methods for Discrete Sequential Estimation. New York: Academic, 1977
3. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems. Englewood Cliffs, NJ: Prentice-Hall, 1974
4. A. Bjorck, “Solving linear least squares problems by Gram-Schmidt orthogonalization,” BIT, vol. 7, pp. 1–21, Jan. 1967
5. W. M. Gentleman, “Least squares computation by Givens transformation without square roots,” J. Inst. Math. Appl., vo l. 12, pp. 329–336, 336, 1973
6. J. McWhirter, “Recursive least-squares minimization using a systolic array,” SPIE, paper 431–15, 1983
7. H. T. Kung and W. M. Gentleman, “Matrix triangularization by systolic arrays,” Proc. SPIE, vol. 298, 1981
8. S. Y. Kung, “VLSI array processors,” IEEE Acoust., Speech, Signal Processing Mag. vol. 2, pp. 4–22, July 1985
9. W. C. Liles et al., “Gram-Schmidt adaptive algorithms,” ROME Air Devel., Tech. Rep., RADC-TR-19-319
10. A. Ahmed and D. H. Youn, “On a realization and related algorithms of adaptive prediction,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, pp. 493–497, Oct. 1980
11. K. Gallivan and C. Leiserson, High-performance architectures for adaptive filter based on the Gram-Schmidt algorithm,” SPIE, Real-Time Time Signal Processing, pp. 30–36, 1984
12. F. Ling and J. G. Proakis, “A recursive modified Gram-Schmidt algorithm with applications to least squares estimation and adaptive filtering,” in IEEE Proc. ISCS’84, Montreal, P.Q., Canada, May 1984
13. D. Lee et al., “Recursive least squares ladder estimation algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, 29, pp. 627–641, June 1981
14. J. D. Pack and E. H. Satorius, “Least squares adaptive lattice algorithms,” NOSC Tech. Rep. TR423, Apr. 1979
15. S. Kalson, “Recursive least squares filtering algorithms with systolic array architectures: A geometric approach,” Ph.D. dissertation, Dep. Elec. Eng., Univ. Calif., Los Angeles, 1985
16. [16] E. H. Satorius and J. D. Pack, “Application of least squares lattice algorithms to adaptive equalization,” IEEE Trans. Commun., vol. COM-29, pp. 136–142, Feb. 1981
17. F. Ling and J. G. Proakis, “Numerical accuracy and stability: Two problems of adaptive algorithms caused by roundoff error,” in IEEE Proc. ICASSP ‘84, San Diego, CA, Mar. 1984
18. D. D. Falconer and L. Ljung, “Application of fast Kalman estimation to adaptive equalization,” IEEE Trans. Commun., vol. COM-26, pp. 1439–1446, Oct. 1978
19. F. Ling, “Rapidly convergent adaptive filtering algorithms with applications to adaptive equalization and channel estimation,” Ph.D. dissertation, Elec. Comput. Eng., Northeastern Univ., Boston, MA, Sept. 1984
20. F. Ling and J. G. Proakis, “A generalized multichannel least squares lattice algorithm with sequential processing stages,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 381–389, Apr. 1984
21. T. Kawase, H. Sakai, and H. Tokumara, “Recursive least squares circular lattice and escalator estimation algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 228–231, Feb. 1983
22. F. Ling, D. Manolakis, and J. G. Proakis, “A flexible, numerically robust array processing algorithm and its relationship to the Givens transformation,” in Proc. IEEE ICASSP ‘86, Tokyo, Japan, paper 40.10, Apr. 1986
23. D. Manolakis, F. Ling, and J. G. Proakis, “Efficient least-squares algorithms for finite memory adaptive filtering,” in IEEE Proc. 1984 Int. Symp. Circuits Syst., Montreal, P.Q., Canada, May 1984