-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchannel.C
131 lines (115 loc) · 3.26 KB
/
channel.C
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <cstdlib>
#include <math.h>
#include <iostream>
#include <assert.h>
#include <random>
#include "channel.h"
using namespace std;
std::default_random_engine generator;
// input channel
Channel::Channel(int step_analog, int step_spikeT, int index):
_step_analog(step_analog),
_step_spikeT(step_spikeT),
_index(index),
_mode(INPUTCHANNEL)
{}
// reservoir channel
Channel::Channel(int index):
_index(index),
_mode(RESERVOIRCHANNEL)
{
_step_analog = 10;
_step_spikeT = 1;
}
void Channel::AddAnalog(double signal){
_analog.push_back(signal);
}
void Channel::AddSpike(int spikeT){
int size = _spikeT.size();
if(size > 0){
if(spikeT <= _spikeT[size-1])
cout<<spikeT<<"\t"<<_spikeT[size-1]<<endl;
assert(spikeT > _spikeT[size-1]);
}else{
assert(spikeT > 0);
}
_spikeT.push_back(spikeT);
}
int Channel::FirstSpikeT(){
if(_spikeT.empty() == true) return -1;
_iter_spikeT = _spikeT.begin();
return *_iter_spikeT;
}
int Channel::NextSpikeT(){
_iter_spikeT++;
if(_iter_spikeT == _spikeT.end()) return -1;
else return *_iter_spikeT;
}
void Channel::BSA(){
int length_kernel = 24;
int length_signal = (_analog.size()*_step_analog)/_step_spikeT + 24;
double threshold = 0.6;
double error1, error2, temp;
double * kernel = new double[length_kernel];
double * signal = new double[length_signal];
//double sig, noi;
for(int i = 0; i < length_kernel; i++) kernel[i] = exp(-(i-double(length_kernel)/2)*(i-double(length_kernel)/2)/25);
temp = 0;
for(int i = 0; i < length_kernel; i++) temp += kernel[i];
for(int i = 0; i < length_kernel; i++) kernel[i] /= temp;
int index = 0;
for(int i = 0; i < _analog.size(); i++)
for(; index < (i+1)*_step_analog/_step_spikeT; index++)
signal[index] = _analog[i]*2e3;
for(; index < length_signal; index++) signal[index] = 0;
int j;
for(int i = 0; i < length_signal-24; i++){
error1 = 0;
error2 = 0;
for(j = 0; j < length_kernel; j++){
temp = signal[i+j] - kernel[j];
error1 += (temp<0) ? -temp : temp;
temp = signal[i+j];
error2 += (temp<0) ? -temp : temp;
}
if(error1 < (error2-threshold)){
_spikeT.push_back(i+1);
for(j = 0; j < length_kernel; j++) signal[i+j] -= kernel[j];
}
}
delete [] kernel;
delete [] signal;
}
//* clear the channel:
void Channel::Clear(){
// Note that this is going to invalid the iterator!!
// So when you are using the iterator, please call FirstSpike() at first!!
_spikeT.clear();
}
void Channel::Print(ofstream& f_out){
assert(f_out.is_open());
if(_spikeT.empty() == true) return;
for(_iter_spikeT = _spikeT.begin(); _iter_spikeT != _spikeT.end(); _iter_spikeT++)
f_out<<_index<<"\t"<<*_iter_spikeT<<endl;
}
void Channel::Read(FILE * fp){
char linestring[8192];
char * token;
int spike_t;
int index;
while(1){
if(fgets(linestring,8191,fp)==NULL||linestring[0]=='\n'){
assert(0);
}
token=strtok(linestring," \t\n,");
index=atoi(token);
if(index==-1){
break;
}
if(index!=_index)
assert(0);
token=strtok(NULL," \t\n,");
spike_t=atoi(token);
AddSpike(atoi(token));
}
}