Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 22:35:44 +00:00
Code Issues Projects Releases Packages Wiki Activity

return -1 if unsure

Browse source
This commit is contained in:
Ahmet Inan 2020-06-09 14:36:19 +02:00
commit 809ab3690b
2 changed files with 17 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

16
short_bch_code_decoder.hh
View file

@ -62,15 +62,20 @@ public:
{
// maximum likelihood
if (0) {
int word = 0, best = 0;
int word = 0, best = -1, next = -1;
for (int msg = 0; msg < W; ++msg) {
int enc = (msg << P) | par[msg];
int met = metric(code, enc);
if (met > best) {
next = best;
best = met;
word = enc;
} else if (met > next) {
next = met;
}
}
if (best == next)
return -1;
return word;
}
int cw = 0;
@ -82,6 +87,7 @@ public:
return word;
// metric of hard decision
int best = metric(code, word);
int next = -1;
// flip each bit and see ..
if (0) {
for (int j = 0; j < N; ++j) {
@ -89,8 +95,11 @@ public:
int dec = (*this)(cw ^ tmp);
int met = metric(code, dec);
if (met > best) {
next = best;
best = met;
word = dec;
} else if (word != dec && met > next) {
next = met;
}
}
}
@ -122,11 +131,16 @@ public:
int dec = (*this)(cw ^ tmp);
int met = metric(code, dec);
if (met > best) {
next = best;
best = met;
word = dec;
} else if (word != dec && met > next) {
next = met;
}
}
}
if (best == next)
return -1;
return word;
}
};

4
tests/soft_bch_regression_test.cc
View file

@ -91,8 +91,8 @@ int main()
awgn_errors += noisy[i] * orig[i] < 0;
for (int i = 0; i < CODE_LEN; ++i)
quantization_erasures += !noisy[i];
uncorrected_errors += popcnt(enc^dec);
for (int i = 0; i < CODE_LEN; ++i)
uncorrected_errors += dec < 0 ? CODE_LEN : popcnt(enc^dec);
for (int i = 0; dec >= 0 && i < CODE_LEN; ++i)
decoder_errors += ((enc^dec)&(1<<i)) && orig[i] * noisy[i] > 0;
}
float bit_error_rate = (float)uncorrected_errors / (float)(CODE_LEN * LOOPS);