A Design of Overlapped Chunked Code over Compute-and-Forward for Multi-Source Multi-Relay Networks

. 2018 Sep 25;18(10):3225. doi: 10.3390/s18103225

Algorithm 3 Combination of chunks.

1:
Starting from chunk i

Taking $t = i$ , $d . s (ch . cs) =$ false, $ϕ = 1$ , $C_{c} = C^{(t)}$
2:
if $rank (C_{c}) = r_{ch}$ then
3:
Update $d . s (ch . cs) =$ true
4:
return $d . s (ch . cs)$ , $ϕ$
5:
else
6:
if $t = 1$ or $rank (C_{c}) < r_{p}^{(t)}$ or $l . b . s . s (t) =$ true then
7:
return $d . s (ch . cs)$ , $ϕ$
8:
end if
9:
end if
10:
while $t - 1 > 0$ and $r_{p}^{(t - 1)} \leq r^{(t - 1)} \leq D - 1$ and $r . b . s . s (t - 1) =$ false do
11:
Update $ϕ = ϕ + 1$ , $C_{c} = [C_{c}, C^{(t - 1)}]$
12:
if $rank (C_{c}) = r_{ch}$ then
13:
Update $d . s (ch . cs) =$ true
14:
return $d . s (ch . cs)$ , $ϕ$
15:
else
16:
Update $t = t - 1$
17:
end if
18:
end while