Factorization of Joint Probability Mass Functions into Parity Check Interactions

Details Factorization of Joint Probability Mass Functions into Parity Check Interactions Factorization of Joint Probability Mass Functions into Parity Check Interactions

2009-01-20

arxiv.org/abs/0901.3056v2

Computer Science

Information Theory

5 pages, 1 figures, appeared in the proceedings of ISIT 2009; Changed content, more recent version than as appeared in the pro

Scientific paper

We show that any joint probability mass function (PMF) can be expressed as a product of parity check factors and factors of degree one with the help of some auxiliary variables, if the alphabet size is appropriate for defining a parity check equation. In other words, marginalization of a joint PMF is equivalent to a soft decoding task as long as a finite field can be constructed over the alphabet of the PMF. In factor graph terminology this claim means that a factor graph representing such a joint PMF always has an equivalent Tanner graph. We provide a systematic method based on the Hilbert space of PMFs and orthogonal projections for obtaining this factorization.

Affiliated with

Also associated with

No associations

Rating

Factorization of Joint Probability Mass Functions into Parity Check Interactions 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 Factorization of Joint Probability Mass Functions into Parity Check Interactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Factorization of Joint Probability Mass Functions into Parity Check Interactions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-435109