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

Deriving the PCC iterative decoder from the SCC iterative decoder

A. Nilsson ; Tor Aulin (Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) )
6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 p. 142-145. (2010)
[Konferensbidrag, refereegranskat]

In this paper, we show that the iterative decoder for parallel concatenated codes can be derived from the iterative decoder for serially concatenated codes. In order to show this, we use the observation that any parallel concatenated code (PCC) may be regarded as a serially concatenated code (SCC) with certain code constraints satisfied. By applying these code constraints to the SCC iterative decoder we obtain the PCC iterative decoder, and hence show that the latter can be seen as a special case of the former.

Nyckelord: concatenated codes , iterative decoding, PCC iterative decoder , SCC iterative decoder , code constraints , parallel concatenated codes , serially concatenated codes



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2010-12-15. Senast ändrad 2010-12-15.
CPL Pubid: 130920

 

Läs direkt!


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