On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding

The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice over the interleaver and a uniform choice of the component codes from the set of time varying recursive systematic convolutional codes. The conventional union bound is employed to obtain an upper bound on the bit error probability of the ensemble of serially concatenated turbo codes for the binary-input additive white Gaussian noise (AWGN) channel with coherent detection of antipodal signals and maximum likelihood decoding. The influence of the interleaver length N and the memory length of the component codes m on the ensemble performance is investigated and compared with relevant results for parallel concatenated multiple-turbo codes. 1 

• Type: Journal
• Year: 2000
• Where: ETT
• Authors: Igal Sason, Shlomo Shamai
• Keywords: Concatenated, Education, ETT 2000, Turbo Codes, Uniform Choice