Table 7 Example of reduction of the number combinations for P1 and P3 from Table 6
From: Low complexity soft demapping for non-binary LDPC codes
Number of combinations | Without the algorithm | Prop. Algorithm with r= 0, N m = 8 | Prop. algorithm with r= 3, N m = 8, N q = 8 |
|---|---|---|---|
GF(64) symbol a | 64 × 22 = 256 | 64 × 22 = 256 | 64 × 22 = 256 |
GF(64) symbol b | 64 × 26 × 24 = 65536 | 64 × 6 + 64 × N m × 24 = 8576 | 64 × 3 × N m × N q + 2 × 64 × 6 = 13056 |
GF(64) symbol c | 64 × 26 × 24 = 65536 | 64 × 6 + 64 × N m × 24 = 8576 |  |
GF(64) symbol d | 64 × 22 = 256 | 64 × 22 = 256 | 64 × 22 = 256 |
Block of m1 GF symbols | 64 × 2 × (210 + 22) = 131584 | 2 × 64 × (22 + 6 + N m × 24) = 17664 | 2 × 64 × (22 + 6) + 64 × 3 × N m × N q = 13568 |