Trellis Computations

Details Trellis Computations Trellis Computations

2007-11-19

arxiv.org/abs/0711.2873v1

Computer Science

Information Theory

9 pages, 4 figures

Scientific paper

For a certain class of functions, the distribution of the function values can be calculated in the trellis or a sub-trellis. The forward/backward recursion known from the BCJR algorithm is generalized to compute the moments of these distributions. In analogy to the symbol probabilities, by introducing a constraint at a certain depth in the trellis we obtain symbol moments. These moments are required for an efficient implementation of the discriminated belief propagation algorithm in [2], and can furthermore be utilized to compute conditional entropies in the trellis. The moment computation algorithm has the same asymptotic complexity as the BCJR algorithm. It is applicable to any commutative semi-ring, thus actually providing a generalization of the Viterbi algorithm.

Affiliated with

Also associated with

No associations

Rating

Trellis Computations 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 Trellis Computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trellis Computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115709