Average ML Asymptotic Performances of Different Serial Turbo Ensembles

In this paper we study the ML error probability of serially concatenated schemes averaged over different interleaver ensembles. We prove asymptotic results when the interleaver length goes to infinity: differently from the parallel case, the choice of the ensemble can change the decreasing speed of error probability