| ??? 08/14/02 18:44 Read: times |
#27250 - RE: moving average |
An often better filter characterstic that is fairly easy to implement is the "Exponential forgetter", which is the function Filter(n)=sample *K +(1-k)filter(n-1) 0 < k < 1 As K reduces the filter gets "slower". We often bits that kick out samples that are X% away from the "mean" output. Steve |
| Topic | Author | Date |
| moving average | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
| RE: Steve | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
| RE: Peter. | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
| RE: moving average | 01/01/70 00:00 | |
RE: moving average | 01/01/70 00:00 |



