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 for more than T errors

Browse source
This commit is contained in:
Ahmet Inan 2020-07-08 11:15:29 +02:00
commit af5160efd3
1 changed files with 7 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

9
short_bch_code_decoder.hh
View file

@ -29,6 +29,8 @@ class ShortBCHCodeDecoder
}
static int metric(const int8_t *soft, int hard)
{
if (hard < 0)
return -1;
int lol = 8 * sizeof(hard) - 1;
int sum = 0;
for (int i = 0; i < N; ++i)
@ -40,6 +42,8 @@ public:
{
for (int i = 0; i < W; ++i)
par[i] = modgen(i << P);
for (int i = 0; i < R; ++i)
err[i] = -1;
err[0] = 0;
for (int a = 1<<(N-1); T >= 1 && a; a >>= 1) {
err[modgen(a)] = a;
@ -53,7 +57,8 @@ public:
}
int operator()(int inp)
{
return inp ^ err[(par[inp>>P] ^ inp) & (R-1)];
int tmp = err[(par[inp>>P] ^ inp) & (R-1)];
return tmp >= 0 ? inp ^ tmp : -1;
}
int operator()(const int8_t *code)
{
@ -66,7 +71,7 @@ public:
return word;
// metric of hard decision
int best = metric(code, word);
int next = -1;
int next = -2;
auto update = [code, &word, &best, &next](int hard) {
if (hard == word)
return;