13.3 Matched filter detector  (Page 2/4)

For example, consider the target signal given in [link] and the set of two signals given in [link] . By inspection, it is clear that the signal $g_2$ is most like the target signal $f$ . However, to make that conclusion mathematically, we use the matched filter detector with the $L_2$ inner product. If we were to actually make the necessary computations, we would first normalize each signal and then compute the necessary inner products in order to compare the signals in $X$ with the target signal $f$ . We would notice that the absolute value of the inner product for $g_2$ with $f$ when normalized is greater than the absolute value of the inner product of $g_1$ with $f$ when normalized, mathematically stated as

$$g_2={argmax}_{x\in \{g_1,g_2\}}\left|〈\frac{x}{\left|\right|x\left|\right|},,,\frac{f}{\left|\right|f\left|\right|}〉\right|.$$

Template signal

Candidate signals

Got questions? Get instant answers now!

Pattern detection

A somewhat more involved matched filter detector scheme would involve attempting to match a target time limited signal $y=f$ to a set of of time shifted and windowed versions of a single signal $X=\left\{w{S}_{t}g\right|t\in \mathbb{R}\}$ indexed by $\mathbb{R}$ . The windowing funtion is given by $w\left(t\right)=u(t-t_1)-u(t-t_2)$ where $[t_1,t_2]$ is the interval to which $f$ is time limited. This scheme could be used to find portions of $g$ that have the same shape as $f$ . If the absolute value of the inner product of the normalized versions of $f$ and $w{S}_{t}g$ is large, which is the absolute value of the normalized correlation for standard inner products, then $g$ has a high degree of “likeness” to $f$ on the interval to which $f$ is time limited but left shifted by $t$ . Of course, if $f$ is not time limited, it means that the entire signal has a high degree of “likeness” to $f$ left shifted by $t$ .

Thus, in order to determine the most likely locations of a signal with the same shape as the target signal $f$ in a signal $g$ we wish to compute

to provide the desired shift. Assuming the inner product space examined is $L_2(\mathbb{R}$ (similar results hold for $L_2\left(\mathbb{R}[a,b)\right)$ , $l_2\left(\mathbb{Z}\right)$ , and $l_2\left(\mathbb{Z}[a,b)\right)$ ), this produces

Since $f$ and $w$ are time limited to the same interval

Making the subsitution $h\left(t\right)=\overline{g(-t)}$ ,

Noting that this expression contains a convolution operation

where $h$ is the conjugate of the time reversed version of $g$ defined by $$h\left(t\right)=\overline{g(-t)}.$$

In the special case in which the target signal $f$ is not time limited, $w$ has unit value on the entire real line. Thus, the norm can be evaluated as $\left|\right|w{S}_{t}g\left|\right|=\left|\right|S_{t}g\left|\right|=\left|\right|g\left|\right|=\left|\right|h\left|\right|$ . Therefore, the function reduces to $t_m={argmax}_{t\in \mathbb{R}}\frac{(f*h)\left(t\right)}{\left|\right|f\left|\right|\left|\right|h\left|\right|}$ where $h\left(t\right)=\overline{g(-t)}.$ The function $f*g=\frac{(f*h)\left(t\right)}{\left|\right|f\left|\right|\left|\right|h\left|\right|}$ is known as the normalized cross-correlation of $f$ and $g$ .

Hence, this matched filter scheme can be implemented as a convolution. Therefore, it may be expedient to implement it in the frequency domain. Similar results hold for the $L_2\left(\mathbb{R}[a,b)\right)$ , $l_2\left(\mathbb{Z}\right)$ , and $l_2\left(\mathbb{Z}[a,b]\right)$ spaces. It is especially useful to implement the $l_2\left(\mathbb{Z}[a,b]\right)$ cases in the frequency domain as the power of the Fast Fourier Transform algorithm can be leveraged to quickly perform the computations in a computer program. In the $L_2\left(\mathbb{R}[a,b)\right)$ and $l_2\left(\mathbb{Z}[a,b]\right)$ cases, care must be taken to zero pad the signal if wrap-around effects are not desired. Similar results also hold for spaces on higher dimensional intervals with the same inner products.