Set Membership Identification in Digital Signal Processing

IEEE ASSP Magazine

Volumn 6, Issue 4, 1989, Pages 4-20

  Deller, John R ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--LEAST SQUARES APPROXIMATIONS; SIGNAL FILTERING AND PREDICTION; SPEECH--ANALYSIS;

LINEAR PARAMETRIC MODELS; PARAMETER ESTIMATION; SET MEMBERSHIP IDENTIFICATION; SET THEORY; SYSTOLIC ARRAY PROCESSOR;

SIGNAL PROCESSING;

EID: 0024750676     PISSN: 07407467     EISSN: None     Source Type: Journal    
DOI: 10.1109/53.41661     Document Type: Article

References (42)

1. H. S. Witsenhausen, “Sets of possible states of linear systems given perturbed observations,” IEEE Trans. Automatic Control, vol. AC-13, pp. 556–568, 1968.
2. F. C. Schweppe, “Recursive state estimation: Unknown but bounded errors and system inputs,” IEEE Trans. Automatic Control, vol. AC-13, pp. 22–28, 1968.
3. D. P. Bertsekas and I. B. Rhodes, “Recursive state estimation for a set-membership description of uncertainty,” IEEE Trans. Automatic Control, vol. AC-16, pp. 117–128, 1971.
4. E. Fogel, “System identification via membership set constraints with energy constrained noise,” IEEE Trans. Automatic Control, vol. AC-24, pp. 752–758,1979.
5. B. R. Barmish and J. Sankaran, “The propagation of parametric uncertainty via polytopes,” IEEE Trans. Automatic Control, vol. AC-24, pp. 346–349, 1979.
6. Y. F. Huang, “System identification using membership set description of system uncertainties,” Master's Thesis, University of Notre Dame, 1979.
7. E. Fogel and Y. F. Huang, “On the value of information in system identification — Bounded noise case,” Automatica, vol. 18, pp. 229–238, 1982.
8. M. Milanese and G. Belaforte, “Estimation theory and uncertainty intervals evaluation in the presence of unknown but bounded errors: Linear families of models and estimators,” IEEE Trans. Automatic Control, vol. AC-27, pp. 408–414, 1982.
9. V. Broman and R.J. Shensa, “Polytopes, a novel approach to tracking,” Proc. 25th IEEE Conf. Decision and Control, Athens, 1986, pp. 1749–1752.
10. J. P. Norton, “Identification of parameter bounds of ARMAX models from records with bounded noise,” Int. I. Control, vol. 42, pp. 375–390, 1987.
11. J. P. Norton, “Identification and application of bounded parameter models,” Automatica, vol. 23, pp. 497– 507, 1987.
12. R. Tempo, “Robust estimation and filtering in the presence of bounded noise,” IEEE Trans. Automatic Control, vol. AC-33, pp. 864–867, 1988.
13. E. Walter and H. Piet-Lahanier, “Estimation of parameter bounds from bounded-error data: A survey,” Proc. 12th IMACS World Congress on Scientific Computation, Paris, 1988, pp. 467–472.
14. E. Walter and H. Piet-Lahanier, “OMNE vs. least squares for estimating parameters of a biological model from short data records,” Proc. 12th IMACS World Congress on Scientific Computation, Paris, 1988, pp. 85–87.
15. H. Piet-Lahanier and E. Walter, “Practical implementation of an exact and recursive algorithm of characterizing likelihood sets,” Proc. 12th IMACS World Congress on Scientific Computation, Paris, July 1988.
16. E. Walter and H. Piet-Lahanier, “Exact and recursive description of the feasible parameter set for bounded error models,” Proc. 26th IEEE of Conf. Decision and Control, Los Angeles, 1987, pp. 1921–1922.
17. Y. F. Huang, “A recursive estimation algorithm using selective updating for spectral analysis and adaptive signal processing,” IEEE Trans. Acoust., Speech, and Signal Processing, vol. ASSP-34, pp. 1331-1334,1986.
18. M.L. Feron, “‘Membership-set’ identification with pulse train input,” Master's Thesis, Illinois Institute of Technology, 1983.
19. M.L. Feron and J. R. Deller, Jr., “‘Membership set’ identification applied to the impulse train excited AR model” (abstract), Final Program: SI AM 1983 National Mtg., Denver, 1983, p. 30.
20. Y. F. Huang and A. K. Rao, “Application of a recursive estimation algorithm with information dependent updating to ARMAX models and ARMA models with unknown inputs,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Process '87, Dallas, vol. 2, pp. 1007–1010, 1987.
21. S. Dasgupta and Y. F. Huang, “Asymptotically convergent modified recursive least squares with data dependent updating and forgetting factor for systems with bounded noise,” IEEE Trans. Information Theory, vol. IT-33, pp. 383–392, 1987.
22. J.R. Deller, Jr. and T.C. Luk, “Set-membership theory applied to linear prediction analysis of speech,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Process '87, Dallas, vol. 2, pp. 653–656, 1987.
23. A. K. Rao and Y. F. Huang, “Statistical properties of a novel recursive estimation algorithm with information-dependent updating,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Process '88, New York, vol. 4, pp. 2436–2439, 1988.
24. P. L. Combettes and H.J. Trussell, “Stability of the linear prediction filter: A set theoretic approach,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Process '88, New York, vol. 4, pp. 2288–2291, 1988.
25. J. R. Deller, Jr., “A ‘systolic array’ formulation of the optimal bounding ellipsoid algorithm,” IEEE Trans. Acoust., Speech, and Signal Process., to appear Sept. 1989.
26. J. R. Deller, Jr. and T. C. Luk, “Linear prediction analysis of speech based on set membership theory,” Computer Speech and Language (in press).
27. A. K. Rao and Y. F. Huang, “Analysis of finite precision effects on an OBE algorithm,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Process '89, Glasgow, vol. 2, pp. 853–856, May 1989.
28. J.R. Deller, Jr. and S. F. Odeh, “Implementing the optimal bounding ellipsoid algorithm on a fast processor,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Process '89, Glasgow, vol. 2, pp. 1067–1070, May 1989.
29. P. L. Combettes and H.J. Trussell, “General order moments in set-theoretic estimation,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Process '89, Glasgow, vol. 4, pp. 2101–2104, 1989.
30. L. Ljung and T. Söderström, Theory and Practice of Recursive Identification, Cambridge, MA: MIT Press, 1983, pp. 14–15 & Sect. 2.2.1.
31. G. H. Golub and C. F. Van Loan, Matrix Computations, Baltimore, MD: Johns Hopkins University Press, 1983, Ch. 6.
32. J. Makhoul, “Linear prediction: A tutorial review,” Proc. of the IEEE, vol. 63, pp. 561–580, 1975.
33. D. Graupe, Identification of Systems, Huntington, NY, Krieger, 1976, Ch. 6.
34. W. Kahan, “Circumscribing an ellipsoid about an intersection of two ellipsoids,” Canadian Math. Bull., vol. 3, pp. 437–441, 1968.
35. W. M. Gentleman and H.T. Kung, “Matrix triangularization by systolic arrays,” Proc. Soc. Photooptical Engineer.: Real Time Signal Processing IV, vol. 298, pp. 19–26, 1981.
36. J.G. McWhirter, “Recursive least squares minimization using a systolic array,” Proc. Soc. Photooptical Engineer.: Real Time Signal Processing IV, vol. 431, pp. 105–112, 1983.
37. T.C. Luk and J.R. Deller, Jr., “A nonclassical WRLS algorithm,” Proc. 23rd Ann. Allerton Conf., 1985, pp. 732–741.
38. J. R. Deller, Jr. and G. P. Picaché, “Advantages of a Givens rotation approach to temporally recursive linear prediction analysis of speech,” IEEE Trans. Acoust., Speech, and Signal Process., vol. 37, pp. 429–431, March 1989.
39. J.R. Deller, Jr. and D. Hsu, “An alternative adaptive sequential regression algorithm and its application to the recognition of cerebral palsy speech,” IEEE Trans. Circ. and Syst., vol. CAS-34, pp. 782–787, July 1987.
40. J. R. Deller, Jr. and S. F. Odeh, “Algorithms and architectures for adaptive set-membership based signal processing” (in preparation).
41. H.T. Kung and C. Leiserson, “Algorithms for VLSl processor arrays,” Rpt. No. CMU-CS-79-103, Dept. of Computer Sci., Carnegie-Mellon Univ., 1978. Reprinted in C. Mead and L. Conway, Introduction to VLSI Systems, Reading, MA, Addison-Wesley, 1980, Section 8.3.
42. H.T. Kung, “Why systolic architectures?” IEEE Computer Magazine, vol. 15, pp. 37–46, Jan. 1982.