Decoding LDPC (Low Density Parity Check) code and graphs using
multiplication (or addition in log-domain) on both sides of bipartite
graph. Decoding of LDPC coded signals is presented whereby edge messages
may be updated using only multiplication (or log domain addition). By
appropriate modification of the various calculations that need to be
performed when updating edge messages, the calculations may be reduced to
only performing product of terms functions. When implementing such
functionality in hardware within a communication device that is operable
to decode LDPC coded signals, this reduction in processing complexity
greatly eases the actual hardware's complexity as well. A significant
savings in processing resources, memory, memory management concerns, and
other performance driving parameters may be made.