Title :
On performance bounds for serially concatenated codes with the general inner code and interleaver
Author :
Xiao, Ming ; Aulin, Tor M.
Author_Institution :
Dept. of Comput. Eng., Chalmers Univ. of Technol., Gothenburg, Sweden
fDate :
29 Aug.-1 Sept. 2005
Abstract :
We investigate the union bound for symbol interleaved serially concatenated codes (SCC) with non-uniform error properties. We calculate the distance spectrum of the SCC using the input difference symbol sequence spectrum (DSSS) of the inner code. Then we modify the trellis search algorithm for general codes to calculate the DSSS. We also show the mapping approach between difference symbols with the different alphabet size. For the symbol interleaver, we use the multinomial coefficient to calculate the probability of the permuted sequence. Numerical results for symbol interleaved serially concatenated continuous phase modulation (SCCPM) show that the bound is tight in the medium to high signal-to-noise ratio (SNR) region.
Keywords :
concatenated codes; continuous phase modulation; error statistics; interleaved codes; spread spectrum communication; trellis coded modulation; distance spectrum calculation; general inner code; input difference symbol sequence spectrum; interleaved serially concatenated continuous phase modulation; mapping approach; multinomial coefficient; nonuniform error property; performance bound; permuted sequence probability; symbol interleaved serially concatenated codes; symbol interleaver; trellis search algorithm; union bound; Bit error rate; Concatenated codes; Continuous phase modulation; Event detection; Law; Modulation coding; Spread spectrum communication; Telecommunication computing; Transfer functions; Turbo codes;
Conference_Titel :
Information Theory Workshop, 2005 IEEE
Print_ISBN :
0-7803-9480-1
DOI :
10.1109/ITW.2005.1531900
