Stochastic Iterative Decoders

Details Stochastic Iterative Decoders Stochastic Iterative Decoders

2005-01-30

arxiv.org/abs/cs/0501090v1

Computer Science

Information Theory

5 pages, 7 figures, submitted to the 2005 International Symposium on Information Theory

Scientific paper

This 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.

Affiliated with

Also associated with

No associations

Rating

Stochastic Iterative Decoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic Iterative Decoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic Iterative Decoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-348902