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

Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel

Saeedeh Moloudi ; Michael Lentmaier ; Alexandre Graell i Amat (Institutionen för signaler och system, Kommunikationssystem)
IEEE Information Theory Workshop (ITW) p. 138-142. (2015)
[Konferensbidrag, refereegranskat]

In this paper we prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC codes which simplifies their description and the analysis of the message passing decoding. We demonstrate that by few assumptions in the ensembles of these codes, it is possible to rewrite their vector recursions in a form which places these ensembles under the category of scalar admissible systems. This allows us to define potential functions and prove threshold saturation using the proof technique introduced by Yedla et al.



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

Läs mer om Chalmers styrkeområden  

Denna post skapades 2015-07-09. Senast ändrad 2016-08-26.
CPL Pubid: 219652

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

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