Design of Rate-Compatible Serially Concatenated Convolutional Codes

Simple item page
dc.creatorAmat, Alexandre Graell i
dc.creatorBrannstrom, Fredrik
dc.creatorRasmussen, Lars K.
dc.date2006-01-14
dc.date.accessioned2026-07-07T08:15:51Z
dc.date.available2026-07-07T08:15:51Z
dc.descriptionRecently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer charts analysis. Following this approach, we construct a family of rate-compatible SCCCs with good performance in both the error floor and the waterfall regions over a broad range of code rates.
dc.descriptionTo appear at the International Symposium on Turbo Codes and Related Topics
dc.identifierhttps://arxiv.org/abs/cs/0601067
dc.identifierhttp://arxiv.org/abs/cs/0601067
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133582
dc.subjectInformation Theory
dc.titleDesign of Rate-Compatible Serially Concatenated Convolutional Codes
dc.typetext

Files

Collections

arXiv