Adaptive filter

<h2 id="example-application">Example application</h2>
The recording of a heart beat (an <a href="/facts/ECG/YpVswJ0W">ECG</a>), may be corrupted by noise from the <a href="/facts/Power_supply/4A8zBRHn">AC mains</a>. The exact frequency of the power and its <a href="/facts/Harmonics/9U9REzeR">harmonics</a> may vary from moment to moment.
One way to remove the noise is to filter the signal with a <a href="/facts/Notch_filter/p0y8uUfS">notch filter</a> at the mains frequency and its vicinity, but this could excessively degrade the quality of the ECG since the heart beat would also likely have frequency components in the rejected range.
To circumvent this potential loss of information, an adaptive filter could be used. The adaptive filter would take input both from the patient and from the mains and would thus be able to track the actual frequency of the noise as it fluctuates and subtract the noise from the recording. Such an adaptive technique generally allows for a filter with a smaller rejection range, which means, in this case, that the quality of the output signal is more accurate for medical purposes.<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a><a class="footnote-ref" id="fnref:2" href="#fn:2">2</a>

<h2 id="block-diagram">Block diagram</h2>
The idea behind a closed loop adaptive filter is that a variable filter is adjusted until the error (the difference between the filter output and the desired signal) is minimized. The <a href="/facts/Least_mean_squares_filter/1L0XBsyT">Least Mean Squares (LMS) filter</a> and the <a href="/facts/Recursive_least_squares_filter/K3y6q7db">Recursive Least Squares (RLS) filter</a> are types of adaptive filter.

There are two input signals to the adaptive filter: 
 
 
 
 
 d
 
 k
 
 
 
 
 {\displaystyle d_{k}}
 
 and 
 
 
 
 
 x
 
 k
 
 
 
 
 {\displaystyle x_{k}}
 
 which are sometimes called the primary input and the reference input respectively.<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a> The adaptation algorithm attempts to filter the reference input into a replica of the desired input by minimizing the residual signal, 
 
 
 
 
 ϵ
 
 k
 
 
 
 
 {\displaystyle \epsilon _{k}}
 
. When the adaptation is successful, the output of the filter 
 
 
 
 
 y
 
 k
 
 
 
 
 {\displaystyle y_{k}}
 
 is effectively an estimate of the desired signal.

d
          
            k
          
        
      
    
    {\displaystyle d_{k}}
  
 which includes the desired signal plus undesired interference and

x
 
 k
 
 
 
 
 {\displaystyle x_{k}}
 
 which includes the signals that are correlated to some of the undesired interference in 
 
 
 
 
 d
 
 k
 
 
 
 
 {\displaystyle d_{k}}
 
.
k represents the discrete sample number.
The filter is controlled by a set of L+1 coefficients or weights.

W
          
          
            k
          
        
        =
        
          
            [
            
              
                w
                
                  0
                  k
                
              
              ,
              
              
                w
                
                  1
                  k
                
              
              ,
              
              .
              .
              .
              ,
              
              
                w
                
                  L
                  k
                
              
            
            ]
          
          
            T
          
        
      
    
    {\displaystyle \mathbf {W} _{k}=\left[w_{0k},\,w_{1k},\,...,\,w_{Lk}\right]^{T}}
  
 represents the set or vector of weights, which control the filter at sample time k.
where 
  
    
      
        
          w
          
            l
            k
          
        
      
    
    {\displaystyle w_{lk}}
  
 refers to the 
  
    
      
        l
      
    
    {\displaystyle l}
  
'th weight at k'th time.

Δ
 W
 
 
 k
 
 
 
 
 {\displaystyle \mathbf {\Delta W} _{k}}
 
 represents the change in the weights that occurs as a result of adjustments computed at sample time k.
These changes will be applied after sample time k and before they are used at sample time k+1.
The output is usually 
 
 
 
 
 ϵ
 
 k
 
 
 
 
 {\displaystyle \epsilon _{k}}
 
 but it could be 
 
 
 
 
 y
 
 k
 
 
 
 
 {\displaystyle y_{k}}
 
 or it could even be the filter coefficients.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a>(Widrow)
The input signals are defined as follows:

