# Optimum Wiener filters

Return to the desired output — the zero-delay spike (1, 0, 0), that was considered when studying inverse and least-squares filters. Rewrite equation (**16**), which we solved to obtain the least-squares inverse filter, as follows:

**(**)

**(**)

Divide both sides by 2 to obtain

**(**)

The autocorrelation of the input wavelet (1, - 12) is shown in Table 2-17. Note that the autocorrelation lags are the same as the first column of the 2 × 2 matrix on the left side of equation (**27**).

Now compute the crosscorrelation of the desired output (1, 0, 0) with the input wavelet (1, - 12) (Table 2-18). The crosscorrelation lags are the same as the column matrix on the right side of equation (**27**).

1 | - 12 | Output | ||

1 | - 12 | 54 | ||

1 | - 12 | - 12 |

1 | 0 | 0 | Output | |

1 | - 12 | 1 | ||

1 | - 12 | 0 |

In general, the elements of the matrix on the left side of equation (**27**) are the lags of the autocorrelation of the input wavelet, while the elements of the column matrix on the right side are the lags of the crosscorrelation of the desired output with the input wavelet.

Now perform similar operations for wavelet (- 12, 1). By rewriting the matrix equation (**19**), we obtain

**(**)

**(**)

Divide both sides by 2 to obtain

**(**)

The autocorrelation of wavelet (- 12, 1) is given in Table 2-19. The elements of the matrix on the left side of equation (**29**) are the autocorrelation lags of the input wavelet. Note that autocorrelation of wavelet (- 12, 1) is identical to that of wavelet (1, - 12) (Table 2-17). As discussed in inverse filtering, an important property of a group of wavelets with the same amplitude spectrum is that they also have the same autocorrelation.

The crosscorrelation of the desired output (1, 0, 0) with input wavelet (- 12, 1) is given in Table 2-20. Note that the right side of equation (**29**) is the same as the crosscorrelation lags.

- 12 | 1 | Output | ||

- 12 | 1 | 54 | ||

- 12 | 1 | - 12 |

1 | 0 | 0 | Output | |

- 12 | 1 | - 12 | ||

- 12 | 1 | 0 |

Matrix equations (**27**) and (**29**) were used to derive the least-squares inverse filters. These filters then were applied to the input wavelets to compress them to zero-lag spike. The matrices on the left in equations (**27**) and (**29**) are made up of the autocorrelation lags of the input wavelets. Additionally, the column matrices on the right are made up of lags of the crosscorrelation of the desired output — a zero-lag spike, with the input wavelets. These observations were generalized by Wiener to derive filters that convert the input to any desired output ^{[1]}.

The general form of the matrix equation such as equation (**29**) for a filter of length *n* is (optimum Wiener filters):

**(**)

Here *r _{i}*,

*a*, and

_{i}*g*,

_{i}*i*= 0, 1, 2, …,

*n*− 1 are the autocorrelation lags of the input wavelet, the Wiener filter coefficients, and the crosscorrelation lags of the desired output with the input wavelet, respectively.

The optimum Wiener filter (*a*_{0}, *a*_{1}, *a*_{2}, …, *a*_{n−1}) is *optimum* in that the least-squares error between the actual and desired outputs is minimum. When the desired output is the zero-lag spike (1, 0, 0, …, 0), then the Wiener filter is identical to the least-squares inverse filter. In other words, the least-squares inverse filter really is a special case of the Wiener filter.

The Wiener filter applies to a large class of problems in which any desired output can be considered, not just the zero-lag spike. Five choices for the desired output are:

- Type 1: Zero-lag spike,
- Type 2: Spike at arbitrary lag,
- Type 3: Time-advanced form of input series,
- Type 4: Zero-phase wavelet,
- Type 5: Any desired arbitrary shape.

These desired output forms will be discussed in the following sections.

The general form of the normal equations (**30**) was arrived at through numerical examples for the special case where the desired output was a zero-lag spike. Optimum Wiener filters provides a concise mathematical treatment of the optimum Wiener filters. Figure 2.3-1 outlines the design and application of a Wiener filter.

Determination of the Wiener filter coefficients requires solution of the so-called normal equations (**30**). From equation (**30**), note that the autocorrelation matrix is symmetric. This special matrix, called the Toeplitz matrix, can be solved by Levinson recursion, a computationally efficient scheme (spiking deconvolution). To do this, compute a two-point filter, derive from it a three-point filter, and so on, until the *n*-point filter is derived ^{[2]}. In practice, filtering algorithms based on the optimum Wiener filter theory are known as Wiener-Levinson algorithms.

## References

## See also

- Spiking deconvolution
- Prewhitening
- Wavelet processing by shaping filters
- Predictive deconvolution
- Exercises
- Mathematical foundation of deconvolution