Compare commits

...

14 commits

Author SHA1 Message Date
Ahmet Inan
59b10af835 initialize write disable flags on first iteration 2019-11-16 10:59:19 +01:00
Ahmet Inan
97dd7e2226 initialize bit node links on first iteration 2019-11-16 09:17:35 +01:00
Ahmet Inan
19a18d52e7 better keep RW wd separate from RO loc 2019-11-16 00:43:48 +01:00
Ahmet Inan
4054363b2e moved write disable bit into Loc struct 2019-11-15 22:49:57 +01:00
Ahmet Inan
5ab424e024 output write disable mask in binary form 2019-11-12 11:32:30 +01:00
Ahmet Inan
da9d47b95d don't forget the last bit, even though last two are parity vectors 2019-11-06 21:04:55 +01:00
Ahmet Inan
3b5a4088fc create write disable mask for next visit on the fly 2019-11-06 17:43:12 +01:00
Ahmet Inan
1eef4c3df5 detect special parity word using offset and shift 2019-11-05 09:59:55 +01:00
Ahmet Inan
b6313b9087 added code to print offset and shift tables 2019-11-05 09:44:37 +01:00
Ahmet Inan
79ddb18876 simplified by removing loop over blocks 2019-11-05 09:05:57 +01:00
Ahmet Inan
838c02ae9f merged bad() into update() 2019-10-03 22:14:05 +02:00
Ahmet Inan
422b405596 simplified by merging pty and msg arrays into var
while using location array for parity as well
2019-10-03 20:53:49 +02:00
Ahmet Inan
87153003e9 instead of rotating back, store current shift value
and compute the delta shift needed to achieve the same result.

Idea taken from:

Conflict Resolution by Matrix Reordering for DVB-T2 LDPC Decoders
By Cédric Marchand, Jean-Baptiste Doré, Laura Conde-Canencia, Emmanuel Boutillon - 2009
2019-10-03 18:23:14 +02:00
Ahmet Inan
1f4da1bed3 only need write disable masks for write conflicts 2019-10-03 17:44:26 +02:00

View file

