Stochastic Iterative Decoders

Simple item page
dc.creatorWinstead, Chris
dc.creatorRapley, Anthony
dc.creatorGaudet, Vincent C.
dc.creatorSchlegel, Christian
dc.date2005-01-30
dc.date.accessioned2026-07-07T08:15:19Z
dc.date.available2026-07-07T08:15:19Z
dc.descriptionThis paper presents a stochastic algorithm for iterative error control decoding. We show that the stochastic decoding algorithm is an approximation of the sum-product algorithm. When the code's factor graph is a tree, as with trellises, the algorithm approaches maximum a-posteriori decoding. We also demonstrate a stochastic approximations to the alternative update rule known as successive relaxation. Stochastic decoders have very simple digital implementations which have almost no RAM requirements. We present example stochastic decoders for a trellis-based Hamming code, and for a Block Turbo code constructed from Hamming codes.
dc.description5 pages, 7 figures, submitted to the 2005 International Symposium on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0501090
dc.identifierhttp://arxiv.org/abs/cs/0501090
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133414
dc.subjectInformation Theory
dc.titleStochastic Iterative Decoders
dc.typetext

Files

Collections

arXiv