CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

On Performance Bounds for Serially Concatenated Codes with the General Inner Code and Interleaver

Ming Xiao (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Tor Aulin (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005; Rotorua; New Zealand; 29 August 2005 through 1 September 2005 p. 258-262. (2005)
[Konferensbidrag, refereegranskat]

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.


Article number 1531900



Denna post skapades 2006-07-04. Senast ändrad 2016-06-21.
CPL Pubid: 21546

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datorteknik (Chalmers)

Ämnesområden

Information Technology

Chalmers infrastruktur