Stochastic mean-square performance analysis of an adaptive Hammerstein filter

This paper presents an almost sure mean-square performance analysis of an adaptive Hammerstein filter for the case when the measurement noise in the desired response signal is a martingale difference sequence. The system model consists of a series connection of a memoryless nonlinearity followed by a recursive linear filter. A bound for the long-term time average of the squared a posteriori estimation error of the adaptive filter is derived using a basic set of assumptions on the operating environment. This bound consists of two terms, one of which is proportional to a parameter that depends on the step size sequences of the algorithm and the other that is inversely proportional to the maximum value of the increment process associated with the coefficients of the underlying system. One consequence of this result is that the long-term time average of the squared a posteriori estimation error can be made arbitrarily close to its minimum possible value when the underlying system is time-invariant.