Table - PMC

Skip to main content

View full-text article in PMC

. 2021 Jul 6;23(7):863. doi: 10.3390/e23070863

Algorithm 2 Two-bit flipping algorithm based on the DLSTM.

Input:

y_{1}^{N}

,

W_{1}^{T}

,

W_{2}^{T}

,

T_{1}

,

T_{2}

Output:

{\hat{u}}_{1}^{N}

1:
{ ${\hat{u}}_{1}^{N}$ ,LLR} ← SC $(y_{1}^{N})$
2:
$t_{1} = 0$ , $t_{2} = 0$
3:
while ${\hat{u}}_{1}^{N}$ fail CRC and $t_{1} < T_{1}$ do
4:
$W_{1}^{T}$ ← DLSTM
5:
${\hat{u}}_{1}^{N}$ ← SC flip $(y_{1}^{N}, W_{1}^{T} (t_{1}))$
6:
if ${\hat{u}}_{1}^{N}$ pass CRC then
7:
break
8:
else
9:
$t_{1} \leftarrow t_{1} + 1$
10:
end if
11:
end while
12:
if $t_{1} \geq T_{1}$ then
13:
$t_{1} = 0$
14:
while ${\hat{u}}_{1}^{N}$ fail CRC do
15:
for $i \leftarrow t_{1} + 1$ to $T_{1}$ do
16:
if $t_{2} < T_{2}$ then
17:
${\hat{u}}_{1}^{N}$ ← SC flip $(y_{1}^{N}, W_{2}^{T} (t_{1}, i))$
18:
if ${\hat{u}}_{1}^{N}$ pass CRC then
19:
break
20:
else
21:
$t_{2} \leftarrow t_{2} + 1$
22:
end if
23:
end if
24:
end for
25:
$t_{1} \leftarrow t_{1} + 1$
26:
end while
27:
end if
28:
return ${\hat{u}}_{1}^{N}$