Table 2 Complexity of the Max-Log-MAP decoding algorithm

α, β

No.

(R × Q × N + 1) × 2^M’

(Q × N + 1) × 2^M’

(N + 1) × 2^{Q × M}

Prod

2

2^R

2^{Q × R}

Sum

1

2^R − 1

2^{Q × R} − 1

γ

No.

R × Q × N × 2^M’2

Q × N × 2^M’2^R

N × 2^{Q × M} × 2^{Q × R}

Prod

2

R + 1

(R + 1) × 2^Q

Sum

2

R + 1

(R + 1) × 2^Q

L

No.

R × Q × N × 2

Q × N × 2^R

N × 2^{Q × R}

Prod

2

2 × 2^M’

2 × 2^{Q × M}

Cmp

1

2^M − 1

2^{Q × M} − 1