Table - PMC

Skip to main content

View full-text article in PMC

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

Algorithm 1 The SC flipping algorithm.

Input:

y_{1}^{N}

,

A

, T
Output:

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

1:
{ ${\hat{u}}_{1}^{N}$ , LLR} ← SC $(y_{1}^{N})$
2:
if ${\hat{u}}_{1}^{N}$ fail CRC and $T > 1$ then
3:
$V$ ←i∈ $A$ of T smallest $∣ LLR ∣$
4:
for $j \leftarrow 1$ to T do
5:
${\hat{u}}_{1}^{N}$ ← SC $(y_{1}^{N}, V (j))$
6:
if ${\hat{u}}_{1}^{N}$ pass CRC then
7:
break
8:
end if
9:
end for
10:
end if
11:
return ${\hat{u}}_{1}^{N}$