synthesize a simple algorithm to determine the weighted distance spectrum of turbo codes
In this work we present such an algorithm for determining the weighted distance spectrum for a given interleaver and given component encoders. We analyse one of the most important characteristic feature of turbo codes -- the error floor. Moreover, our algorithm provides some useful insights into the code structure of turbo codes, which kind of input words generate codewords of low weight. We assume in this work that both component encoders of the turbo code are simultaneously terminated at the end of the input word u.
turbo code interleaver component encoder minimum distance