{"year":"2018","publisher":"IEEE","status":"public","day":"01","external_id":{"arxiv":["1806.11195"]},"date_published":"2018-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"citation":{"ieee":"N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of polar codes on permuted factor graphs,” in <i>2018 IEEE Global Communications Conference </i>, Abu Dhabi, United Arab Emirates, 2018.","mla":"Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.” <i>2018 IEEE Global Communications Conference </i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/glocom.2018.8647308\">10.1109/glocom.2018.8647308</a>.","ama":"Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on permuted factor graphs. In: <i>2018 IEEE Global Communications Conference </i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/glocom.2018.8647308\">10.1109/glocom.2018.8647308</a>","short":"N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications Conference , IEEE, 2018.","apa":"Doan, N., Hashemi, S. A., Mondelli, M., &#38; Gross, W. J. (2018). On the decoding of polar codes on permuted factor graphs. In <i>2018 IEEE Global Communications Conference </i>. Abu Dhabi, United Arab Emirates: IEEE. <a href=\"https://doi.org/10.1109/glocom.2018.8647308\">https://doi.org/10.1109/glocom.2018.8647308</a>","chicago":"Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On the Decoding of Polar Codes on Permuted Factor Graphs.” In <i>2018 IEEE Global Communications Conference </i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/glocom.2018.8647308\">https://doi.org/10.1109/glocom.2018.8647308</a>.","ista":"Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar codes on permuted factor graphs. 2018 IEEE Global Communications Conference . GLOBECOM: Global Communications Conference."},"month":"12","date_created":"2019-07-30T06:43:15Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.11195"}],"_id":"6728","doi":"10.1109/glocom.2018.8647308","author":[{"last_name":"Doan","first_name":"Nghia","full_name":"Doan, Nghia"},{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","orcid":"0000-0002-3242-7020","first_name":"Marco","full_name":"Mondelli, Marco"},{"first_name":"Warren J.","full_name":"Gross, Warren J.","last_name":"Gross"}],"conference":{"start_date":"2018-12-09","end_date":"2018-12-13","location":"Abu Dhabi, United Arab Emirates","name":"GLOBECOM: Global Communications Conference"},"quality_controlled":"1","title":"On the decoding of polar codes on permuted factor graphs","publication_status":"published","publication":"2018 IEEE Global Communications Conference ","abstract":[{"text":"Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications. However, the error-correction performance of polar codes under BP decoding is far from the requirements of 5G. It has been shown that the error-correction performance of BP can be improved if the decoding is performed on multiple permuted factor graphs of polar codes. However, a different BP decoding scheduling is required for each factor graph permutation which results in the design of a different decoder for each permutation. Moreover, the selection of the different factor graph permutations is at random, which prevents the decoder to achieve a desirable error correction performance with a small number of permutations. In this paper, we first show that the permutations on the factor graph can be mapped into suitable permutations on the codeword positions. As a result, we can make use of a single decoder for all the permutations. In addition, we introduce a method to construct a set of predetermined permutations which can provide the correct codeword if the decoding fails on the original permutation. We show that for the 5G polar code of length 1024, the error-correction performance of the proposed decoder is more than 0.25 dB better than that of the BP decoder with the same number of random permutations at the frame error rate of 10 -4 .","lang":"eng"}],"oa_version":"Preprint","date_updated":"2021-01-12T08:08:42Z","extern":"1","type":"conference","publication_identifier":{"isbn":["9781538647271"]},"language":[{"iso":"eng"}]}