d
          
            k
          
        
        =
        
          g
          
            k
          
        
        +
        
          u
          
            k
          
        
        +
        
          v
          
            k
          
        
      
    
    {\displaystyle d_{k}=g_{k}+u_{k}+v_{k}}

x
          
            k
          
        
        =
        
          g
          
            k
          
          
            
              
              ′
            
          
        
        +
        
          u
          
            k
          
          
            
              
              ′
            
          
        
        +
        
          v
          
            k
          
          
            
              
              ′
            
          
        
      
    
    {\displaystyle x_{k}=g_{k}^{'}+u_{k}^{'}+v_{k}^{'}}

where:
g = the desired signal,
g' = a signal that is correlated with the desired signal g ,
u = an undesired signal that is added to g , but not correlated with g or g'
u' = a signal that is correlated with the undesired signal u, but not correlated with g or g',
v = an undesired signal (typically random noise) not correlated with g, g', u, u' or v',
v' = an undesired signal (typically random noise) not correlated with g, g', u, u' or v.
The output signals are defined as follows:

y
          
            k
          
        
        =
        
          
            
              
                g
                ^
              
            
          
          
            k
          
        
        +
        
          
            
              
                u
                ^
              
            
          
          
            k
          
        
        +
        
          
            
              
                v
                ^
              
            
          
          
            k
          
        
      
    
    {\displaystyle y_{k}={\hat {g}}_{k}+{\hat {u}}_{k}+{\hat {v}}_{k}}

ϵ
          
            k
          
        
        =
        
          d
          
            k
          
        
        −
        
          y
          
            k
          
        
      
    
    {\displaystyle \epsilon _{k}=d_{k}-y_{k}}
  
.
where:

g
 ^
 
 
 
 
 
 {\displaystyle {\hat {g}}}
 
 = the output of the filter if the input was only g',

u
 ^
 
 
 
 
 
 {\displaystyle {\hat {u}}}
 
 = the output of the filter if the input was only u',

v
 ^
 
 
 
 
 
 {\displaystyle {\hat {v}}}
 
 = the output of the filter if the input was only v'.
<h3>Tapped delay line FIR filter</h3>
If the variable filter has a tapped delay line <a href="/facts/Finite_impulse_response/5u4Gaqcb">Finite Impulse Response (FIR)</a> structure, then the impulse response is equal to the filter coefficients. The output of the filter is given by

y
          
            k
          
        
        =
        
          ∑
          
            l
            =
            0
          
          
            L
          
        
        
          w
          
            l
            k
          
        
         
        
          x
          
            (
            k
            −
            l
            )
          
        
        =
        
          
            
              
                g
                ^
              
            
          
          
            k
          
        
        +
        
          
            
              
                u
                ^
              
            
          
          
            k
          
        
        +
        
          
            
              
                v
                ^
              
            
          
          
            k
          
        
      
    
    {\displaystyle y_{k}=\sum _{l=0}^{L}w_{lk}\ x_{(k-l)}={\hat {g}}_{k}+{\hat {u}}_{k}+{\hat {v}}_{k}}

where 
 
 
 
 
 w
 
 l
 k
 
 
 
 
 {\displaystyle w_{lk}}
 
 refers to the 
 
 
 
 l
 
 
 {\displaystyle l}
 
'th weight at k'th time.
<h3>Ideal case</h3>
In the ideal case 
 
 
 
 v
 ≡
 0
 ,
 
 v
 ′
 
 ≡
 0
 ,
 
 g
 ′
 
 ≡
 0
 
 
 {\displaystyle v\equiv 0,v'\equiv 0,g'\equiv 0}
 
. All the undesired signals in 
 
 
 
 
 d
 
 k
 
 
 
 
 {\displaystyle d_{k}}
 
 are represented by 
 
 
 
 
 u
 
 k
 
 
 
 
 {\displaystyle u_{k}}
 
. 
 
 
 
  
 
 x
 
 k
 
 
 
 
 {\displaystyle \ x_{k}}
 
 consists entirely of a signal correlated with the undesired signal in 
 
 
 
 
 u
 
 k
 
 
 
 
 {\displaystyle u_{k}}
 
.
The output of the variable filter in the ideal case is

y
 
 k
 
 
 =
 
 
 
 
 u
 ^
 
 
 
 
 k
 
 
 
 
 {\displaystyle y_{k}={\hat {u}}_{k}}
 
 .
The error signal or <a href="/facts/Loss_function/xv5ozuhl">cost function</a> is the difference between 
 
 
 
 
 d
 
 k
 
 
 
 
 {\displaystyle d_{k}}
 
 and 
 
 
 
 
 y
 
 k
 
 
 
 
 {\displaystyle y_{k}}

ϵ
 
 k
 
 
 =
 
 d
 
 k
 
 
 −
 
 y
 
 k
 
 
 =
 
 g
 
 k
 
 
 +
 
 u
 
 k
 
 
 −
 
 
 
 
 u
 ^
 
 
 
 
 k
 
 
 
 
 {\displaystyle \epsilon _{k}=d_{k}-y_{k}=g_{k}+u_{k}-{\hat {u}}_{k}}
 
. The desired signal gk passes through without being changed.
The error signal 
 
 
 
 
 ϵ
 
 k
 
 
 
 
 {\displaystyle \epsilon _{k}}
 
 is minimized in the mean square sense when 
 
 
 
 [
 
 u
 
 k
 
 
 −
 
 
 
 
 u
 ^
 
 
 
 
 k
 
 
 ]
 
 
 {\displaystyle [u_{k}-{\hat {u}}_{k}]}
 
 is minimized. In other words, 
 
 
 
 
 
 
 
 u
 ^
 
 
 
 
 k
 
 
 
 
 {\displaystyle {\hat {u}}_{k}}
 
 is the best mean square estimate of 
 
 
 
 
 u
 
 k
 
 
 
 
 {\displaystyle u_{k}}
 
. In the ideal case, 
 
 
 
 
 u
 
 k
 
 
 =
 
 
 
 
 u
 ^
 
 
 
 
 k
 
 
 
 
 {\displaystyle u_{k}={\hat {u}}_{k}}
 
 and 
 
 
 
 
 ϵ
 
 k
 
 
 =
 
 g
 
 k
 
 
 
 
 {\displaystyle \epsilon _{k}=g_{k}}
 
, and all that is left after the subtraction is 
 
 
 
 g
 
 
 {\displaystyle g}
 
 which is the unchanged desired signal with all undesired signals removed.

<h3>Signal components in the reference input</h3>
In some situations, the reference input 
 
 
 
 
 x
 
 k
 
 
 
 
 {\displaystyle x_{k}}
 
 includes components of the desired signal. This means g' ≠ 0.
Perfect cancelation of the undesired interference is not possible in the case, but improvement of the signal to interference ratio is possible. The output will be

ϵ
 
 k
 
 
 =
 
 d
 
 k
 
 
 −
 
 y
 
 k
 
 
 =
 
 g
 
 k
 
 
 −
 
 
 
 
 g
 ^
 
 
 
 
 k
 
 
 +
 
 u
 
 k
 
 
 −
 
 
 
 
 u
 ^
 
 
 
 
 k
 
 
 
 
 {\displaystyle \epsilon _{k}=d_{k}-y_{k}=g_{k}-{\hat {g}}_{k}+u_{k}-{\hat {u}}_{k}}
 
. The desired signal will be modified (usually decreased).
The output signal to interference ratio has a simple formula referred to as power inversion.

ρ
          
            
              o
              u
              t
            
          
        
        (
        z
        )
        =
        
          
            1
            
              
                ρ
                
                  
                    r
                    e
                    f
                  
                
              
              (
              z
              )
            
          
        
      
    
    {\displaystyle \rho _{\mathsf {out}}(z)={\frac {1}{\rho _{\mathsf {ref}}(z)}}}
  
.
where

ρ
          
            
              o
              u
              t
            
          
        
        (
        z
        )
         
      
    
    {\displaystyle \rho _{\mathsf {out}}(z)\ }
  
 = output signal to interference ratio.

ρ
          
            
              r
              e
              f
            
          
        
        (
        z
        )
         
      
    
    {\displaystyle \rho _{\mathsf {ref}}(z)\ }
  
 = reference signal to interference ratio.

z
  
 
 
 {\displaystyle z\ }
 
 = frequency in the z-domain.
This formula means that the output signal to interference ratio at a particular frequency is the reciprocal of the reference signal to interference ratio.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a>
Example: A fast food restaurant has a drive-up window. Before getting to the window, customers place their order by speaking into a microphone. The microphone also picks up noise from the engine and the environment. This microphone provides the primary signal. The signal power from the customer's voice and the noise power from the engine are equal. It is difficult for the employees in the restaurant to understand the customer. To reduce the amount of interference in the primary microphone, a second microphone is located where it is intended to pick up sounds from the engine. It also picks up the customer's voice. This microphone is the source of the reference signal. In this case, the engine noise is 50 times more powerful than the customer's voice. Once the canceler has converged, the primary signal to interference ratio will be improved from 1:1 to 50:1.

<h3>Adaptive Linear Combiner</h3>
 
The adaptive linear combiner (ALC) resembles the adaptive tapped delay line FIR filter except that there is no assumed relationship between the X values. If the X values were from the outputs of a tapped delay line, then the combination of tapped delay line and ALC would comprise an adaptive filter. However, the X values could be the values of an array of pixels. Or they could be the outputs of multiple tapped delay lines. The ALC finds use as an adaptive beam former for arrays of hydrophones or antennas.

y
          
            k
          
        
        =
        
          ∑
          
            l
            =
            0
          
          
            L
          
        
        
          w
          
            l
            k
          
        
         
        
          x
          
            l
            k
          
        
        =
        
          
            W
          
          
            k
          
          
            T
          
        
        
          
            x
          
          
            k
          
        
      
    
    {\displaystyle y_{k}=\sum _{l=0}^{L}w_{lk}\ x_{lk}=\mathbf {W} _{k}^{T}\mathbf {x} _{k}}

where 
 
 
 
 
 w
 
 l
 k
 
 
 
 
 {\displaystyle w_{lk}}
 
 refers to the 
 
 
 
 l
 
 
 {\displaystyle l}
 
'th weight at k'th time.
<h3>LMS algorithm</h3>
Main article: <a href="/facts/Least_mean_squares_filter/1L0XBsyT">Least mean squares filter</a>
If the variable filter has a tapped delay line FIR structure, then the LMS update algorithm is especially simple. Typically, after each sample, the coefficients of the FIR filter are adjusted as follows:<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a>

for 
 
 
 
 l
 =
 0
 …
 L
 
 
 {\displaystyle l=0\dots L}

w
          
            l
            ,
            k
            +
            1
          
        
        =
        
          w
          
            l
            k
          
        
        +
        2
        μ
         
        
          ϵ
          
            k
          
        
         
        
          x
          
            k
            −
            l
          
        
      
    
    {\displaystyle w_{l,k+1}=w_{lk}+2\mu \ \epsilon _{k}\ x_{k-l}}

μ is called the convergence factor.
The LMS algorithm does not require that the X values have any particular relationship; therefore it can be used to adapt a linear combiner as well as an FIR filter. In this case the update formula is written as:

w
          
            l
            ,
            k
            +
            1
          
        
        =
        
          w
          
            l
            k
          
        
        +
        2
        μ
         
        
          ϵ
          
            k
          
        
         
        
          x
          
            l
            k
          
        
      
    
    {\displaystyle w_{l,k+1}=w_{lk}+2\mu \ \epsilon _{k}\ x_{lk}}

The effect of the LMS algorithm is at each time, k, to make a small change in each weight. The direction of the change is such that it would decrease the error if it had been applied at time k. The magnitude of the change in each weight depends on μ, the associated X value and the error at time k. The weights making the largest contribution to the output, 
 
 
 
 
 y
 
 k
 
 
 
 
 {\displaystyle y_{k}}
 
, are changed the most. If the error is zero, then there should be no change in the weights. If the associated value of X is zero, then changing the weight makes no difference, so it is not changed.

<h4>Convergence</h4>
μ controls how fast and how well the algorithm converges to the optimum filter coefficients. If μ is too large, the algorithm will not converge. If μ is too small the algorithm converges slowly and may not be able to track changing conditions. If μ is large but not too large to prevent convergence, the algorithm reaches steady state rapidly but continuously overshoots the optimum weight vector. Sometimes, μ is made large at first for rapid convergence and then decreased to minimize overshoot.
Widrow and Stearns state in 1985 that they have no knowledge of a proof that the LMS algorithm will converge in all cases.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a>
However under certain assumptions about stationarity and independence it can be shown that the algorithm will converge if

0
 <
 μ
 <
 
 
 1
 
 σ
 
 2
 
 
 
 
 
 
 {\displaystyle 0<\mu <{\frac {1}{\sigma ^{2}}}}

where

σ
          
            2
          
        
        =
        
          ∑
          
            l
            =
            0
          
          
            L
          
        
        
          σ
          
            l
          
          
            2
          
        
      
    
    {\displaystyle \sigma ^{2}=\sum _{l=0}^{L}\sigma _{l}^{2}}
  
 = sum of all input power

σ
 
 l
 
 
 
 
 {\displaystyle \sigma _{l}}
 
 is the <a href="/facts/Root_mean_square/Cfmg7dws">RMS</a> value of the 
 
 
 
 l
 
 
 {\displaystyle l}
 
'th input
In the case of the tapped delay line filter, each input has the same RMS value because they are simply the same values delayed. In this case the total power is

σ
          
            2
          
        
        =
        (
        L
        +
        1
        )
        
          σ
          
            0
          
          
            2
          
        
      
    
    {\displaystyle \sigma ^{2}=(L+1)\sigma _{0}^{2}}

where

σ
 
 0
 
 
 
 
 {\displaystyle \sigma _{0}}
 
 is the RMS value of 
 
 
 
 
 x
 
 k
 
 
 
 
 {\displaystyle x_{k}}
 
, the input stream.<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a>
This leads to a normalized LMS algorithm:

w
 
 l
 ,
 k
 +
 1
 
 
 =
 
 w
 
 l
 k
 
 
 +
 
 (
 
 
 
 2
 
 μ
 
 σ
 
 
 
 
 σ
 
 2
 
 
 
 
 )
 
 
 ϵ
 
 k
 
 
  
 
 x
 
 k
 −
 l
 
 
 
 
 {\displaystyle w_{l,k+1}=w_{lk}+\left({\frac {2\mu _{\sigma }}{\sigma ^{2}}}\right)\epsilon _{k}\ x_{k-l}}
 
 in which case the convergence criteria becomes: 
 
 
 
 0
 <
 
 μ
 
 σ
 
 
 <
 1
 
 
 {\displaystyle 0<\mu _{\sigma }<1}
 
.
<h3>Nonlinear Adaptive Filters</h3>
The goal of nonlinear filters is to overcome limitation of linear models. There are some commonly used approaches: Volterra LMS, <a href="/facts/Kernel_adaptive_filter/uyYCeKGn">Kernel adaptive filter</a>, Spline Adaptive Filter <a class="footnote-ref" id="fnref:9" href="#fn:9">9</a> and Urysohn Adaptive Filter.<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a><a class="footnote-ref" id="fnref:11" href="#fn:11">11</a> Many authors <a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> include also Neural networks into this list. The general idea behind Volterra LMS and Kernel LMS is to replace data samples by different nonlinear algebraic expressions. For Volterra LMS this expression is <a href="/facts/Volterra_series/oDUJXYxR">Volterra series</a>. In Spline Adaptive Filter the model is a cascade of linear dynamic block and static non-linearity, which is approximated by splines.
In Urysohn Adaptive Filter the linear terms in a model

y
          
            i
          
        
        =
        
          ∑
          
            j
            =
            0
          
          
            m
          
        
        
          w
          
            j
          
        
         
        
          x
          
            i
            j
          
        
      
    
    {\displaystyle y_{i}=\sum _{j=0}^{m}w_{j}\ x_{ij}}

are replaced by piecewise linear functions

y
          
            i
          
        
        =
        
          ∑
          
            j
            =
            0
          
          
            m
          
        
        
          f
          
            j
          
        
        (
        
          x
          
            i
            j
          
        
        )
      
    
    {\displaystyle y_{i}=\sum _{j=0}^{m}f_{j}(x_{ij})}

which are identified from data samples.

<h2 id="applications-of-adaptive-filters">Applications of adaptive filters</h2>
<ul><li><a href="/facts/Adaptive_noise_cancelling/tJjtywcd">Adaptive Noise Cancelling</a></li>
<li><a href="/facts/Active_noise_control/tVxqLBDs">Acoustic Noise Control</a></li>
<li><a href="/facts/Linear_prediction/u8gzoURe">Signal prediction</a></li>
<li><a href="/facts/Adaptive_feedback_cancellation/NHxfXaP3">Adaptive feedback cancellation</a></li>
<li><a href="/facts/Echo_cancellation/Q26toK4x">Echo cancellation</a></li></ul>
<h2 id="filter-implementations">Filter implementations</h2>
<ul><li><a href="/facts/Least_mean_squares_filter/1L0XBsyT">Least mean squares filter</a></li>
<li><a href="/facts/Recursive_least_squares_filter/K3y6q7db">Recursive least squares filter</a></li>
<li><a href="/facts/Multidelay_block_frequency_domain_adaptive_filter/5nhGW9E5">Multidelay block frequency domain adaptive filter</a></li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/2D_adaptive_filters/pH8Lsz38">2D adaptive filters</a></li>
<li><a href="/facts/Filter_(signal_processing)/vydJCNle">Filter (signal processing)</a></li>
<li><a href="/facts/Kalman_filter/wNK7rnbk">Kalman filter</a></li>
<li><a href="/facts/Kernel_adaptive_filter/uyYCeKGn">Kernel adaptive filter</a></li>
<li><a href="/facts/Linear_prediction/u8gzoURe">Linear prediction</a></li>
<li><a href="/facts/MMSE_estimator/hI2lqEMh">MMSE estimator</a></li>
<li><a href="/facts/Wiener_filter/oGWdBTYa">Wiener filter</a></li>
<li><a href="/facts/Wiener%E2%80%93Hopf_equation/bvSfGfMz">Wiener–Hopf equation</a></li></ul>

<h3>Sources</h3>
<ul><li>Hayes, Monson H. (1996). Statistical Digital Signal Processing and Modeling. Wiley. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-471-59431-4.</li>
<li>Haykin, Simon (2002). Adaptive Filter Theory. Prentice Hall. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-13-048434-5.</li>
<li>Widrow, Bernard; Stearns, Samuel D. (1985). Adaptive Signal Processing. Englewood Cliffs, NJ: Prentice Hall. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-13-004029-9.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Thakor, N.V.; Zhu, Yi-Sheng (1991-08-01). "Applications of adaptive filtering to ECG analysis: noise cancellation and arrhythmia detection". IEEE Transactions on Biomedical Engineering. 38 (8): 785–794. doi:10.1109/10.83591. ISSN 0018-9294. PMID 1937512. S2CID 11271450. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Widrow, Bernard; Stearns, Samuel D. (1985). Adaptive Signal Processing (1st ed.). Prentice-Hall. p. 329. ISBN 978-0130040299. <a href="978-0130040299" target="_blank">978-0130040299</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Widrow p 304 <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Widrow p 212 <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Widrow p 313 <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Widrow p. 100 <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Widrow p 103 <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Widrow p 103 <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Danilo Comminiello; José C. Príncipe (2018). Adaptive Learning Methods for Nonlinear System Modeling. Elsevier Inc. ISBN 978-0-12-812976-0. <a href="978-0-12-812976-0" target="_blank">978-0-12-812976-0</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">M.Poluektov and A.Polar. Urysohn Adaptive Filter. 2019. <a href="http://ezcodesample.com/UAF/UAF.html" target="_blank">http://ezcodesample.com/UAF/UAF.html</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">"Nonlinear Adaptive Filtering". ezcodesample.com. <a href="http://ezcodesample.com/NAF/index.html" target="_blank">http://ezcodesample.com/NAF/index.html</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Weifeng Liu; José C. Principe; Simon Haykin (March 2010). Kernel Adaptive Filtering: A Comprehensive Introduction (PDF). Wiley. pp. 12–20. ISBN 978-0-470-44753-6. <a href="978-0-470-44753-6" target="_blank">978-0-470-44753-6</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
</ol>

Adaptive filter open-in-new

Adaptive filter