comparison man/man1/filt1.1 @ 0:5242703e91d3 tip

Initial checkin for AIM92 aimR8.2 (last updated May 1997).
author tomwalters
date Fri, 20 May 2011 15:19:45 +0100
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:5242703e91d3
1 .TH FILT1 1 "1 September 1993"
2
3 .SH NAME
4 filt1 \- 1st order LP filter using an exponential smoother.
5
6 .SH SYNTAX
7 filt1 [options] [file]
8
9 .SH DESCRIPTION
10 A recursive "leaky integrator" 1st order low-pass filter which is a shifting
11 exponential window which decays into the past values.
12
13 .SH OPTIONS
14
15 1. tc
16
17 The time-constant parameter which controls the rate of decay and so the
18 size of the exponential window. For a given time constant of T seconds:
19
20 .nf
21 0.7T secs is the window half--life.
22 4.6T secs is 99% of the window's life.
23 .fi
24
25 When the time-constant parameter is given with time units (s or ms) then
26 it is converted to a decay constant using a = exp(-Ts/T),
27 where Ts is the sample interval in seconds from the given `samplerate' option,
28 and T is decay time-constant in seconds.
29 Otherwise the time-constant parameter is taken to be the decay constant directly.
30
31 With decay constant a=1 there is infinite memory because it does not decay.
32 With 0 < a < 1 there is a finite decaying memory.
33 The smaller `a', the smaller the memory (it decays faster).
34 With a = 0 the filter output is identical with its input.
35
36 2. de
37
38 Two optional difference equations are provided which repsectively compute
39 a recursive sum (when "de=sum") and mean (when "de=mean").
40 The n'th recursive update is respectively:
41
42 .nf
43 y[n] = a.y[n-1] + x[n] recursive sum
44 y[n] = a.y[n-1] + (1-a).x[n] recursive mean
45 .fi
46
47 where decay constant a = exp(-Ts/T),
48 Ts is the sample interval in seconds, and T is decay time-constant in seconds.
49
50 .SH "SEE ALSO"
51 options smooth
52
53 .SH COPYRIGHT
54 .LP
55 Copyright (c) Applied Psychology Unit, Medical Research Council, 1995
56 .LP
57 Permission to use, copy, modify, and distribute this software without fee
58 is hereby granted for research purposes, provided that this copyright
59 notice appears in all copies and in all supporting documentation, and that
60 the software is not redistributed for any fee (except for a nominal
61 shipping charge). Anyone wanting to incorporate all or part of this
62 software in a commercial product must obtain a license from the Medical
63 Research Council.
64 .LP
65 The MRC makes no representations about the suitability of this
66 software for any purpose. It is provided "as is" without express or
67 implied warranty.
68 .LP
69 THE MRC DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
70 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
71 THE A.P.U. BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
72 OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
73 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
74 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
75 SOFTWARE.
76