Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC

Simple item page
dc.creatorKraidy, Ghassan M.
dc.creatorSavin, Valentin
dc.date2008-03-12
dc.date.accessioned2026-07-07T09:26:26Z
dc.date.available2026-07-07T09:26:26Z
dc.descriptionIn this paper we investigate the decoding of parallel turbo codes over the binary erasure channel suited for upper-layer error correction. The proposed algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the first symbols are received. This algorithm compares with the iterative decoding of codes defined on graphs, in that it propagates in the trellises of the turbo code by removing transitions in the same way edges are removed in a bipartite graph under message-passing decoding. Performance comparison with LDPC codes for different coding rates is shown.
dc.description5 pages, submitted SPAWC08
dc.identifierhttps://arxiv.org/abs/0803.1807
dc.identifierhttp://arxiv.org/abs/0803.1807
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156747
dc.subjectInformation Theory
dc.titleMinimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC
dc.typetext

Files

Collections

arXiv