# Difference between revisions of "Contributions:HilbertFilter"

(→Location) |
m |
||

Line 23: | Line 23: | ||

</math> | </math> | ||

− | for <math> 0\leq n \leq N-1 </math>, where ''N'' must be an odd number representing the length of the filter. The resulting Hilbert transform is delayed by <math> \delta = | + | for <math> 0\leq n \leq N-1 </math>, where ''N'' must be an odd number representing the length of the filter. The resulting Hilbert transform is delayed by <math> \delta = (N-1)/2 </math> implying that the real part of the analytic signal must be delayed by the same amount too in order to estimate the envelope and phase of the input signal. |

==Location== | ==Location== | ||

Line 54: | Line 54: | ||

===Delay=== | ===Delay=== | ||

− | As for most BCI2000 parameters expressing time, this | + | As for most BCI2000 parameters expressing time, this parameter should be expressed either as a number of SampleBlocks (a bare number without unit) or as a physical length of time with a unit appended (e.g. "0.1s"). |

− | The length of the Hilbert filter itself is <math> N = 2 \delta + 1 </math> | + | The length of the Hilbert filter itself is <math> N = 2 \delta + 1 </math> where the delay <math> \delta </math> expressed in samples. Conversely the delay is <math> \delta = ( N - 1 ) / 2 </math>, where ''N'' is the (odd) number of samples in the filter. Empirically, we have found that <math>N \ge 201</math> samples (i.e. <math>\delta \ge 100</math> samples) is advisable for a reasonable-quality approximation to the infinite Hilbert transform. A warning is issued if the delay is shorter than this. |

==States== | ==States== |

## Revision as of 00:07, 28 March 2012

## Contents

## Synopsis

This filter computes the envelope or the phase of a signal using Hilbert transform. The discrete input signal *x*(*n*) is first transformed to its analytic representation (i.e., analytic signal), which is composed of real and imaginary parts.

The real part is the same input signal, and the imaginary part is the Hilbert transform of the input signal. The Hilbert transform is implemented as the convolution of the input signal with the filter *h*(*n*).

To get an ideal Hilbert transform, *n* must be infinitely long . However, for real time implementations, *h*(*n*) must be truncated and delayed to guarantee a causal filter. Thus, the FIR filter is defined as

for , where *N* must be an odd number representing the length of the filter. The resulting Hilbert transform is delayed by implying that the real part of the analytic signal must be delayed by the same amount too in order to estimate the envelope and phase of the input signal.

## Location

## Versioning

### Authors

Cristhian Potes, Jeremy Hill

### Source Code Revisions

- Initial development:
- Tested under:
- Known to compile under:
- Broken since:

## Parameters

### OutputSignal

This parameter may be one of

- 0 - Copy input signal
- no processing,
- 1 - Magnitude
- Hilbert envelope amplitude,
- 2 - Phase
- Hilbert phase,
- 3 - Real part
- original input signal, but with a delay to match its timing to the imaginary part.
- 4 - Imaginary part
- original signal filtered with an FIR-Hilbert transformer.

### Delay

As for most BCI2000 parameters expressing time, this parameter should be expressed either as a number of SampleBlocks (a bare number without unit) or as a physical length of time with a unit appended (e.g. "0.1s").

The length of the Hilbert filter itself is where the delay expressed in samples. Conversely the delay is , where *N* is the (odd) number of samples in the filter. Empirically, we have found that samples (i.e. samples) is advisable for a reasonable-quality approximation to the infinite Hilbert transform. A warning is issued if the delay is shorter than this.

## States

None.

## See also

User Reference:Filters, Contributions:SignalProcessing, Contributions:HilbertSignalProcessing