Commit dd439aa9 authored by Renaud Pacalet's avatar Renaud Pacalet
Browse files

stats upgrade

parent e2e231b4
......@@ -30,10 +30,10 @@ int main(void) {
};
char *names[] = {
"802.11n M=12/Z=27", "802.11n M=12/Z=54", "802.11n M=12/Z=81",
"802.11n M=23/Z=27", "802.11n M=23/Z=54", "802.11n M=23/Z=81",
"802.11n M=34/Z=27", "802.11n M=34/Z=54", "802.11n M=34/Z=81",
"802.11n M=56/Z=27", "802.11n M=56/Z=54", "802.11n M=56/Z=81",
"802.11n R=1/2, Z=27", "802.11n R=1/2, Z=54", "802.11n R=1/2, Z=81",
"802.11n R=2/3, Z=27", "802.11n R=2/3, Z=54", "802.11n R=2/3, Z=81",
"802.11n R=3/4, Z=27", "802.11n R=3/4, Z=54", "802.11n R=3/4, Z=81",
"802.11n R=5/6, Z=27", "802.11n R=5/6, Z=54", "802.11n R=5/6, Z=81",
"3GPP NR BG1", "3GPP NR BG2"
};
......@@ -43,6 +43,28 @@ int main(void) {
for(r = 0; r < rows[n]; r++) {
printf("%3d", r);
}
printf("\n%14s", "ORTHOGONAL:");
for(r = 0; r < rows[n]; r++) {
int o = 1;
for(c = 0; c < cols[n]; c++) {
if(n < 12) {
if(r > 0 && mats[n][r * cols[n] + c] >= 0 && mats[n][(r - 1) * cols[n] + c] >= 0) {
o = 0;
}
}
else {
if(r > 0 && mats[n][r * cols[n] + c] > 0 && mats[n][(r - 1) * cols[n] + c] > 0) {
o = 0;
}
}
}
if(r > 0 && o) {
printf("%3s", "X");
}
else {
printf("%3s", "");
}
}
printf("\n%14s", "DEGREE:");
for(r = 0; r < rows[n]; r++) {
int d = 0;
......@@ -59,7 +81,7 @@ int main(void) {
max = r == 0 ? d : (d > max ? d : max);
printf("%3d", d);
}
printf("\n%15s%2d/%2d/%3d\n\n", "MIN/MAX/TOTAL: ", min, max, t);
printf("\n%15s%d/%d/%d\n\n", "MIN/MAX/TOTAL: ", min, max, t);
}
return 0;
}
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment