Cryptography Reference
In-Depth Information
Figure 9.16 - Example of architecture for a vertical interleaving schedule. The serial
implementation of the PNP is not detailed in this figure.
decoding algorithm diverges very rapidly as it is subject to the self-confirmation
phenomenon: the propagation of the information occurs as if cycles with length
2 existed in the graph.
PNP with
Δ=1
This is the algorithm symmetric to the previous one: the PNP returns a
unique value. This technique, which is very ecient in terms of complexity,
enables the algorithm to reach its correction capacity in very few iterations,
typically 5. Although its correction capacity is very low in relation to the BP
algorithm, it is interesting to note that for 5 iterations, such an algorithm is more
ecient than the BP algorithm after this same number of iterations. Thus, such
procedures can be successfully applied for high data-rate applications where only
a reduced number of iterations can be performed.
