Rotation-based RLS algorithms: Unified derivations, numerical properties, and parallel implementations

IEEE Transactions on Signal Processing

Volumn 40, Issue 5, 1992, Pages 1151-1167

  Yang, Bin ^a   Böhme, Johann F ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; MATHEMATICAL TECHNIQUES - LEAST SQUARES APPROXIMATIONS; SIGNAL PROCESSING - DIGITAL TECHNIQUES;

GIVENS ROTATIONS; MULTICHANNEL LINEAR PREDICTION; PIPELINED ARCHITECTURE; ROTATION-BASED RLS ALGORITHMS; TRANSVERSAL FILTERING;

SIGNAL FILTERING AND PREDICTION;

EID: 0026858012     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.134478     Document Type: Article

References (43)

1. S. Haykin, Adaptive Filter Theory. Englewood Cliffs, NJ: Prentice-Hall, 1986.
2. C. F. N. Cowan and P. M. Grant, Adaptive Filters. Englewood Cliffs, NJ: Prentice-Hall, 1985.
3. M. G. Bellanger, Adaptive Digital Filters and Signal Processing. New York: Marcel Dekker, 1987.
4. W. M. Gentleman, “Least squares computations by Givens transformations without square roots,” J. Inst. Math. Appl., vol. 12, pp. 329–336, 1973.
5. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems. Englewood Cliffs, NJ: Prentice-Hall, 1974.
6. W. M. Gentleman and H. T. Kung, “Matrix triangularization by systolic arrays,” Proc. SPIE Int. Soc. Opt. Eng., pp. 19–26, 1981.
7. J. G. McWhirter, “Recursive least-squares minimization using a systolic array,” Proc. SPIE Int. Soc. Opt. Eng., pp. 105–112, 1983.
8. D. D. Falconer and L. Ljung, “Application of fast Kalman estimation to adaptive equalization,” IEEE Trans. Commun., vol. 26, no. 10, pp. 1439–1446. 1978.
9. G. Carayannis, D. Manolakis, and N. Kalouptsidis, “A fast sequential algorithm for least squares filtering and prediction,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 31, no. 6, pp. 1392–1402, 1983.
10. J. M. Cioffi and T. Kailath, “Fast, recursive least squares transversal filters for adaptive filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 32, no. 2, pp. 304–337, 1984.
11. B. Friedlander, “Lattice filters for adaptive filtering,” Proc. IEEE, vol. 70, no. 8, pp. 829–867, 1982.
12. M. M. D. T. Lee and B. Friedlander, “Recursive least-squares ladder estimation algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 29, no. 3 pp. 627–641, 1981.
13. J. M. Cioffi, “The fast adaptive rotor’s RLS algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, no. 4, pp. 631–653, 1990.
14. F. Ling, “Givens rotation based least squares lattice and related algorithms,” IEEE Trans. Signal Processing, vol. 39, no. 7, pp. 1541–1551, July 1991.
15. M. G. Bellanger, “The FLS-QR algorithm for adaptive filtering,” in Proc. NATO Adv. Study Inst. Numer. Linear Alg., Digital Signal Processing Parallel Algorithms, Aug. 1988.
16. I. K. Proudler, J. G. McWhirter, and T. J. Shepherd, “Fast QRD-based algorithms for least squares linear prediction,” in Proc. IMA Conf. Math. Signal Processing, Dec. 1988.
17. I. K. Proudler, J. C. McWhirter, and T. J. Shepherd, “QRD-based lattice filter algorithms,” Proc. SPIE Int. Soc. Opt. Eng., Aug. 1989.
18. P. A. Regalia and M. G. Bellanger, “On the duality between fast QR methods and lattice methods in least squares filtering,” IEEE Trans. Signal Processing, vol. 39, no. 4, pp. 879–891, Apr. 1991.
19. B. Yang and J. F. Böhme, “Systolic arrays for adaptive least squares algorithms,” in Proc. Int. Symp. Math. Theory Networks Syst., June 1989.
20. H. S. T. Kawase and H. Tokumaru, “Recursive least squares circular lattice and escalator estimation algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 31, no. 2, pp. 228–231, 1983.
21. F. Ling and J. G. Proakis, “A generalized multichannel least squares lattice algorithm based on sequential processing stages,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 32, no. 2, pp. 381–389, 1984.
22. H. Lev-Ari, “Modular architectures for adaptive multichannel lattice algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 35, pp. 543–552, 1987.
23. P. S. Lewis, “Algorithms and architectures for adaptive least squares signal processing, with applications in magnetoencephalography,” Ph.D. dissertation, Los Alamos Nat. Lab., Los Alamos, NM, Oct. 1988.
24. P. S. Lewis, “QR-based algorithms for multichannel adaptive least squares lattice filters,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, no. 3, pp. 421–432, 1990.
25. B. Yang and J. F. Böhme, “On a parallel implementation of the multichannel adaptive least-squares lattice filter,” in Proc. URSI ISSSE, Sept. 1989, pp. 236–239.
26. H. Leung and S. Haykin, “Stability of recursive QRD-LS algorithms using finite-precision systolic array implementation,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, no. 5, pp. 760–763, 1989.
27. P. A. Regalia, “System theoretic properties in the stability analysis of QR-based fast least squares algorithms,” IEEE Trans. Signal Processing, to be published.
28. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins Press, 1983.
29. 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. 5, pp. 716–733, 1987.
30. J. Götze and U. Schwiegelshohn, “An orthogonal method for solving systems of linear equations without square roots and with few divisions,” in Proc. IEEE ICASSP, 1989, pp. 1298–1301.
31. J. E. Voider, “The CORDIC trigonometric computing technique,” IRE Trans. Electron. Comput., vol. 8, pp. 330–334, 1959.
32. J. S. Walther, “An unified algorithm for elementary functions,” in Spring Joint Comput. Conf., 1971, pp. 379–385.
33. H. M. Ahmed, J. M. Delosme, and M. Morf, “Highly concurrent computing structures for matrix arithmetic and signal processing,” IEEE Comput., vol. 15, no. 1, pp. 65–82, 1982.
34. J. G. M. T. J. Shepherd and J. E. Hudson, “Parallel weight extraction from a systolic adaptive beamformer,” in Proc. IMA Conf. Math. Signal Processing, 1988.
35. D. W. Lin, “On digital implementation of the fast Kalman algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 32, no. 10, pp. 998–1005, 1984.
36. J. L. Botto and G. V. Moustakides, “Stabilizing the fast Kalman algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, no. 9, pp. 1342–1348, 1989.
37. S. Ljung and L. Ljung, “Error propagation properties of recursive least-squares adaption algorithms,” Automatica, vol. 21, no. 2, pp. 157–167, 1985.
38. D. M. F. Ling and J. G. Proakis, “Numerically robust least squares lattice-ladder algorithms with direct updating of the reflection coefficients,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 34, pp. 837–845, 1986.
39. L. J. Griffiths, “A simple adaptive algorithm for real-time processing in antenna arrays,” Proc. IEEE, vol. 57, pp. 1696–1704, 1969.
40. R. A. Monzingo and T. W. Miller, Introduction to Adaptive Arrays. New York: Wiley, 1980.
41. P. S. Lewis, “RLS adaptive filtering without a desired signal: QR applications and architectures,” in Proc. IEEE Asilomar Conf. Signals, Syst., Comput., Oct. 1988.
42. L. J. Griffiths, “Linearly constrained adaptive signal processing methods,” Proc. SPIE Int. Soc. Opt. Eng., pp. 96–100, Apr. 1987.
43. B. Yang and J. F. Böhme, “A new orthogonal adaptive algorithm and its systolic implementation for the RLS problem without a desired signal,” in Proc. EUSIPCO, Sept. 1990, pp. 677–680.