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

flattened first parity handling

Browse source
This commit is contained in:
Ahmet Inan 2018-12-15 10:26:28 +01:00
commit ce9674883c
1 changed files with 17 additions and 23 deletions
Download patch file Download diff file Expand all files Collapse all files

40
ldpc_decoder.hh
View file

@ -85,15 +85,13 @@ class LDPCDecoder
if (i) {
for (int n = 0; n < num; ++n)
par[0].v[n] = parity[M*(i-1)+j+n];
} else if (j) {
for (int n = 0; n < num; ++n)
par[0].v[n] = parity[M*(q-1)-1+j+n];
} else {
if (j) {
for (int n = 0; n < num; ++n)
par[0].v[n] = parity[j+(q-1)*M-1+n];
} else {
par[0].v[0] = 127;
for (int n = 1; n < num; ++n)
par[0].v[n] = parity[j+(q-1)*M-1+n];
}
par[0].v[0] = 127;
for (int n = 1; n < num; ++n)
par[0].v[n] = parity[M*(q-1)-1+j+n];
}
for (int n = 0; n < num; ++n)
par[1].v[n] = parity[M*i+j+n];
@ -128,15 +126,13 @@ class LDPCDecoder
if (i) {
for (int n = 0; n < num; ++n)
par[0].v[n] = parity[M*(i-1)+j+n];
} else if (j) {
for (int n = 0; n < num; ++n)
par[0].v[n] = parity[M*(q-1)-1+j+n];
} else {
if (j) {
for (int n = 0; n < num; ++n)
par[0].v[n] = parity[j+(q-1)*M-1+n];
} else {
par[0].v[0] = 127;
for (int n = 1; n < num; ++n)
par[0].v[n] = parity[j+(q-1)*M-1+n];
}
par[0].v[0] = 127;
for (int n = 1; n < num; ++n)
par[0].v[n] = parity[M*(q-1)-1+j+n];
}
for (int n = 0; n < num; ++n)
par[1].v[n] = parity[M*i+j+n];
@ -159,14 +155,12 @@ class LDPCDecoder
if (i) {
for (int n = 0; n < num; ++n)
parity[M*(i-1)+j+n] = par[0].v[n];
} else if (j) {
for (int n = 0; n < num; ++n)
parity[M*(q-1)-1+j+n] = par[0].v[n];
} else {
if (j) {
for (int n = 0; n < num; ++n)
parity[j+(q-1)*M-1+n] = par[0].v[n];
} else {
for (int n = 1; n < num; ++n)
parity[j+(q-1)*M-1+n] = par[0].v[n];
}
for (int n = 1; n < num; ++n)
parity[M*(q-1)-1+j+n] = par[0].v[n];
}
for (int n = 0; n < num; ++n)
parity[M*i+j+n] = par[1].v[n];