On Performance Bounds for Serially Concatenated Codes with the General Inner Code and Interleaver
Paper i proceeding, 2005

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 inter leaver, 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.

Författare

Ming Xiao

Chalmers, Data- och informationsteknik, Datorteknik

Tor Aulin

Chalmers, Data- och informationsteknik, Datorteknik

IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005; Rotorua; New Zealand; 29 August 2005 through 1 September 2005

258-262

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1109/ITW.2005.1531900

ISBN

978-078039481-0