how to transform Arun's LDPC code to max-product (Min-sum)? comp.dsp LDPC Advice would be appreciated on how to transform Arun's code given on
formatting link
from sum-product to max-product (or min-sum) algorithm. He follows the MacKay's algorithm, introducing delta to simplify the computation. In max-product computation of sum() is replaced by computation of max(), so basically because in Arun's code the algorithm avoids computing the sum() - does it mean that it is not transformable to make max-roduct? George.