Reliability Analysis of the Joint LDPC Decoding Algorithms over the Multiple Access Channels
محورهای موضوعی : Communication Systems & Devices
1 - University of Tabriz
کلید واژه: Multi-Edge Type LDPC Codes, BER Performance, Joint SPA, Joint Channel Decoding Algorithm, Multiple Access Channel,
چکیده مقاله :
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.
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.
[1] E. C. Van Der Meulen, “The discrete memoryless channel with two senders and one receiver”, In Proc. IEEE Int. Symp. Information Theory (ISIT), September 1971, pp. 78.
[2] R. Ahlswede, “The capacity region of a channel with two senders and two receivers”, Annals of probability, Vol. 2, No. 5, 1974, pp. 805-814.
[3] A. Khandekar, “Graph-based codes and iterative decoding”, Ph.D. thesis, California Institute of Technology, USA, 2002.
[4] J. Scarlett, A. Martinez, and A. G. Fabregas, “Mismatched multi-letter successive decoding for the multiple-access channel”, IEEE Transactions on Information Theory, Vol. 64, No. 4, 2017, pp. 2253-2266.
[5] P. Li, X. Jian, F. Wang, S. Fu, and Z. Zhang, “Theoretical throughput analysis for massive random access with spatial successive decoding”, IEEE Transactions on Vehicular Technology, Vol. 69, No. 7, 2020, pp. 7998-8002.
[6] M. Nangir, R. Asvadi, J. Chen, M. Ahmadian-Attari, and T. Matsumoto, “Successive Wyner-Ziv Coding for the Binary CEO Problem under Logarithmic Loss”, IEEE Transactions on Communications, Vol. 67, No .11, 2019, pp. 7512-7525.
[7] M. Nangir, J. Pourrostam, J. M. Niya, and B. M. Tazehkand, “Comparison Between the Joint and Successive Decoding Schemes for the Binary CEO Problem”, In IEEE 28th Iranian Conference on Electrical Engineering (ICEE), August 2020, pp. 1-5.
[8] S. Papaharalabos and P. T. Mathiopoulos, “Simplified sum-product algorithm for decoding LDPC codes with optimal performance,” Electronics Letters, Vol. 45, No. 2, January 2009, pp. 116-117.
[9] M. Nangir, R. Asvadi, M. Ahmadian-Attari, and J. Chen, “Analysis and code design for the binary CEO problem under logarithmic loss”, IEEE Transactions on Communications, Vol. 66, No. 12, 2018, pp. 6003-6014.
[10] H. Khodaei Jooshin, and M. Nangir, “Reliability Analysis of the Sum-Product Decoding Algorithm for the PSK Modulation Scheme”, Journal of Information Systems and Telecommunication (JIST), Vol. 8, No. 3, 2020, pp. 167-174.
[11] A. El Gamal, and Y. H. Kim, Network information theory, Cambridge University Press, 2011.
[12] M. Nangir, R. Asvadi, M. Ahmadian-Attari, and J. Chen, “Successive Wyner-Ziv coding for the binary CEO problem under log-loss”, In IEEE 29th Biennial Symposium on Communications (BSC), Canada, 2018, pp. 1-5.
[13] Z. Goldfeld, and H. H. Permuter, “A Useful Analogy Between Wiretap and Gelfand-Pinsker Channels”, In IEEE International Symposium on Information Theory (ISIT), 2018, pp. 121-125.
[14] M. Nangir, R. Asvadi, M. Ahmadian-Attari, and J. Chen, ‘Binary CEO problem under log-loss with BSC test-channel model”, In IEEE 29th Biennial Symposium on Communications (BSC), 2018, pp. 1-5.
[15] F. Vatta, A. Soranzo, M. Comisso, G. Buttazzoni, and F. Babich, “Performance study of a class of irregular LDPC codes through low complexity bounds on their belief-propagation decoding thresholds”, In IEEE AEIT International Annual Conference, 2019, pp. 1-6.
[16] S. Jayasooriya, M. Shirvani moghaddam, L. Ong, G. Lechner, and S. J. Johnson, “A new density evolution approximation for LDPC and multi-edge type LDPC codes”, IEEE Transactions on Communications, Vol. 64, No. 10, 2016, pp. 4044-4056.
[17] S. Jeong, and J. Ha, “On the Design of Multi-Edge Type Low-Density Parity-Check Codes”, IEEE Transactions on Communications, Vol. 67, No. 10, 2019, pp. 6652-6667.
[18] J. Du, L. Zhou, L. Yang, S. Peng and J. Yuan, "A New LDPC Coded Scheme for Two-User Gaussian Multiple Access Channels," in IEEE Communications Letters, vol. 22, no. 1, pp. 21-24, Jan. 2018.
[19] S. Cammerer, X. Wang, Y. Ma and S. t. Brink, "Spatially Coupled LDPC Codes and the Multiple Access Channel," 2019 53rd Annual Conference on Information Sciences and Systems (CISS), 2019, pp. 1-6.
[20] M. B. Abdessalem, A. Zribi, T. Matsumoto and A. Bouallègue, "LDPC-based Joint Source-Channel-Network Coding for the Multiple Access Relay Channel," 2018 6th International Conference on Wireless Networks and Mobile Communications (WINCOM), 2018, pp. 1-6.
[21] B. K. Ng and C. Lam, "Joint Power and Modulation Optimization in Two-User Non-Orthogonal Multiple Access Channels: A Minimum Error Probability Approach," in IEEE Transactions on Vehicular Technology, vol. 67, no. 11, pp. 10693-10703, Nov. 2018.
[22] M. Ebada, S. Cammerer, A. Elkelesh, M. Geiselhart and S. t. Brink, "Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels," 2020 54th Asilomar Conference on Signals, Systems, and Computers, 2020, pp. 683-688.
[23] Z. Sun, M. Shao, J. Chen, K. M. Wong, and X. Wu, “Achieving the rate-distortion bound with low-density generator matrix codes”, IEEE Transactions on Communications, Vol. 58, No. 6, 2010, pp. 1643-1653.
[24] T. Richardson, and R. Urbanke, Modern coding theory, Cambridge University Press, 2008.
[25] D. H. Schonberg, “Practical distributed source coding and its application to the compression of encrypted data”, Ph.D. thesis, University of California, Berkeley, USA, 2007.
