source: flair-src/trunk/lib/FlairFilter/src/ButterworthLowPass_impl.cpp@ 447

Last change on this file since 447 was 318, checked in by Sanahuja Guillaume, 5 years ago
File size: 3.8 KB
RevLine 
[10]1// %flair:license{
[15]2// This file is part of the Flair framework distributed under the
3// CECILL-C License, Version 1.0.
[10]4// %flair:license}
[7]5// created: 2013/12/10
6// filename: ButterworthLowPass_impl.cpp
7//
8// author: Guillaume Sanahuja
9// Copyright Heudiasyc UMR UTC/CNRS 7253
10//
11// version: $Id: $
12//
13// purpose: objet permettant le calcul d'un filtre passe bas de Butterworth
14//
15//
16/*********************************************************************/
17
18#include "ButterworthLowPass_impl.h"
19#include "ButterworthLowPass.h"
[214]20#include <Matrix.h>
[7]21#include <Layout.h>
22#include <GroupBox.h>
23#include <SpinBox.h>
24#include <DoubleSpinBox.h>
25
26using std::string;
27using namespace flair::core;
28using namespace flair::gui;
29using namespace flair::filter;
30
[214]31ButterworthLowPass_impl::ButterworthLowPass_impl(const ButterworthLowPass *self,
[15]32 const LayoutPosition *position,
[162]33 string name, uint32_t order,uint32_t nbRow,uint32_t nbCol) {
[15]34 // init UI
35 GroupBox *reglages_groupbox = new GroupBox(position, name);
36 T = new DoubleSpinBox(reglages_groupbox->NewRow(), "period, 0 for auto", " s",
37 0, 10, 0.01);
38 cutoff = new DoubleSpinBox(reglages_groupbox->NewRow(), "cutoff frequency",
39 " Hz", 0, 10000, 0.1, 2, 1);
[7]40
[318]41 MatrixDescriptor *desc = new MatrixDescriptor(nbRow, nbCol);
[162]42 //desc->SetElementName(0, 0, "output");
[214]43 output = new Matrix(self, desc, floatType, name);
[148]44 delete desc;
[7]45
[162]46 f=(PoleFilter**)malloc(sizeof(PoleFilter*)*nbRow*nbCol);
47
48 for(uint32_t i=0;i<nbRow;i++) {
49 for(uint32_t j=0;j<nbCol;j++) {
50 f[i*nbCol+j] = new PoleFilter(order);
51 if (T->Value() != 0) {
52 f[i*nbCol+j]->setup(1. / T->Value(), cutoff->Value());
53 }
54 f[i*nbCol+j]->reset();
55 }
[147]56 }
[7]57
[147]58 this->order=order;
[162]59 this->nbRow=nbRow;
60 this->nbCol=nbCol;
[214]61 this->self=self;
[7]62}
63
[162]64ButterworthLowPass_impl::~ButterworthLowPass_impl() {
65 for(uint32_t i=0;i<nbRow;i++) {
66 for(uint32_t j=0;j<nbCol;j++) {
67 delete f[i*nbCol+j];
68 }
69 }
70 free(f);
71}
[7]72
[15]73void ButterworthLowPass_impl::UpdateFrom(const io_data *data) {
[147]74 float delta_t;
[214]75 const Matrix* input = dynamic_cast<const Matrix*>(data);
[147]76
[214]77 if (!input) {
78 self->Warn("casting %s to Matrix failed\n",data->ObjectName().c_str());
79 return;
80 }
81
[162]82 if (T->ValueChanged() && T->Value() != 0) {
83 for(uint32_t i=0;i<nbRow;i++) {
84 for(uint32_t j=0;j<nbCol;j++) {
85 f[i*nbCol+j]->setup(1. / T->Value(), cutoff->Value());
[165]86 //settingsChanged(f[i*nbCol+j],input->Value(i, j));
[162]87 }
[7]88 }
[15]89 }
[7]90
[147]91 if (T->Value() == 0) {
[223]92 delta_t = (float)(data->DataDeltaTime()) / 1000000000.;
[162]93 for(uint32_t i=0;i<nbRow;i++) {
94 for(uint32_t j=0;j<nbCol;j++) {
95 f[i*nbCol+j]->setup(1. / delta_t, cutoff->Value());
96 }
97 }
[147]98 } else {
99 delta_t=T->Value();
100 }
101
[15]102 // on prend une fois pour toute les mutex et on fait des accès directs
103 output->GetMutex();
104 input->GetMutex();
[7]105
[147]106 if (cutoff->ValueChanged()) {
[162]107 for(uint32_t i=0;i<nbRow;i++) {
108 for(uint32_t j=0;j<nbCol;j++) {
109 f[i*nbCol+j]->setup(1. / delta_t, cutoff->Value());
[165]110 //settingsChanged(f[i*nbCol+j],input->ValueNoMutex(i, j));
[162]111 }
112 }
[15]113 }
[7]114
[223]115 if (delta_t!=0) {
[162]116 for(uint32_t i=0;i<nbRow;i++) {
117 for(uint32_t j=0;j<nbCol;j++) {
118 float result = f[i*nbCol+j]->filter(input->ValueNoMutex(i, j));
119 output->SetValueNoMutex(i, j, result);
120 }
121 }
[15]122 }
[7]123
[15]124 input->ReleaseMutex();
125 output->ReleaseMutex();
[7]126
[15]127 output->SetDataTime(data->DataTime());
[7]128}
[147]129
130//ne gere pas les oscillations (s'arrete des qu'une valeure est bonne a 5%)
[162]131void ButterworthLowPass_impl::settingsChanged(PoleFilter*f,float inputValue) {
[147]132 float result=f->filter(inputValue);
133
134 while(result<inputValue*0.95 || result>inputValue*1.05) {
135 result=f->filter(inputValue);
136 }
137}
Note: See TracBrowser for help on using the repository browser.