Reference : Computation of Moments in the Trellis
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
Computation of Moments in the Trellis
Heim, Axel [> >]
Sidorenko, Vladimir [> >]
Sorger, Ulrich mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Proceedings of IEEE International Symposium on Information Theory
Proc. IEEE International Symposium on Information Theory
July 2008
[en] BCJR algorithm Viterbi algorithm belief propagation algorithm commutative semiring moments computation symbol moments trellis calculation
[en] Decisions on sources with memory transmitted over independent channels can be taken by employing trellis calculations. In this paper, it is shown that for a certain class of functions their moments can be computed in the trellis, too. This is done by generalizing the forward/backward recursion known from the BCJR algorithm [1]. 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 ef?cient 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 also providing a generalization of the Viterbi algorithm [3].
Researchers ; Professionals ; Students ; General public ; Others

File(s) associated to this reference

Fulltext file(s):

Open access
2008-07-11_Toronto_ISIT_ComputationOfMomentsInTheTrellis.pdfPublisher postprint238.48 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.