3.5.3 Finite alphabet iterative decoders
A related decoding approach is represented by the Finite Alphabet Iterative Decoders (FAIDs) [76,77]. The approach is to represent exchanged messages by “confidence” levels that belong to a finite alphabet, and to modify the local update rules of the MS decoding, such as to follow a given set of constraints. The check-node update rule is the same as the one used in MS decoding (possibly using a normalization/offset factor as for NMS/OMS), while the variable-node update rule is defined through a specific map. This specific map is designed using the knowledge of potentially harmful sub-graphs that could ...
Get Channel Coding: Theory, Algorithms, and Applications now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
