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

got rid of some modulo operations

Browse source
This commit is contained in:
Ahmet Inan 2018-12-15 17:09:03 +01:00
commit 86bf81dd2d
1 changed files with 21 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

30
ldpc_decoder.hh
View file

@ -101,9 +101,13 @@ class LDPCDecoder
for (int n = 0; n < num; ++n) for (int n = 0; n < num; ++n)
par[1].v[n] = parity[M*i+j+n]; par[1].v[n] = parity[M*i+j+n];
TYPE dat[cnt]; TYPE dat[cnt];
for (int c = 0; c < cnt; ++c) for (int c = 0; c < cnt; ++c) {
for (int n = 0; n < num; ++n) int tmp = std::min(num, M - shift[c]);
dat[c].v[n] = data[offset[c]+(shift[c]+n)%M]; for (int n = 0; n < tmp; ++n)
dat[c].v[n] = data[offset[c]+shift[c]+n];
for (int n = tmp; n < num; ++n)
dat[c].v[n] = data[offset[c]+n-tmp];
}
TYPE cnv = vdup<TYPE>(1); TYPE cnv = vdup<TYPE>(1);
for (int c = 0; c < 2; ++c) for (int c = 0; c < 2; ++c)
cnv = vsign(cnv, par[c]); cnv = vsign(cnv, par[c]);
@ -149,9 +153,13 @@ class LDPCDecoder
for (int n = 0; n < num; ++n) for (int n = 0; n < num; ++n)
par[1].v[n] = parity[M*i+j+n]; par[1].v[n] = parity[M*i+j+n];
TYPE dat[cnt]; TYPE dat[cnt];
for (int c = 0; c < cnt; ++c) for (int c = 0; c < cnt; ++c) {
for (int n = 0; n < num; ++n) int tmp = std::min(num, M - shift[c]);
dat[c].v[n] = data[offset[c]+(shift[c]+n)%M]; for (int n = 0; n < tmp; ++n)
dat[c].v[n] = data[offset[c]+shift[c]+n];
for (int n = tmp; n < num; ++n)
dat[c].v[n] = data[offset[c]+n-tmp];
}
TYPE inp[deg], out[deg]; TYPE inp[deg], out[deg];
for (int c = 0; c < cnt; ++c) for (int c = 0; c < cnt; ++c)
inp[c] = out[c] = vqsub(dat[c], bl[c]); inp[c] = out[c] = vqsub(dat[c], bl[c]);
@ -176,9 +184,13 @@ class LDPCDecoder
} }
for (int n = 0; n < num; ++n) for (int n = 0; n < num; ++n)
parity[M*i+j+n] = par[1].v[n]; parity[M*i+j+n] = par[1].v[n];
for (int c = 0; c < cnt; ++c) for (int c = 0; c < cnt; ++c) {
for (int n = 0; n < num; ++n) int tmp = std::min(num, M - shift[c]);
data[offset[c]+(shift[c]+n)%M] = dat[c].v[n]; for (int n = 0; n < tmp; ++n)
data[offset[c]+shift[c]+n] = dat[c].v[n];
for (int n = tmp; n < num; ++n)
data[offset[c]+n-tmp] = dat[c].v[n];
}
for (int c = 0; c < cnt; ++c) for (int c = 0; c < cnt; ++c)
shift[c] = (shift[c] + num) % M; shift[c] = (shift[c] + num) % M;
} }