-
Notifications
You must be signed in to change notification settings - Fork 0
/
gorgophone-oldstye-for-loops.c
380 lines (307 loc) · 11.7 KB
/
gorgophone-oldstye-for-loops.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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
/* Gorgophone
* A Continuous-Time-Random-Walk Time of Flight simulator for thin film
* organic photovoltaic cells, using slithering-snake morphologies generated
* by Amphisbaena.
*
* This file started 30th June 2005, by Jarvist Frost.
* Based on previous code and algorithms in Jenny Nelson & Amanda Chatten's
* previous ToF simulator, adapted for snake considerations.
*
* From the Wikipedia:
* In Greek mythology, Gorgophone, whose name means 'Gorgon Slayer' was the
* daughter of Perseus, who slew Medussa. The Amphisbaena was spawned from
* blood dripping from Medusa's severed head as Perseus flew with it across
* the Libyan desert
*
* Molecular Electronic Materials and Devices
* Experimental Solid State Physics
* Blackett Laboratory
* Imperial College, London
*/
#include <stdlib.h>
//double occtime[X][Y][Z]; //save occupation time on lattice
//#include "df3.c" //df3 povray density generation
//#include "amphisbaena.h" //reuse lattice setup from Amphisbaena
//#include "lattice_util.c" //reuse lattice utilities / print functions from Amphisbaena
#define MAX_HOPPERS 200 //number of hoppers simultaneously ToF'ing
#define R_MAX 2 //radius of sphere in which potential hops are considered
#define BIAS 0.1 //potential per site i.e. V/nm
#define RATE 1000000
#define LAMBDA 0.5 //lattice reorganisation energy
#define K_BOLTZMANN 8.6173857e-5 //in units of eV
#define T 300.0 //in Kelvin
#define TOF_TIME 1000.0 //time at which to end ToF
#define TOFS 10 //number of ToF's to run to build up stable statistics
#define ntmax 150 //number of time bins
#define ntsample 12 //number of points to sample for moving window gradient calculation / kink detection
//must be an even number :)
int currentevents[ntmax];
static double IR_0=1.0/0.15; //inverse of natural length for hopping
//equiv. to 1/r0B in JN code
double THERMAL=1.0/(4*LAMBDA*K_BOLTZMANN*T);
double simtime=0.0; //current time of simulation
double timefac;
int current=0; //count of current flux
int escapes=0; //number hoppers escaped electrode
struct hopper
{
struct coord loc; //current location on lattice
double esc; //time of escape
struct coord dst; //destination of escape
int hops; //count number of hops
int id;
} hoppers [MAX_HOPPERS];
int compare_waits(a,b)
struct hopper *a,*b;
{
if ( a->esc < b->esc)
return(-1);
if(a->esc > b->esc)
return (1);
return (0);
}
print_waits()
{
int i;
for (i=0;i<MAX_HOPPERS;i++)
fprintf(stderr,"Hopper: %d EscTime: %f Loc: %d %d %d Dst: %d %d %d\n",hoppers[i].id,hoppers[i].esc,
hoppers[i].loc.x,hoppers[i].loc.y,hoppers[i].loc.z,
hoppers[i].dst.x,hoppers[i].dst.y,hoppers[i].dst.z);
}
gorgophone()
{
struct hopper temp;
int i,tof_count=0,nt,sims;
double oldgrad, grad;
double Sx,Sy,Sxx,Sxy;
int NS=0,kinkpassed=0;
double timebin;
fprintf(stderr,"\n\tEntering Gorgophone, Time of Flight simulator...\n");
printf("#Hoppers: %d\n#R_Max: %d\n#Bias: %f\n#Lambda: %f\n#T: %f\n#TOF_TIME: %f\n#TOFS: %d\n#IR_0: %f\n#Bins: %d\n",
MAX_HOPPERS,R_MAX,BIAS, LAMBDA, T,
TOF_TIME, (1.0/IR_0), TOFS,ntmax);
timefac=pow((TOF_TIME),1.0/ntmax);
// empty_occtime();
for (sims=0;sims<TOFS;sims++)
{
tof_count=0; simtime=0.0; current=0; escapes=0;
fprintf(stderr,"Doing ToF simulation %d of %d\n",sims+1,TOFS);
empty_perc();
fprintf(stderr,"Perc lattice emptied...\n");
expose_lattice(); //expose lattice to light, generating charge carriers
fprintf(stderr,"Lattice Exposed to light, hoppers generated...\n");
print_waits();
qsort(hoppers,MAX_HOPPERS,sizeof(struct hopper),compare_waits);
fprintf(stderr,"Sorted:\n");
print_waits();
// print_lattice();
while (simtime<TOF_TIME)
{
hop(0); //hop the first hopper
look_around_you(0); //allow it to reset its wait time
if (hoppers[0].loc.z==0) //if we've reached the exit electrode
{
perc[hoppers[0].loc.x][hoppers[0].loc.y][hoppers[0].loc.z]--; //remove hopper from old loc
// occtime[hoppers[0].loc.x][hoppers[0].loc.y][hoppers[0].loc.z]=-1.0; //set occtime for escaped carrier
hoppers[0].loc.z=-1; //place off board
hoppers[0].esc=10e10; //really big (equiv. infinite) escape time
escapes++;
fprintf(stderr,"Carrier Escape at time %f Current: %d randomwalks: %d\n",simtime,current,tof_count);
// nt=(int)((float)ntmax*(simtime/TOF_TIME));
// if (nt<0) nt=0;
// currentevents[nt]++;
// printf("Transient: logJ %f logt %f\n",log((float)escapes),log(simtime));
}
i=0;
while (hoppers[i].esc>hoppers[++i].esc && i<MAX_HOPPERS) //this is a rather dirty bubblesort to
//insert the hopper at correct loc in queue
{
// fprintf(stderr,"Bubble: %d ",i);
temp= hoppers[i-1]; //this should be done with pointers... very inefficient currently.
hoppers[i-1]= hoppers[i];
hoppers[i]=temp;
}
// printf("Stay at %d\n",i);
// print_waits();
// print_lattice();
if (hoppers[0].esc>10e9) //all hoppers escaped
break;
tof_count++; //count number of CTRW's
if (tof_count%10000==0)
// printf(".\n");
{
// generate_df3(tof_count/10000);
// empty_occtime();
fprintf(stderr,"current: %d simtime: %f hops: %d\n",current,simtime,tof_count);
// print_lattice();
}
}
fprintf(stderr,"\n");
}
// print_lattice();
// print_waits();
for (i=0;i<ntmax;i++)
{
if (nt>0) timebin=pow(timefac,i)-pow(timefac,i-1);
else timebin=pow(timefac,i);
printf("Bin: %f Current: %f\n",
pow(timefac,i+0.5)
,(float)currentevents[i]/timebin);
}
//kink detection code copied+pasted from JN
for (nt=ntsample/2;nt<=ntmax-ntsample/2;nt++)
{
Sx=0;Sy=0;Sxx=0;Sxy=0;NS=0;
for (i=nt-ntsample/2;i<nt+ntsample/2;i++)
{
if (currentevents[i]>0.0)
{
NS++;
Sx+=log(i*(TOF_TIME/ntmax));
Sy+=log(currentevents[i]);
Sxx+=log(i*(TOF_TIME/ntmax))*log(i*(TOF_TIME/ntmax));
Sxy+=log(i*(TOF_TIME/ntmax))*log(currentevents[i]);
}
}
oldgrad=grad;
grad=(NS*Sxy-Sx*Sy)/(NS*Sxx-Sx*Sx);
// if (printallfiles) mobfile <<t[nt]<<'\t'<<grad<<endl;
if (oldgrad>-1&&grad<=-1&&NS==ntsample&&kinkpassed==0)
{
// tkink = (nt-1)*(TOF_TIME/ntmax)+(i*(TOF_TIME/ntmax))*(oldgrad+1)/(oldgrad-grad);
printf("Kink at: %f with grad: %f\n",(nt-1)*(TOF_TIME/ntmax)+(i*(TOF_TIME/ntmax))*(oldgrad+1)/(oldgrad-grad),grad);
// cout <<"kink at:"<<'\n'<<tkink<<"next pt:"<<t[nt]<<'\t'<<grad<<endl;
kinkpassed=1;
}
}
// print_occtime_pnm();
// fprintf(stderr,"\nGenerating snakes.df3 povray density file...");
// generate_df3(tof_count);
fprintf(stderr,"\n\tExit Gorgophone (Time of Flight simulator). %d random walk moves.\n",tof_count);
}
int hop (int hopper)
{
int nt;
current+=(hoppers[hopper].loc.z-hoppers[hopper].dst.z); //change current according to hop
perc[hoppers[hopper].loc.x][hoppers[hopper].loc.y][hoppers[hopper].loc.z]--; //move hopper from old loc
// perc[hoppers[hopper].dst.x][hoppers[hopper].dst.y][hoppers[hopper].dst.z]++; //into destination
//fill in suitable timebin with current fluctuation
//nt=(int)((float)ntmax*(simtime/TOF_TIME)); //arithmetic bins
nt=(int)(log(simtime)/log(timefac));
// fprintf(stderr,"Simtime: %f\tnt: %d\n",simtime,nt);
if (nt<0) nt=0;
currentevents[nt]+=hoppers[hopper].loc.z-hoppers[hopper].dst.z;
// occtime[hoppers[hopper].loc.x][hoppers[hopper].loc.y][hoppers[hopper].loc.z]+=hoppers[hopper].esc-simtime; //count time occupied per lattice site
hoppers[hopper].loc.x=hoppers[hopper].dst.x; //location becomes destination
hoppers[hopper].loc.y=hoppers[hopper].dst.y;
hoppers[hopper].loc.z=hoppers[hopper].dst.z;
hoppers[hopper].hops++; //count number of hops of hopper
simtime=hoppers[hopper].esc; //update global simulation time to that of current hop
// printf("h");
}
empty_perc()
{
int x, y, z;
for (x = 0; x < X; x++) //reset percolation / electrification lattice
for (y = 0; y < Y; y++)
for (z = 0; z < Z; z++)
perc[x][y][z] = 0;
}
/*
empty_occtime()
{
int x, y, z;
for (x = 0; x < X; x++) //reset percolation / electrification lattice
for (y = 0; y < Y; y++)
for (z = 0; z < Z; z++)
occtime[x][y][z] = 0.0;
}
*/
expose_lattice()
{
int i,x,y,z;
for (i=0;i<MAX_HOPPERS;i++)
{
do
{
x=rand_int(X);
y=rand_int(Y);
z=Z-1-rand_int(Z/10); //even distribution of charge carriers in first 1/10th of material
}
while (lattice[x][y][z]<0); //while no carrier here already, and snake material present
fprintf(stderr,"Hooper located at: (x,y,z) %d %d %d\n",x,y,z);
perc[x][y][z]++; //put carrier on perc lattice
hoppers[i].loc.x=x; hoppers[i].loc.y=y; hoppers[i].loc.z=z; //let hopper know its location
hoppers[i].id=i; //identifiy hopper for tracking purposes
hoppers[i].hops=0; //set hop count to zero
look_around_you(i); //have the hopper choose its destiny
}
}
look_around_you(int hopper)
{
int x,y,z,dx,dy,dz,dE,i,j;
double totalrate=0.0,rate[2*2*2*R_MAX*R_MAX*R_MAX],chosen_rate,subtotal;
struct coord deltas[2*2*2*R_MAX*R_MAX*R_MAX];
i=0;
x=hoppers[hopper].loc.x; y=hoppers[hopper].loc.y; z=hoppers[hopper].loc.z;
for (dx=-R_MAX;dx<=R_MAX;dx++) //this will be faster with a precomputed table of variables?
for (dy=-R_MAX;dy<=R_MAX;dy++)
for (dz=-R_MAX;dz<=R_MAX;dz++)
{
// fprintf(stderr,"\n%d %d %d ",dx,dy,dz);
if ( ((dx*dx)+(dy*dy)+(dz*dz)) > R_MAX*R_MAX)
continue; //if outside our bounding sphere, skip on...
if ( (x+dx)>=X || (x+dx)<0 ||
(y+dy)>=Y || (y+dy)<0 ||
(z+dz)>=Z || (z+dz)<0 )
continue; //attempting to step outside lattice...
if (dx==0 && dy==0 && dz==0)
continue; //no self hopping
if (lattice[x+dx][y+dy][z+dz]<0) //not snake material...
continue;
// fprintf(stderr,"Calculating hop to: (x,y,z) %d %d %d (dx,dy,dz) %d %d %d\n",x+dx,y+dy,z+dz,dx,dy,dz);
dE=-LAMBDA-dz*BIAS; //energy required to move
rate[i]=RATE*exp( - (dE*dE*THERMAL) )*exp( - (sqrt((float)((dx*dx)+(dy*dy)+(dz*dz)))*IR_0) );
totalrate+=rate[i];
deltas[i].x=x+dx; deltas[i].y=y+dy; deltas[i].z=z+dz;
// fprintf(stderr,"Rate: %f\tTotalRate: %f\n",rate[i],totalrate);
i++;
}
chosen_rate=totalrate*rand_float(); //choose which step to take
subtotal=0.0; i=0;
while (subtotal<=chosen_rate)
subtotal+=rate[i++];
i--;
hoppers[hopper].dst.x=deltas[i].x;
hoppers[hopper].dst.y=deltas[i].y;
hoppers[hopper].dst.z=deltas[i].z;
perc[x][y][z]++; //ghost in the machine placed on lattice; intended dest
// fprintf(stderr,"Hopper: %d Hopper_id: %d Choosen option %d, dst: %d %d %d\n",hopper,hoppers[hopper].id,i,deltas[i].x,deltas[i].y,deltas[i].z);
hoppers[hopper].esc=simtime-log(rand_float())/totalrate; //let hopper know when to escape...
// fprintf(stderr,"Simtime: %f Escape Time: %f\n",simtime,hoppers[hopper].esc);
}
/*
print_occtime_pnm ()
{
double max=0;
int x=0, y=0, z = 0;
int maxpix=255*255;
for (z = 0; z < Z; z++)
for (y = 0; y < Y; y++)
if (log(1.0+occtime[x][y][z])>max) max=log(1.0+occtime[x][y][z]);
printf ("P3\n%d %d\n%d\n", Z, Y, maxpix);
for (z = 0; z < Z; z++)
{
for (y = 0; y < Y; y++)
{
if (lattice[x][y][z] == -1)
printf ("%d %d %d\t",0,0,maxpix);
else
//printf("o");
printf ("%d %d %d\t", (int)(maxpix*(log(1.0+occtime[x][y][z])/max)),0,0);
}
printf ("\n");
}
printf ("\n\n");
}
*/