BEACON: an adaptive set-membership filtering technique with sparse updates

This paper deals with adaptive solutions to the so-called set-membership filtering (SMF) problem. The SMF methodology involves designing filters by imposing a deterministic constraint on the output error sequence. A set-membership decision feedback equalizer (SM-DFE) for equalization of a communications channel is derived, and connections with the minimum mean square error (MMSE) DFE are established. Further, an adaptive solution to the general SMF problem via a novel optimal bounding ellipsoid (OBE) algorithm called BEACON is presented. This algorithm features sparse updating, wherein it uses about 5-10% of the data to update the parameter estimates without any loss in mean-squared error performance, in comparison with the conventional recursive least-squares (RLS) algorithm. It is shown that the BEACON algorithm can also be derived as a solution to a certain constrained least-squares problem. Simulation results are presented for various adaptive signal processing examples, including estimation of a real communication channel. Further, it is shown that the algorithm can accurately track fast time variations in a nonstationary environment. This improvement is a result of incorporating an explicit test to check if an update is needed at every time instant as well as an optimal data-dependent assignment to the updating weights whenever an update is required.

[1]  J. R. Deller,et al.  Unifying the landmark developments in optimal bounding ellipsoid identification , 1994 .

[2]  S. Thomas Alexander,et al.  Adaptive Signal Processing , 1986, Texts and Monographs in Computer Science.

[3]  Yih-Fang Huang,et al.  Bounded Error Estimation: Set-Theoretic and Least-Squares Formulations , 1997 .

[4]  E. Walter,et al.  Estimation of parameter bounds from bounded-error data: a survey , 1990 .

[5]  R.A. Casas,et al.  On fractionally-spaced equalizer design for digital microwave radio channels , 1995, Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers.

[6]  Shirish Nagaraj,et al.  Set-membership filtering and a set-membership normalized LMS algorithm with an adaptive step size , 1998, IEEE Signal Processing Letters.

[7]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[8]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[9]  Er-Wei Bai,et al.  Bounded-error parameter estimation: Noise models and recursive algorithms , 1996, Autom..

[10]  S. Kapoor,et al.  Set-Membership State Estimation with Optimal Bounding Ellipsoids , 1996 .

[11]  S. Kapoor,et al.  Tracking of Time-Varying Parameters using Optimal Bounding Ellipsoid Algorithms , 1996 .

[12]  Yih-Fang Huang,et al.  Tracking characteristics of an OBE parameter-estimation algorithm , 1993, IEEE Trans. Signal Process..

[13]  Yih-Fang Huang,et al.  Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor , 1985, 1985 24th IEEE Conference on Decision and Control.

[14]  J. Norton,et al.  State bounding with ellipsoidal set description of the uncertainty , 1996 .

[15]  Y. F. Huang,et al.  On the value of information in system identification - Bounded noise case , 1982, Autom..

[16]  J. R. Deller,et al.  Least-square identification with error bounds for real-time signal processing and control , 1993, Proc. IEEE.

[17]  Graham C. Goodwin,et al.  Adaptive filtering prediction and control , 1984 .

[18]  John M. Cioffi,et al.  MMSE decision-feedback equalizers: finite-length results , 1995, IEEE Trans. Inf. Theory.

[19]  Yih-Fang Huang,et al.  Set-membership adaptive equalization and an updator-shared implementation for multiple channel communications systems , 1998, IEEE Trans. Signal Process..

[20]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .