Recursive Triangular Array Ladder Algorithms

IEEE Transactions on Signal Processing

Volumn 39, Issue 1, 1991, Pages 122-136

  Strobach, Peter ^a  

^a SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL TECHNIQUES--LEAST SQUARES APPROXIMATIONS;

ARRAY PROCESSING; LADDER ALGORITHMS; RECURSIVE LEAST SQUARES METHODS; SYSTOLIC ARRAYS; TRIANGULAR ARRAYS;

SIGNAL PROCESSING;

EID: 0025746737     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.80771     Document Type: Article

References (31)

1. P. Strobach, Linear Prediction Theory: A Mathematical Basis for Adaptive Systems, Springer Series in Information Sciences, vol. 21. Springer, 1990.
2. S. Haykin, Adaptive Filter Theory. Englewood Cliffs, NJ: Prentice-Hall, 1985.
3. S.-Y. Kung, ``VLSI array processors,” IEEE ASSP Mag., vol. 2, pp. 4–22, 1985.
4. H. T. Kung, “Why systolic architectures,” IEEE Comput., pp. 37–46, Jan. 1982. -
5. 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–835, 1986.
6. M. Morf, “Fast algorithms for multivariable systems,” Ph.D. dissertation, Stanford University, Stanford, CA, 1974.
7. D. T. L. Lee, “Canonical ladder form realizations and fast estimation algorithms,” Ph.D. dissertation, Stanford University, Stanford, CA, 1980.
8. W. M. Gentleman, “Least squares computation by Givens transformations without square roots,” J. Inst. Math. Appl., vol. 12, pp. 329–336, 1973.
9. H. T. Kung and W. M. Gentleman, “Matrix triangularization by systolic arrays,” Proc. SPIE Int. Soc. Opt. Eng., vol. 298, p. 16, 1981.
10. J. G. McWhirter, “Recursive least squares minimization using a systolic array,” Proc. SPIE Int. Soc. Opt. Eng., vol. 431, pp. 18–26, 1983.
11. P. Strobach, “Pure order recursive least squares ladder algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 880–897, 1986.
12. P. Strobach, “Recursive covariance ladder algorithms for ARMA system identification,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-36, pp. 560–580, 1988.
13. P. Strobach, “Efficient covariance ladder algorithms for finite arithmetic applications,” Signal Processing, vol. 13, pp. 29–70, 1987.
14. F. Ling and J. G. Proakis, “Numerical accuracy and stability: Two problems caused by roundoff error,” in Proc. IEEE lnt. Conf. Acoust., Speech, Signal Processing (San Diego, CA), 1984, pp. 30.3.1-30.3.4.
15. U. Appel and A. v. Brandt, “Recursive lattice algorithms with finite duration windows,” in Proc. Int. Conf Acoust., Speech, Signal Processing (Paris), 1982, pp. 647–650.
16. J. M. Cioffi, “High-speed systolic implementation of fast QR adaptive filters,” in Proc. ICASSP-88 (New York, NY), Apr. 1988, pp. 1584–1587.
17. J. M. Cioffi, “The fast adaptive ROTOR's RLS algorithm,- IEEE Trans. Acoust., Speech, Signal Processing, vol. 39, no. 4, pp. 631–653, Apr. 1990.
18. B. Widrow et al., “Stationary and nonstationary learning characteristics of the LMS adaptive filter,” Proc. IEEE, vol. 64, pp. 1151–1162, 1976.
19. N. Levinson, “The Wiener RMS (root-meansquare) error criterion in filter design and prediction,” J. Math. Phys., vol. 25, pp. 261–278, 1947.
20. J. Durbin, “The fitting of time series models,” Rev. Int. Stat., vol. 28, pp. 233–244, 1960.
21. J. W. Givens, “Numerical computation of the characteristic values of a real symmetric matrix,” Oak Ridge Nat. Lab., ORNR 1574, Internal Rep., 1954.
22. N. J. Bershad and O. Macchi, “Comparison of RLS and LMS algorithms for tracking a chirped signal,” in Proc. ICASSP-89 (Glasgow, Scotland), May 1989, pp. 896–899.
23. K. C. Sharman and T. S. Durrani, “A triangular adaptive lattice filter for spatial signal processing,” in Proc. ICASSP-83 (Boston), Apr. 1983, pp. 348–351.
24. G. U. Yule, “On the theory of correlation for any number of variables, treated by a new system of notation” (1907), in Statistical Papers of George Udny Yule. London: Griffin, 1971, pp. 85–96.
25. J. LeRoux and C. Gueguen, “A fixed-point computation of partial correlation coefficients,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 257–259, 1977.
26. J. Sokat and P. Strobach, “A new class of pure order recursive ladder algorithms,” in Proc. IEEE Int. Workshop on Digital Signal Processing (Stanford Sierra Lodge, Tahoe, CA), 1988.
27. J. Sokat, “The split generalized LeRoux-Gueguen algorithm for least squares problems,” in Proc. Int. Symp. Signals, Syst., Electron. (URSI, Erlangen), Sept. 1989.
28. T. P. Barnwell, III, “Recursive windowing for generating autocorrelation correlation coefficients for LPC analysis,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, pp. 1062–1066, 1981.
29. C. L. Lawson and R. J. Hanson, Solving Least-Squares Problems. Englewood Cliffs, NJ: Prentice-Hall, 1974.
30. J. M. Ciokand P. Strobach, private communications, 1989.
31. J. Schur, “Uber Potenzreihen die im Innern des Einheitskreises beschrankt sind,” J. Reine Angew Math., vol. 147, pp. 205–232, 1917 (English translation reprinted in Operator Theory: Advances Applicat., vol. 18, pp. 31–60, 1986).