Abstract
This paper is intended to predict the performance of turbo-codes by analytical means. After a brief description of turbo-codes, the concept of basic return-to-zero (rtz) sequences is introduced. Then, it is shown how rtz sequences can be used to compute the Hamming distance spectrum (uds) via a modified version of the Fano algorithm. The hds thus obtained is used to compute an upper bound on the bit error rate. Distance spectra of selected turbo-codes with short interleaving are presented and the validity of their performance prediction is confirmed by simulation (only provisional results are given here). Besides, a class of low-performance turbocodes, referred to as weak, is identified.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
