Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel
Paper i proceeding, 2015

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.

Författare

Saeedeh Moloudi

Lunds universitet

Michael Lentmaier

Lunds universitet

Alexandre Graell i Amat

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

IEEE Information Theory Workshop (ITW)

138-142 7360750

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

DOI

10.1109/ITWF.2015.7360750

ISBN

978-1-4673-7852-9