Brain Dump

Filter

Tags
speech-processing

[see page 14, Modifies] the properties of a signal.

A filter can be [see page 1, defined] as \[ y[k] = x[k] \times h[k] \] where \(x[k]\) is the value of the input signal at time \(k\), and \(h[k]\) is the filter transformation. \(y[k]\) is the signal outputted by the filter.

Typically characterised by it's [see page 14, frequency-response] in the frequency-domain:

FRMeaning
Low PassAllow only low frequencies through.
High PassAllow only high frequencies through.
Band PassLets through a certain range of frequencies.
Band StopCuts away certain frequency ranges.

When a signal is sent through one of these filters only the parts of the signal the filter lets through are [see page 14, included] in the output.

The output of a linear-filter in time-domain is a discrete Convolution of the filter and the input signal.

Definition and Complexity

A filters behaviour is completely characterised by its poles and zeros. The [see page 3, complexity] of a filter is characterise by the order of these P&Z. We define order as the number of past input values involved in the calculation (eg. a filter using two values is labelled a \nth{2}-order filter).

Applications in speech-processing