Table 10 Example of reduction of the number combinations for 64QAM
From: Low complexity soft demapping for non-binary LDPC codes
Number of combinations | Without the algorithm | Prop. algorithm with r= 3, N q = 20 | Prop. algorithm with r= 3, N q = 24 |
|---|---|---|---|
GF(64) symbol a | 64 × 26 = 4096 | 64 × 3 × N q + 2 × 64 × 6 = 4608 | 64 × 3 × N q + 2 × 64 × 6 = 5376 |
GF(64) symbol b | 64 × 26 = 4096 |  |  |
Block of m1 GF symbols | 2 × 64 × (26) = 8192 | 64 × 3 × N q + 2 × 64 × 6 = 4608 | 64 × 3 × N q + 2 × 64 × 6 = 5376 |