Sparse Graph Codes for Channels with Synchronous Errors

Sparse Graph Codes for Channels with Synchronous Errors

In this paper, we deal with coding for synchronous errors. We introduce a synchronously erroneous finite state Markov channel model whose SIR is computable. We apply density evolution analysis [1] and the extended version for FSMC [2] to the channel Numerical experiments demonstrated spatially-coupl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2018/12/01, Vol.E101.A(12), pp.2064-2071
Hauptverfasser: GOTO, Ryohei, KASAI, Kenta
Format: Artikel
Sprache:eng
Schlagworte:
synchronous errors
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we deal with coding for synchronous errors. We introduce a synchronously erroneous finite state Markov channel model whose SIR is computable. We apply density evolution analysis [1] and the extended version for FSMC [2] to the channel Numerical experiments demonstrated spatially-coupled codes approach the SIR of the channel.
ISSN:0916-8508
1745-1337
DOI:10.1587/transfun.E101.A.2064