Sentence examples for a protection class from inspiring English sources

The inner loop performs the maximization of the minimum variable node degree of a protection class.

A third protection class contains all parity bits.

Finally, we compare both soft-decision decoding algorithms for a specific protection class, such as the higher protection one (cp1).

Well-designed UEP codes have faster convergence for all protection classes and thereby better performance for finite-length LDPC codes.

UEP properties of the code are achieved by sequential execution of the optimization algorithm of [2], one protection class at a time and starting with the best protected class for an E b /N0 slightly higher than the threshold.

For a fixed E b /N0, the outer loop finds an optimal variable node degree distribution for each protection class and thus finds an optimal variable node degree distribution for the whole code.

Finally, numerical results and examples are provided which indicate that a trade-off between performance and complexity for each protection class is obtained.

In this case, the WED algorithm can offer a performance closer to the ML curve (for the higher protection class), but at the price of increased complexity.

Ma and Kwak [6] propose a partially regular code design, where all variable nodes in one protection class have the same degree.

In this work, we consider the flexible UEP-LDPC code design proposed in [3], which is based on a hierarchical optimization of the variable node degree distribution for each protection class.

In this study, the effectiveness of two sub-optimum soft-decision decoding algorithms (GC-2 (t,p) and WED (t,Q) algorithms) was investigated for each protection class of UEP block codes using binary transmission over an AWGN channel.