-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathca-prng.cpp
165 lines (147 loc) · 5.62 KB
/
ca-prng.cpp
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
#include <bits/stdc++.h>
using namespace std;
int main() {
int i,j,n,p,w;
char *x;
char *x_old;
cout<<"Pseudo Random Number Generator\n\n";
cout<<"Enter window length w\n";
cin>>w;
// n is the total CA length decided by the window length given by user
if(int(ceil(2.5*w))%2==0) {
n=int(ceil(2.5*w)+1);
}
else if(int(ceil(2.5*w))%2!=0) {
n=int(ceil(2.5*w));
}
x = new char[n+2];
cout<<"Enter seed string of length w separated by spaces\n";
for(int i=0; i<w; i++) {
cin>>x[i];
}
// p is the no of cycles undertaken depending on the number of random numbers the user wants
cout<<"How many random numbers do I generate?\n";
cin>>p;
p=(n-w+p);
x_old = new char[n+2];
for(i=w; i<n-1; i++) {
x[i] = '0';
}
x[n-1] = '1';
// only to show the initial CA configuration
cout<<"Initial configuration of CA\n";
for(i=0; i<n; i++) {
cout<< x[i];
}
cout<<"\n\n\The random numbers generated are:\n";
for(j=0; j<(n); j++) {
for(i=0; i<n+2; i++) {
x_old[i] = x[i];
}
// Implementing Rule R from 1 to n-w cycles
for(i=1; i<=n; i++) {
if( (x_old[i-1] == '2' && x_old[i] == '2' && x_old[i+1] == '0') ||
(x_old[i-1] == '2' && x_old[i] == '1' && x_old[i+1] == '2') ||
(x_old[i-1] == '2' && x_old[i] == '0' && x_old[i+1] == '0') ||
(x_old[i-1] == '1' && x_old[i] == '2' && x_old[i+1] == '2') ||
(x_old[i-1] == '1' && x_old[i] == '1' && x_old[i+1] == '2') ||
(x_old[i-1] == '1' && x_old[i] == '0' && x_old[i+1] == '0') ||
(x_old[i-1] == '0' && x_old[i] == '2' && x_old[i+1] == '2') ||
(x_old[i-1] == '0' && x_old[i] == '1' && x_old[i+1] == '2') ||
(x_old[i-1] == '0' && x_old[i] == '0' && x_old[i+1] == '0'))
{
x[i] = '0';
}
else if( (x_old[i-1] == '0' && x_old[i] == '0' && x_old[i+1] == '1') ||
(x_old[i-1] == '2' && x_old[i] == '2' && x_old[i+1] == '2') ||
(x_old[i-1] == '2' && x_old[i] == '1' && x_old[i+1] == '0') ||
(x_old[i-1] == '2' && x_old[i] == '0' && x_old[i+1] == '2') ||
(x_old[i-1] == '1' && x_old[i] == '2' && x_old[i+1] == '0') ||
(x_old[i-1] == '1' && x_old[i] == '1' && x_old[i+1] == '0') ||
(x_old[i-1] == '1' && x_old[i] == '0' && x_old[i+1] == '2') ||
(x_old[i-1] == '0' && x_old[i] == '2' && x_old[i+1] == '0') ||
(x_old[i-1] == '0' && x_old[i] == '1' && x_old[i+1] == '0'))
{
x[i] = '1';
}
else if( (x_old[i-1] == '2' && x_old[i] == '2' && x_old[i+1] == '1') ||
(x_old[i-1] == '2' && x_old[i] == '1' && x_old[i+1] == '1') ||
(x_old[i-1] == '2' && x_old[i] == '0' && x_old[i+1] == '1') ||
(x_old[i-1] == '1' && x_old[i] == '2' && x_old[i+1] == '1') ||
(x_old[i-1] == '1' && x_old[i] == '1' && x_old[i+1] == '1') ||
(x_old[i-1] == '1' && x_old[i] == '0' && x_old[i+1] == '1') ||
(x_old[i-1] == '0' && x_old[i] == '2' && x_old[i+1] == '1') ||
(x_old[i-1] == '0' && x_old[i] == '1' && x_old[i+1] == '1') ||
(x_old[i-1] == '0' && x_old[i] == '0' && x_old[i+1] == '2'))
{
x[i] = '2';
}
}
x[0] = x[n];
x[n+1] = x[1];
// for(i=1; i<=n; i++) {
// cout<<x[i];
// }
// cout<<"\n";
}
for(j=(n-w); j<p; j++) {
for(i=0; i<n+2; i++) {
x_old[i] = x[i];
}
// Implementing Rule R from n-w to p cycles
for(i=0; i<n; i++) {
if( (x_old[i-1] == '2' && x_old[i] == '2' && x_old[i+1] == '0') ||
(x_old[i-1] == '2' && x_old[i] == '1' && x_old[i+1] == '2') ||
(x_old[i-1] == '2' && x_old[i] == '0' && x_old[i+1] == '0') ||
(x_old[i-1] == '1' && x_old[i] == '2' && x_old[i+1] == '2') ||
(x_old[i-1] == '1' && x_old[i] == '1' && x_old[i+1] == '2') ||
(x_old[i-1] == '1' && x_old[i] == '0' && x_old[i+1] == '0') ||
(x_old[i-1] == '0' && x_old[i] == '2' && x_old[i+1] == '2') ||
(x_old[i-1] == '0' && x_old[i] == '1' && x_old[i+1] == '2') ||
(x_old[i-1] == '0' && x_old[i] == '0' && x_old[i+1] == '0'))
{
x[i] = '0';
}
else if( (x_old[i-1] == '0' && x_old[i] == '0' && x_old[i+1] == '1') ||
(x_old[i-1] == '2' && x_old[i] == '2' && x_old[i+1] == '2') ||
(x_old[i-1] == '2' && x_old[i] == '1' && x_old[i+1] == '0') ||
(x_old[i-1] == '2' && x_old[i] == '0' && x_old[i+1] == '2') ||
(x_old[i-1] == '1' && x_old[i] == '2' && x_old[i+1] == '0') ||
(x_old[i-1] == '1' && x_old[i] == '1' && x_old[i+1] == '0') ||
(x_old[i-1] == '1' && x_old[i] == '0' && x_old[i+1] == '2') ||
(x_old[i-1] == '0' && x_old[i] == '2' && x_old[i+1] == '0') ||
(x_old[i-1] == '0' && x_old[i] == '1' && x_old[i+1] == '0'))
{
x[i] = '1';
}
else if( (x_old[i-1] == '2' && x_old[i] == '2' && x_old[i+1] == '1') ||
(x_old[i-1] == '2' && x_old[i] == '1' && x_old[i+1] == '1') ||
(x_old[i-1] == '2' && x_old[i] == '0' && x_old[i+1] == '1') ||
(x_old[i-1] == '1' && x_old[i] == '2' && x_old[i+1] == '1') ||
(x_old[i-1] == '1' && x_old[i] == '1' && x_old[i+1] == '1') ||
(x_old[i-1] == '1' && x_old[i] == '0' && x_old[i+1] == '1') ||
(x_old[i-1] == '0' && x_old[i] == '2' && x_old[i+1] == '1') ||
(x_old[i-1] == '0' && x_old[i] == '1' && x_old[i+1] == '1') ||
(x_old[i-1] == '0' && x_old[i] == '0' && x_old[i+1] == '2'))
{
x[i] = '2';
}
}
// periodic boundary condition
x[0] = x[n];
x[n+1] = x[1];
for(i=1; i<n; i++) {
cout<<(int(x[i])-48);
}
cout<<"\n";
// ternary to decimal number
long double a=0;
for(i=1; i<n; i++) {
a += ((int(x[i])-48) * pow(3, (n-1-i)));
}
cout<<"Decimal: "<<a<<"\n";
}
delete [] x;
delete [] x_old;
cout<<"\nend";
}