Header
Home | Sitemap Set as homepage | Add to favorites
  Search the Site     » Advanced Search
Sections



Adaptive Nonlinear Predictor

by

image

Adaptive Nonlinear Predictor

It is seen that in the ACM filter, the predicted value of the state is obtained as a linear function of the previous estimate modified by a nonlinear function of the prediction error. We now use the same approach to modify the adaptive linear predictive filter described in Section 7.2.2. This technique was first developed in [387, 522]. To show the influence of the prediction error explicitly, using (7.34) we rewrite (7.25) as

Equation 7.50

graphics/07equ050.gif


We make the assumption, similar to that made in the derivation of the ACM filter, that the prediction residual n is the sum of a Gaussian random variable and a binary random variable. If the variance of the Gaussian random variable is graphics/401equ01.gif, the nonlinear transformation appearing in the ACM filter can be written as

Equation 7.51

graphics/07equ051.gif


By transforming the prediction error in (7.50) using the nonlinearity above, we get a nonlinear transversal filter for the prediction of rn, namely,

Equation 7.52

graphics/07equ052.gif


where graphics/401equ03.gif is given by

Equation 7.53

graphics/07equ053.gif


The structure of this filter is shown in Fig. 7.6. To implement the filter of (7.52), an estimate of the parameter graphics/401equ02.gif and an algorithm for updating the tap weights must be obtained. A useful estimate for graphics/401equ02.gif is graphics/401equ04.gif, where Dn is a sample estimate of the prediction error variance [e.g., graphics/402equ01.gif]. On the other hand, the tap-weight vector can be updated according to the modified LMS algorithm

Figure 7.6. Tapped-delay-line nonlinear predictor.

graphics/07fig06.gif

Equation 7.54

graphics/07equ054.gif


where graphics/402equ02.gif and pn is given by (7.28). Note that the nonlinear prediction given by (7.52) is recursive in the sense that the prediction depends explicitly on the previous predicted values as well as on the previous input to the filter. This is in contrast to the linear prediction of (7.25), which depends explicitly only on the previous inputs to the filter, although it depends on the previous outputs implicitly through their influence on the tap-weight updates. The nonlinear prediction-based NBI suppression algorithm is summarized as follows.

Algorithm 7.4: [LMS nonlinear prediction-based NBI suppression] At time i, N received samples {riN, riN+1, ..., riN+N-1} are obtained at the chip-matched filter output (7.5).

It is interesting to note that the predictor (7.52) can be viewed as a generalization of both linear and hard-decision-feedback (see, e.g., [107, 108, 254]) adaptive predictors, in which we use our knowledge of the prediction error statistics to make a soft decision about the binary signal, which is then fed back to the predictor. As noted above, introduction of this nonlinearity improves the prediction performance over the linear version. As discussed in [387], softening of this feedback nonlinearity improves the convergence properties of the adaptation over the use of hard-decision feedback.

Simulation Examples

To assess the nonlinear adaptive NBI suppression algorithm above, simulations were performed on the AR model for interference given in Section 7.2. The results are shown in Fig. 7.7. It is seen that, as in the case where the interference statistics are known, the nonlinear adaptive NBI suppression method significantly outperforms its linear counterpart.

Figure 7.7. Performance of adaptive linear predictor– and adaptive nonlinear predictor–based NBI suppression methods.

162 times read

Related news

» Basis-of-Voice-Coding
by admin posted on Oct 24,2006
» Domain-Independent Algorithms
by admin posted on Oct 24,2006
» Domain-Specific Heuristics
by admin posted on Oct 24,2006
» Preliminaries
by admin posted on Oct 24,2006


More Top News
Cisco Wireless Networking
Most Popular
Featured Author