reliability analysis of the joint ldpc decoding algorithms over the multiple access channels

The joint low density parity-check (ldpc) decoding schemes iteratively decode the received data from multiple channels. mostly, the available data in different channels are correlated and there is kind of dependency between the links or channels. in recent decades, the graph-based codes have been considered for the communication network scenarios. the performance of these codes is close to the existing theoretical bounds and their complexity is not high which cause the possibility of real world implementation and exploitation. the multiple access channel (mac) scenario with multiple senders which aim to send correlated data to a single receiver is considered. an analysis on the reliability of the bit error rate (ber) performance of the joint sum-product (jsp) decoding algorithm is presented for a two-link case, which can be extended to higher number of links. the effect of parameter variations on the ber performance is studied. these parameters include: the total number of iterations, the codeword length, the total number of rounds, and the coding rate in the jsp algorithm. an optimal value of the parameters is selected during the design procedure of a communication network by considering its limitations and complexity criterion. the jsp algorithm is a reliable scheme for jointly decoding of noisy binary data from different origins.