Comparison Between the Joint and Successive Decoding Schemes for the Binary CEO Problem

Nangir, Mahdi; Pourrostam, Jafar; Niya, Javad Musevi; Tazehkand, Behzad Mozaffari

doi:10.1109/icee50131.2020.9260575

Cited by 1 publication

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on (7), we decode the codewords that have been sent from the different links of the MAC. Note that, this decoding is in the category of the error correction algorithms.…”

Section: By Multiplying the Information Bit Of Lengthmentioning

confidence: 99%

Reliability Analysis of the Joint LDPC Decoding Algorithms over the Multiple Access Channels

Nangir¹

2021

jist

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…Based on (7), we decode the codewords that have been sent from the different links of the MAC. Note that, this decoding is in the category of the error correction algorithms.…”

Section: By Multiplying the Information Bit Of Lengthmentioning

confidence: 99%

Reliability Analysis of the Joint LDPC Decoding Algorithms over the Multiple Access Channels

Nangir¹

2021

jist

Self Cite

View full text Add to dashboard Cite

show abstract

Comparison Between the Joint and Successive Decoding Schemes for the Binary CEO Problem

Cited by 1 publication

References 17 publications

Reliability Analysis of the Joint LDPC Decoding Algorithms over the Multiple Access Channels

Reliability Analysis of the Joint LDPC Decoding Algorithms over the Multiple Access Channels

Contact Info

Product

Resources

About