@ -36,22 +36,21 @@ class LDPCDecoder
static const int W = M/D; static const int W = M/D;
static const int PTY = R/D; static const int PTY = R/D;
static const int MSG = K/D; static const int MSG = K/D;
static const int VAR = N/D;
static const int CNC = TABLE::LINKS_MAX_CN - 2; static const int CNC = TABLE::LINKS_MAX_CN - 2;
static const int BNL = (TABLE::LINKS_TOTAL + D-1) / D; static const int BNL = (TABLE::LINKS_TOTAL + 1) / D;
static const int LOC = (TABLE::LINKS_TOTAL - (2*R-1) + D-1) / D;
typedef SIMD<int8_t, SIMD_SIZE> TYPE; typedef SIMD<int8_t, SIMD_SIZE> TYPE;
typedef struct { uint16_t off; uint16_t shi; } Loc; typedef struct { uint16_t off; uint16_t shi; } Loc;
typedef uint32_t wd_t;
static_assert(sizeof(wd_t) * 8 >= CNC, "write disable mask needs at least as many bits as max check node links");
Rotate<TYPE, D> rotate; Rotate<TYPE, D> rotate;
TYPE bnl[BNL]; TYPE bnl[BNL];
TYPE msg[MSG]; TYPE var[VAR];
TYPE pty[PTY]; Loc loc[BNL];
Loc loc[LOC]; bool wds[BNL];
wd_t wd[PTY]; int16_t csh[VAR];
uint8_t cnc[q]; uint8_t cnt[PTY];
bool start;
static TYPE eor(TYPE a, TYPE b) static TYPE eor(TYPE a, TYPE b)
{ {
@ -74,150 +73,117 @@ class LDPCDecoder
return vreinterpret<TYPE>(vand(vmask(b), vorr(vceqz(a), veor(vcgtz(a), vcltz(b))))); return vreinterpret<TYPE>(vand(vmask(b), vorr(vceqz(a), veor(vcgtz(a), vcltz(b)))));
} }
bool bad() bool update()
{
Loc *lo = loc;
for (int i = 0; i < q; ++i) {
int cnt = cnc[i];
int deg = cnt + 2;
auto res = vmask(vzero<TYPE>());
for (int j = 0; j < W; ++j) {
TYPE cnv = vdup<TYPE>(1);
for (int k = 0; k < deg; ++k) {
TYPE tmp;
if (k < cnt) {
tmp = rotate(msg[lo[k].off], -lo[k].shi);
} else if (k == cnt) {
tmp = pty[W*i+j];
} else {
if (i) {
tmp = pty[W*(i-1)+j];
} else if (j) {
tmp = pty[W*(q-1)+j-1];
} else {
tmp = rotate(pty[PTY-1], 1);
tmp.v[0] = 127;
}
}
cnv = vsign(cnv, tmp);
}
res = vorr(res, vclez(cnv));
lo += cnt;
}
for (int n = 0; n < D; ++n)
if (res.v[n])
return true;
}
return false;
}
void update()
{ {
TYPE *bl = bnl; TYPE *bl = bnl;
Loc *lo = loc; Loc *lo = loc;
for (int i = 0; i < q; ++i) { bool *wd = wds;
int cnt = cnc[i]; auto bad = vmask(vzero<TYPE>());
int deg = cnt + 2; for (int i = 0; i < PTY; ++i) {
for (int j = 0; j < W; ++j) { int deg = cnt[i];
TYPE mags[deg], inps[deg]; TYPE mags[deg], inps[deg];
TYPE min0 = vdup<TYPE>(127); TYPE min0 = vdup<TYPE>(127);
TYPE min1 = vdup<TYPE>(127); TYPE min1 = vdup<TYPE>(127);
TYPE signs = vdup<TYPE>(127); TYPE signs = vdup<TYPE>(127);
TYPE cnv = vdup<TYPE>(127);
bool first_wd;
int last_offset = 0;
int8_t prev_val = 0;
for (int k = 0; k < deg; ++k) { for (int k = 0; k < deg; ++k) {
TYPE tmp; int offset = lo[k].off;
if (k < cnt) { int shift = lo[k].shi;
tmp = rotate(msg[lo[k].off], -lo[k].shi); int dshift = (shift - csh[offset]) % D;
} else if (k == cnt) { TYPE tmp = rotate(var[offset], dshift);
tmp = pty[W*i+j]; if (offset == VAR-1 && shift == 1) {
} else { prev_val = tmp.v[0];
if (i) { tmp.v[0] = 127;
tmp = pty[W*(i-1)+j];
} else if (j) {
tmp = pty[W*(q-1)+j-1];
} else {
tmp = rotate(pty[PTY-1], 1);
tmp.v[0] = 127;
}
}
TYPE inp = vqsub(tmp, bl[k]);
TYPE mag = vqabs(inp);
if (BETA) {
auto beta = vunsigned(vdup<TYPE>(BETA));
mag = vsigned(vqsub(vunsigned(mag), beta));
}
min1 = vmin(min1, vmax(min0, mag));
min0 = vmin(min0, mag);
signs = eor(signs, inp);
inps[k] = inp;
mags[k] = mag;
} }
for (int k = 0; k < deg; ++k) {
TYPE mag = mags[k];
TYPE inp = inps[k];
TYPE out = vsign(other(mag, min0, min1), mine(signs, inp)); TYPE inp = vqsub(tmp, bl[k]);
if (start)
inp = tmp;
out = vclamp(out, -32, 31); TYPE mag = vqabs(inp);
if (BETA) {
auto beta = vunsigned(vdup<TYPE>(BETA));
mag = vsigned(vqsub(vunsigned(mag), beta));
}
min1 = vmin(min1, vmax(min0, mag));
min0 = vmin(min0, mag);
signs = eor(signs, inp);
inps[k] = inp;
mags[k] = mag;
}
for (int k = 0; k < deg; ++k) {
TYPE mag = mags[k];
TYPE inp = inps[k];
TYPE out = vsign(other(mag, min0, min1), mine(signs, inp));
out = vclamp(out, -32, 31);
if (!start)
out = selfcorr(bl[k], out); out = selfcorr(bl[k], out);
TYPE tmp = vqadd(inp, out); TYPE tmp = vqadd(inp, out);
if (k < cnt) { cnv = vsign(cnv, tmp);
if (!((wd[W*i+j]>>k)&1)) {
bl[k] = out; int offset = lo[k].off;
msg[lo[k].off] = rotate(tmp, lo[k].shi); int shift = lo[k].shi;
}
} else if (k == cnt) { if (offset == VAR-1 && shift == 1)
bl[k] = out; tmp.v[0] = prev_val;
pty[W*i+j] = tmp;
} else { bool this_wd = wd[k];
bl[k] = out; if (start) {
if (i) { if (k)
pty[W*(i-1)+j] = tmp; this_wd = offset == last_offset;
} else if (j) { else
pty[W*(q-1)+j-1] = tmp; this_wd = false;
} else {
tmp.v[0] = pty[PTY-1].v[D-1];
pty[PTY-1] = rotate(tmp, -1);
}
}
} }
if (wd[W*i+j]) { if (!this_wd) {
for (int first = 0, c = 1; c < cnt; ++c) { bl[k] = out;
if (lo[first].off != lo[c].off || c == cnt-1) { var[offset] = tmp;
int last = c - 1; csh[offset] = shift;
if (c == cnt-1) } else if (start) {
++last; bl[k] = vzero<TYPE>();
if (last != first) {
int count = last - first + 1;
wd_t mask = ((1 << count) - 1) << first;
wd_t cur = wd[W*i+j];
wd_t tmp = cur & mask;
wd_t ror = (tmp >> 1) | (tmp << (count-1));
wd[W*i+j] = (cur & ~mask) | (ror & mask);
}
first = c;
}
}
} }
lo += cnt; if (k) {
bl += deg; bool next_wd = this_wd;
if (last_offset != offset) {
next_wd = first_wd;
first_wd = this_wd;
}
wd[k-1] = next_wd;
} else {
first_wd = this_wd;
}
last_offset = offset;
} }
wd[deg-1] = first_wd;
bad = vorr(bad, vclez(cnv));
lo += deg;
bl += deg;
wd += deg;
} }
//assert(bl <= bnl + BNL); //assert(bl <= bnl + BNL);
//std::cerr << BNL - (bl - bnl) << std::endl; //std::cerr << BNL - (bl - bnl) << std::endl;
for (int n = 0; n < D; ++n)
if (bad.v[n])
return true;
return false;
} }
public: public:
LDPCDecoder() LDPCDecoder()
{ {
uint16_t pos[q * CNC]; uint16_t pos[q * CNC];
uint8_t cnc[q];
for (int i = 0; i < q; ++i) for (int i = 0; i < q; ++i)
cnc[i] = 0; cnc[i] = 0;
int bit_pos = 0; int bit_pos = 0;
@ -234,9 +200,13 @@ public:
bit_pos += M; bit_pos += M;
} }
} }
for (int i = 0; i < q; ++i)
for (int j = 0; j < W; ++j)
cnt[W*i+j] = cnc[i] + 2;
Loc *lo = loc; Loc *lo = loc;
for (int i = 0; i < q; ++i) { for (int i = 0; i < q; ++i) {
int cnt = cnc[i]; int cnt = cnc[i];
int deg = cnt + 2;
int offset[cnt], shift[cnt]; int offset[cnt], shift[cnt];
for (int c = 0; c < cnt; ++c) { for (int c = 0; c < cnt; ++c) {
shift[c] = pos[CNC*i+c] % M; shift[c] = pos[CNC*i+c] % M;
@ -245,42 +215,63 @@ public:
for (int j = 0; j < W; ++j) { for (int j = 0; j < W; ++j) {
for (int c = 0; c < cnt; ++c) { for (int c = 0; c < cnt; ++c) {
lo[c].off = offset[c] / D + shift[c] % W; lo[c].off = offset[c] / D + shift[c] % W;
lo[c].shi = shift[c] / W; lo[c].shi = (D - shift[c] / W) % D;
shift[c] = (shift[c] + 1) % M; shift[c] = (shift[c] + 1) % M;
} }
std::sort(lo, lo + cnt, [](const Loc &a, const Loc &b){ return a.off < b.off; }); if (i) {
wd[W*i+j] = 0; lo[cnt].off = MSG+W*(i-1)+j;
for (int c = 0; c < cnt-1; ++c) lo[cnt].shi = 0;
if (lo[c].off == lo[c+1].off) } else if (j) {
wd[W*i+j] |= 1 << c; lo[cnt].off = MSG+W*(q-1)+j-1;
lo += cnt; lo[cnt].shi = 0;
} else {
lo[cnt].off = VAR-1;
lo[cnt].shi = 1;
}
lo[cnt+1].off = MSG+W*i+j;
lo[cnt+1].shi = 0;
std::sort(lo, lo + deg, [](const Loc &a, const Loc &b){ return a.off < b.off; });
#if 0
std::cout << deg;
for (int d = 0; d < deg; ++d)
std::cout << '\t' << (int)lo[d].off << ':' << (int)lo[d].shi;
std::cout << std::endl;
#endif
lo += deg;
} }
} }
//assert(lo <= loc + LOC); //assert(lo <= loc + BNL);
//std::cerr << LOC - (lo - loc) << std::endl; //std::cerr << BNL - (lo - loc) << std::endl;
} }
int operator()(int8_t *message, int8_t *parity, int trials = 25) int operator()(int8_t *message, int8_t *parity, int trials = 25)
{ {
for (int i = 0; i < BNL; ++i) for (int i = 0; i < VAR; ++i)
bnl[i] = vzero<TYPE>(); csh[i] = 0;
for (int i = 0; i < K/M; ++i) for (int i = 0; i < K/M; ++i)
for (int j = 0; j < W; ++j) for (int j = 0; j < W; ++j)
for (int n = 0; n < D; ++n) for (int n = 0; n < D; ++n)
msg[W*i+j].v[n] = message[M*i+W*n+j]; var[W*i+j].v[n] = message[M*i+W*n+j];
for (int i = 0; i < q; ++i) for (int i = 0; i < q; ++i)
for (int j = 0; j < W; ++j) for (int j = 0; j < W; ++j)
for (int n = 0; n < D; ++n) for (int n = 0; n < D; ++n)
pty[W*i+j].v[n] = parity[q*(W*n+j)+i]; var[MSG+W*i+j].v[n] = parity[q*(W*n+j)+i];
while (bad() && --trials >= 0)
update(); start = true;
while (--trials >= 0 && update())
start = false;
for (int i = 0; i < VAR; ++i)
var[i] = rotate(var[i], -csh[i]);
for (int i = 0; i < K/M; ++i) for (int i = 0; i < K/M; ++i)
for (int j = 0; j < W; ++j) for (int j = 0; j < W; ++j)
for (int n = 0; n < D; ++n) for (int n = 0; n < D; ++n)
message[M*i+W*n+j] = msg[W*i+j].v[n]; message[M*i+W*n+j] = var[W*i+j].v[n];
for (int i = 0; i < q; ++i) for (int i = 0; i < q; ++i)
for (int j = 0; j < W; ++j) for (int j = 0; j < W; ++j)
for (int n = 0; n < D; ++n) for (int n = 0; n < D; ++n)
parity[q*(W*n+j)+i] = pty[W*i+j].v[n]; parity[q*(W*n+j)+i] = var[MSG+W*i+j].v[n];
return trials; return trials;
} }
}; };