In mathematics, the Wiener series, or Wiener G-functional expansion, originates from the 1958 book of Norbert Wiener. It is an orthogonal expansion for nonlinear functionals closely related to the Volterra series and having the same relation to it as an orthogonal Hermite polynomial expansion has to a power series. For this reason it is also known as the Wiener–Hermite expansion. The analogue of the coefficients are referred to as Wiener kernels. The terms of the series are orthogonal (uncorrelated) with respect to a statistical input of white noise. This property allows the terms to be identified in applications by the Lee–Schetzen method. The Wiener series is important in nonlinear system identification. In this context, the series approximates the functional relation of the output to the entire history of system input at any time. The Wiener series has been applied mostly to the identification of biological systems, especially in neuroscience. The name Wiener series is almost exclusively used in system theory. In the mathematical literature it occurs as the Itô expansion (1951) which has a different form but is entirely equivalent to it. The Wiener series should not be confused with the Wiener filter, which is another algorithm developed by Norbert Wiener used in signal processing.
Wiener G-functional expressions Given a system with an input/output pair ( x ( t ) , y ( t ) ) {\displaystyle (x(t),y(t))} where the input is white noise with zero mean value and power A, we can write the output of the system as sum of a series of Wiener G-functionals
y ( n ) = ∑ p ( G p x ) ( n ) {\displaystyle y(n)=\sum _{p}(G_{p}x)(n)}
In the following the expressions of the G-functionals up to the fifth order will be given:
{{Clarify}}
( G 0 x ) ( n ) = k 0 = E { y ( n ) } ; {\displaystyle (G_{0}x)(n)=k_{0}=E\left\{y(n)\right\};}
( G 1 x ) ( n ) = ∑ τ 1 = 0 N 1 − 1 k 1 ( τ 1 ) x ( n − τ 1 ) ; {\displaystyle (G_{1}x)(n)=\sum _{\tau _{1}=0}^{N_{1}-1}k_{1}(\tau _{1})x(n-\tau _{1});}
( G 2 x ) ( n ) = ∑ τ 1 , τ 2 = 0 N 2 − 1 k 2 ( τ 1 , τ 2 ) x ( n − τ 1 ) x ( n − τ 2 ) − A ∑ τ 1 = 0 N 2 − 1 k 2 ( τ 1 , τ 1 ) ; {\displaystyle (G_{2}x)(n)=\sum _{\tau _{1},\tau _{2}=0}^{N_{2}-1}k_{2}(\tau _{1},\tau _{2})x(n-\tau _{1})x(n-\tau _{2})-A\sum _{\tau _{1}=0}^{N_{2}-1}k_{2}(\tau _{1},\tau _{1});}
… excerpt ends here. Continue reading the full article.
