Who corrects more errors ?Selected algorithms

log-max MAP

6 iterations

UMTS codes

UMTS interleaver

1 and 2 ATM cells

k/n = 1/2 (punctured)

‘turbo’ codes (PCCC)

‘product’ codes (SCBC)

Fang-Buda

4 iterations

BCH x BCH codes:

(26,20)x(31,20) = 1 ATM cell

(42,29)x(42,29) = 2 ATM cells

k/n = 1/2

1. subset reordering with exclusion

2. coding to get list of codewords

3. reduced list of closest codewords

4. extrinsic calculation

1. LLR sorting

2. H matrix permutation

3. Gaussian reduction on H

4. LLR permutation

pre-

processing

systematic

search

for codewords

Previous slide

Next slide

Back to first slide

View graphic version