DocumentCode
3285184
Title
Importance sampling simulation of turbo product codes
Author
Ferrari, M. ; Bellini, S.
Author_Institution
Dipt. di Elettron. e Inf., Politecnico di Milano, Italy
Volume
9
fYear
2001
fDate
2001
Firstpage
2773
Abstract
An importance sampling technique, tuned for the simulation of ideal or suboptimal MAP bit-per-bit decoding, is applied to some examples of turbo product codes, i.e. to turbo decoding of the product of block codes. The simulation results show the remarkable performances of the suboptimal algorithms. The presence of the so called “knee” in the performance curves, predicted by the maximum likelihood asymptotic bound, is also confirmed
Keywords
BCH codes; block codes; error statistics; importance sampling; maximum likelihood decoding; turbo codes; BCH codes; MAP bit-per-bit decoding; block codes; error probability; importance sampling; maximum likelihood asymptotic bound; simulation results; suboptimal algorithms; turbo decoding; turbo product codes; AWGN; Bit error rate; Block codes; Concatenated codes; Convolutional codes; Error probability; Iterative algorithms; Iterative decoding; Monte Carlo methods; Product codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2001. ICC 2001. IEEE International Conference on
Conference_Location
Helsinki
Print_ISBN
0-7803-7097-1
Type
conf
DOI
10.1109/ICC.2001.936655
Filename
936655
Link To Document