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

added generic rate1()

Browse source
This commit is contained in:
Ahmet Inan 2021-07-17 16:16:26 +02:00
commit cdaca027dd
1 changed files with 32 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

32
polar_list_decoder.hh
View file

@ -31,6 +31,18 @@ struct PolarListNode
map.v[k] = k; map.v[k] = k;
return map; return map;
} }
static MAP rate1(PATH *metric, TYPE *message, MAP *maps, int *count, TYPE *hard, TYPE *soft)
{
for (int i = 0; i < N/2; ++i)
soft[i+N/2] = PH::prod(soft[i+N], soft[i+N/2+N]);
MAP lmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard, soft);
for (int i = 0; i < N/2; ++i)
soft[i+N/2] = PH::madd(hard[i], vshuf(soft[i+N], lmap), vshuf(soft[i+N/2+N], lmap));
MAP rmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard+N/2, soft);
for (int i = 0; i < N/2; ++i)
hard[i] = PH::qmul(vshuf(hard[i], rmap), hard[i+N/2]);
return vshuf(lmap, rmap);
}
static MAP rep(PATH *metric, TYPE *message, MAP *maps, int *count, TYPE *hard, TYPE *soft) static MAP rep(PATH *metric, TYPE *message, MAP *maps, int *count, TYPE *hard, TYPE *soft)
{ {
PATH fork[2*TYPE::SIZE]; PATH fork[2*TYPE::SIZE];
@ -149,6 +161,8 @@ struct PolarListTree<TYPE, 6>
lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft); lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft);
else if (frozen[0] == 0x7fffffff) else if (frozen[0] == 0x7fffffff)
lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft); lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft);
else if (frozen[0] == 0)
lmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard, soft);
else else
lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen[0]); lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen[0]);
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -157,6 +171,8 @@ struct PolarListTree<TYPE, 6>
rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft);
else if (frozen[1] == 0x7fffffff) else if (frozen[1] == 0x7fffffff)
rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft);
else if (frozen[1] == 0)
rmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard+N/2, soft);
else else
rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen[1]); rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen[1]);
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -182,6 +198,8 @@ struct PolarListTree<TYPE, 5>
lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft); lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1)) else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1))
lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft); lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == 0)
lmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard, soft);
else else
lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1)); lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -190,6 +208,8 @@ struct PolarListTree<TYPE, 5>
rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft);
else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1)) else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1))
rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft);
else if (frozen >> (N/2) == 0)
rmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard+N/2, soft);
else else
rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2)); rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -215,6 +235,8 @@ struct PolarListTree<TYPE, 4>
lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft); lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1)) else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1))
lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft); lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == 0)
lmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard, soft);
else else
lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1)); lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -223,6 +245,8 @@ struct PolarListTree<TYPE, 4>
rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft);
else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1)) else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1))
rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft);
else if (frozen >> (N/2) == 0)
rmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard+N/2, soft);
else else
rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2)); rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -248,6 +272,8 @@ struct PolarListTree<TYPE, 3>
lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft); lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1)) else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1))
lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft); lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == 0)
lmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard, soft);
else else
lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1)); lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -256,6 +282,8 @@ struct PolarListTree<TYPE, 3>
rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft);
else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1)) else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1))
rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft);
else if (frozen >> (N/2) == 0)
rmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard+N/2, soft);
else else
rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2)); rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -281,6 +309,8 @@ struct PolarListTree<TYPE, 2>
lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft); lmap = PolarListNode<TYPE, M-1>::rate0(metric, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1)) else if ((frozen & ((1<<(1<<(M-1)))-1)) == ((1<<((1<<(M-1))-1))-1))
lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft); lmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard, soft);
else if ((frozen & ((1<<(1<<(M-1)))-1)) == 0)
lmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard, soft);
else else
lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1)); lmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard, soft, frozen & ((1<<(1<<(M-1)))-1));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)
@ -289,6 +319,8 @@ struct PolarListTree<TYPE, 2>
rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rate0(metric, hard+N/2, soft);
else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1)) else if (frozen >> (N/2) == ((1<<((1<<(M-1))-1))-1))
rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft); rmap = PolarListNode<TYPE, M-1>::rep(metric, message, maps, count, hard+N/2, soft);
else if (frozen >> (N/2) == 0)
rmap = PolarListNode<TYPE, M-1>::rate1(metric, message, maps, count, hard+N/2, soft);
else else
rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2)); rmap = PolarListTree<TYPE, M-1>::decode(metric, message, maps, count, hard+N/2, soft, frozen >> (N/2));
for (int i = 0; i < N/2; ++i) for (int i = 0; i < N/2; ++i)