Fast, Recursive-Least-Squares Transversal Filters for Adaptive Filtering

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 32, Issue 2, 1984, Pages 304-337

  Cioffi, John M ^a   Kailath, Thomas ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC FILTERS, DIGITAL;

ADAPTIVE FILTERING; TRANSVERSAL FILTERS;

SIGNAL FILTERING AND PREDICTION;

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

References (79)

1. M. Morf T. Kailath, and L. Ljung, “Fast algorithms for recursive identification,” in Proc. 1976. Conf Decision Contr., Clearwater Beach, FL, Dec. 1976, pp. 916–921.
2. L. Ljung, M. Morf, and D. Falconer, “Fast calculation of gain matrices for recursive estimation schemes,” Int. J. Contr., vol. 27, pp. 1–19, Jan. 1978.
3. D. D. Falconer and L. Ljung, “Application of fast-Kalman estimation to adaptive equalization,” IEEE Trans. Commun., vol. COMM-26, pp. 1439–1446, Oct. 1978.
4. M. Morf, “Fast algorithms for multivariable systems,” Ph.D. dissertation, Dep. Elec. Eng. Stanford Univ., Stanford, CA, 1974.
5. M. Morf, A. Vieira, and D. T. Lee, “Ladder forms for identification and speech processing,” in Proc. 1977 IEEE Conf. Decision Contr., New Orleans, LA, Dec. 1977, pp. 1074–1078.
6. M. Morf and D. T. Lee, “Recursive least-squares ladder forms for fast parameter tracking,” Proc. 1979 Conf Decision Contr., San Diego, CA, pp. 1362–1367.
7. D.T.L. Lee, M. Morf, and B. Friedlander, “Recursive least-squares ladder estimation algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, Joint Special Issue on Adaptive Signal Processing, vol. ASSP-29, pp. 627–641, June 1981.
8. B. Widrow, “Adaptive filters,” Aspects of Network and System Theory, R. E. Kalman and N. De Claris, Eds. New York: Holt, Rinehart, and Winston, 1970, pp. 563-58.
9. B. Widrow and M. E. Hoff Jr., “Adaptive switching circuits,” in I960 Wescon Conv. Rec., IRE, Part 4, pp. 96–104.
10. J. D. Market and A. H. Gray Jr., Linear Prediction of Speech. New York: Springer-Verlag, 1976.
11. B. Porat, B. Friedlander, and M. Morf, “Square-root covariance ladder algorithms,” IEEE Trans. Automat. Contr., vol. AC-27, pp. 813–829, Aug. 1982.
12. B. Porat and T. Kailath, “Normalized lattice algorithms for leastsquares FIR system identification,”IEEE Trans. Acpust., Speech, Signal Processing, vol. ASSP-31, pp. 122–128, Feb. 1983.
13. B. Porat, “Contributions to the theory and applications of lattice filters,” Ph.D: dissertation, Dep. Elec. Eng., Stanford Univ., Stanford, CA, Aug. 1982.
14. P. Eykhoff, System Parameter and State Estimation. London: Wiley, 1974.
15. G. C. Goodwin and R. L. Payne, Dynamic System Identification, Experimental Design and Data Analysis. New York: Academic, 1977.
16. L. Ljung and T. Soderstrom, Theory and Practice of Recursive Identification. Cambridge, MA: MIT Press, 1983.
17. R. D. Gitlin, private communication.
18. N. Levinson, “The Wiener RMS (root-mean-square) error criterion in filter design and prediction,” J. Math. Phys., vol. 25, 261–278, 1947.
19. D. W. Ein, “On digital implementation of the fast Kalman algo- rithm,” IEEE Trans. Acoust., Speech, Signal Processing, in review.
20. M. S. Mueller, “Least-squares algorithms for adaptive equalizers,” Bell Syst. Tech. J., vol. 60, pp. 1905-1926, Oct. 1981.
21. R. A. Monzingo and T. W. Miller, Introduction to Adaptive Arrays. New York: Wiley, 1980.
22. B. Widrow and J. M. McCool, “A comparison of adaptive algorithms based on the methods of steepest descent and random search,” IEEE Trans. Antennas Propagat, vol. AP-24, pp. 615–637, Sept. 1976.
23. L. L. Horowitz and K. D. Senne, “Performance advantage of complex LMS for controlling narrow-band adaptive arrays,” IEEE Trans. Acoust., Speech, Signal Processing, Joint Issue on Adaptive Signal Processing, vol. ASSP-29, pp. 722–735, June 1981.
24. B. Widrow, J. McCool, and B. Medoff, “Adaptive control by inverse modelling,” in Proc. 13th Ann. Asilomar Conf Circuits, Syst., Comput., Oct. 1979.
25. S. Qureshi, “Adaptive equalization,” IEEE Commun. Mag., vol. 1982.
26. R. D. Gitlin and S. B. Weinstein, “Fractionally spaced equalizer: An improved digital transversal equalizer,” Bell Syst. Tech. J., vol. 60, 275–296, Feb. 1981.
27. L. J. Griffiths, “A continuously adaptive filter implemented as a lattice structure,” in Proc. IEEE Int. Conf, Acoust., Speech, Signal Processing, Hartford, CT, May 1977, pp. 683–686.
28. L. J. Griffiths, “An adaptive lattice structure for noise-cancelling applications,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Tulsa, OK, Apr. 1978, pp. 87–90.
29. L. J. Griffiths, “Adaptive structures for multiple-input noise-cancelling applications,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Apr. 1979, pp. 925–928.
30. S. Marple, “Efficient least-squares FIR system identification,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, pp. 62–73, Feb. 1981.
31. 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.
32. B. Friedlander, “Lattice filters for adaptive processing,” Proc. IEEE, vol. 70, pp. 829–867, Aug. 1982.
33. R. S. Medaugh and L. J. Griffiths, “A comparison of two fast linear predictors,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Atlanta, GA, Apr. 1981, pp. 293–296.
34. R. S. Medaugh and L. J. Griffiths, “Further results of a least-squares and gradient-adaptive-lattice algorithm comparison,” in Proc. 1982 Int. Conf. Acoust., Speech, Signal Processing, Paris, 1982, pp. 1412–1415.
35. J. M. Cioffi and T. Kailath, “Windowing methods and their efficient transversal-filter implementation for the RLS adaptive-filtering algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, submitted for publication.
36. J. M. Cioffi, “Fast, transversal filters for communications applications,” Ph.D. dissertation, Stanford Univ., Stanford, CA, Mar. 1984.
37. P. E. Mantey and L. J. Griffiths, “Iterative least-squares algorithm for signal extraction,” in Proc. Second Hawaii Int. Conf. Syst. Sci., Western Periodicals, 1969, pp. 767–770.
38. K. J. Astrom and P. Eykhoff, “System identification-A survey,” Automatica, vol. 7, 123–162, 1971.
39. D. Godard, “Channel equalization using a Kalman filter for fast data transmission,” IBM J. Res. Develop., pp. 267–273, May 1974.
40. M. S. Mueller, “On the rapid initial convergence of least-squares equalizer adjustment algorithms,” Bell Syst. Tech. J., vol. 60, pp. 2345–2358, Dec. 1981.
41. T. L. Lim and M. S. Mueller, “Rapid equalizer start-up using least-squares algorithms,” in Conf. Rec. Int. Conf Commun. 1980, Seattle, WA, June 1980, paper no. 57.7.
42. L. Ljung, “Analysis of recursive stochastic algorithms,” IEEE Trans. Automat. Contr., vol. AC-22, pp. 551–575, 1977.
43. J. E. Mazo, “On the independence theorem in equalizer convergence,” Bell Syst. Tech. J., vol. 58, pp. 963–993, May-June 1979.
44. T. Kailath, “Time-variant and time-invariant lattice filters for nonstationary processes,” in Proc. Fast Algorithms for Linear Dynamical Syst., Aussois, France, Sept. 21–25, 1981, pp. 417–464.
45. C. S. Sidllu and T. Kailath. “A shift-invariance approach to Chandrasekhar, Choleskky and Levinson-typc algorithms,” in Proc. 1975 Johns Hopkins Con Inform. Sci. Syst., Baltimore, MD, PP. 324-327
46. C. L. Lawson and R. J. Hanson, Solving Least-Squares Problems. Englewood Cliffs, NJ: Prentice-Hall, 1974.
47. D. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
48. C. Samson, “A unified treatment of fast Kalman algorithms for identification,” Int. J. Contr., vol. 35, pp. 909-934, May 1982.
49. A. Nehorai and M. Morf, “A unified derivation for fist estimation by the conjugate direction method,” submitted for publication.
50. D. T. L. Lee, “Canonical ladder form realizations and fast estimation algorithms,” Ph.D. dissertation, Dep. Eke. Eng., Stanford Univ., Stanford, CA, May 1981.
51. G. W. Stewart, Introduction to Matrix Computation. New York: Academic, 1973.
52. J. M. Cioffi and J. J. Werner, “The effect of biases on digitally implemented data-driven echo cancellers,” Bell Syst. Tech. J., to appear.
53. J. J. Werner, “An inband data-driven echo canceller for 4800 bps full-duplex data transmission,” Bell Syst. Tech. J., to appcar.
54. V. U. Reddy, T. J. Shan, and T. Kailath, “Application of modified least-squares algorithms to adaptive echo cancellation,” in h o c. 1983 Int. Conf Acoust., Speech, Signal Processing, Boston, MA, paper no. 1.14, pp. 53-56.
55. G. J. Bierman, Factorization Methods. for Discrete Sequential Estimation. New York: Academic, 1977.
56. H. Katzan, Fortran 77. New York: Van Nostrand Reinhold, 1978.
57. S. I. Feldman and P. J. Weinberger, “A portableortran 77 compiler,” Bell Telephone Laboratories Tech. Mem. Aug. 1, 1978.
58. B. Widrow and E. Walach, “On the efficiency of adaptive algorithms with nonstationary inputs,” IEEE Trans. Inform. Theory, Special lssue on Adaptive Filtering, vol. 30, Mar. 1984
59. R. G. Bartle, The Elements of Real Analysis, 2nd ed. New York: Wiley, 1976
60. T. Kato, Perturbation Tkeory for Linear Operators. Heidelberg, Germany, Springer-Verlag, 1976.
61. R. D. Gitlin and M. Honig, private communication.
62. G. Carayannis, D. Manolakis, and N. Kalouptsidis, “1:ast Kalman type algorithms for sequential signal processing,” in Proc. 1983 Int. Con Acoust., Speech, Signal Processing, Boston, MA, paper no. 4.10, pp. 186-189.
63. G. Carayannis, D. Manolakis, and N. Kalouptsidis, “A fast sequential algorithm for least squares filtering and prediction,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-3 1, Dec. 1983
64. H. M. Ahmed. J. M. Delosme, and M. Morf. “Highly concurrent computing structures for matrix arithmetic ansdig nal processing,” Comput. Mag.;Jan. 1982> pp. 65-82.
65. J. M. Cioffi and T. Kailath, “An efficient, exact-least-squares, fractionally spaced equalizer using intersymbol interpolation,” IEEE Trans. Commun., Special Issue on Voiceband Data Transmission, July 1984.
66. R. D. Citlin, H. C. Meadors, and S. B. Weinstein, “The tapleakage algorithm: An algorithm for the stable operation of a digitally implemented, fractionally spaced adaptive equalizcr,” BellSyst. Tech. J.,vol. 61,pp. 1817-1839, Oct. 1982
67. M. L. Honig and D. G. Messerschmitt, “Convergence propertics of an adaptive digital lattice filter,” IEEE Truns. Acoust., Speech, Signal Processing, Special Issue on Adaptive Signal Processing, vol. ASSP-29, part 111, pp. 642-653, June 1981.
68. M. L. Honig, “Convcrgencc models for lattice joint process cstimators and least squares algorithms,” IEb’E Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 415-425, Apr. 1983.
69. S. Ljung, “Fast algorithms for integral equations and least-squares identification problems,” Ph.D. dissertation, Linkoping Univ., Sweden, 1983.
70. C. Halkias, G. Carayannis, J. Dologlou, and D. lmmanolopoulos, “A new generalized recursion for the fast computation of the Kalman gain to solvc the covariance equations,” in Proc. ICASSP ’82, Paris, May 1982, pp. 1760-1763.
71. J. D. Markel and A. 13. Gray Jr., “Roundoffnoise characteristics of a class of orthogonal polynomial structures,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-23, pp. 486-494, 1975.
72. O. Macchi and E. Eweda, “Second-order convergence analysis of stochastic adaptive linear filtering,” ZEEE Trans. Automaf. Confr., vol. AC-28, pp. 76-85, Jan. 1983.
73. O. Macchi and E. Eweda “Convergence of an adaptive linear estimation algorithm,” IEEE Tkans. Aufomaf. Conv, vol. AC-28, Oct. 1983.
74. V. B. Lawrence and S. K. Tewksbury, “Multiprocessor implementation of adaptive digital filters,” IEEE Trans. Commun., vol. COM-31, pp. 826–835, July 1983.
75. D. E. Childers, Ed., Modern Spectral Analysis. New York: IEEE Press, 1978.
76. J. G. Proakis, Digital Communications. New York: McGraw-Hill, 1983.
77. J. M. Cioffi and T. Kailath, “Fast, fixed-order, RLS algorithms for adaptive filtering,” in Proc. ICASSP’83, Boston, MA, 1983, 15A.5.
78. H. Lev-Ari and T. Kailath, “Lattice filter parametrization and modeling of nonstationary processes,” IEEE Trans. Inform. Theory, vol. 30, 2–15, Jan. 1984.
79. H. Lev-Ari, T. Kailath, and J. M. Cioffi, “Least-squares lattice and transversal filters: A unified geometric theory,” vol. 30, Mar. 1984.