research-article

Conflict-Free Vectorized In-order In-place Radix-r Belief Propagation Polar Code Decoder Algorithm

Authors:

Arvid B. van den Brink,

Marco J.G. BekooijAuthors Info & Claims

ICCBN '20: Proceedings of the 2020 8th International Conference on Communications and Broadband Networking

Pages 18 - 23

https://doi.org/10.1145/3390525.3390539

Published: 25 May 2020 Publication History

Abstract

A vectorized belief propagation polar code decoder is desirable because of the potentially high throughput and the ability of integration in processors that perform vectorized processing and access wide memory words. However, current state-of-the-art belief propagation polar code decoder algorithms do not perform vector processing and store intermediate results in non consecutive memory locations. Also the current state-of-the-art belief propagation polar code decoders require separate memories to store left and right bound intermediate results.

In this paper we propose a vectorized in-order in-place belief propagation polar code decoder algorithm where all stages access vectorized data from memory. This results in a high throughput because vectors of elements can be fetched from and stored in memory in each clock cycle. Our algorithm also accommodates for per stage in-place computations which halves the required internal memory. Furthermore, the algorithm has a regular memory addresses access pattern. Conflict free vectorized memory access is achieved by making use of transpose operations on small groups of intermediate results. The use of the transpose operations also results in that both input and output results are placed on subsequent locations in memory.

References

[1]

Cenk Albayrak, Cemaleddin Simsek, and Kadir Turk. 2017. Low-complexity early termination method for rateless soft decoder. IEEE Commun. Lett. 21, 11 (2017), 2356--2359. https://doi.org/10.1109/LCOMM.2017.2740207

[2]

E. Arikan. 2008. A performance comparison of polar codes and Reed-Muller codes. IEEE Commun. Lett. 12, 6 (jun 2008), 447--449. https://doi.org/10.1109/LCOMM.2008.080017

[3]

Erdal Arikan. 2009. Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55, 7 (2009), 3051--3073. https://doi.org/10.1109/TIT.2009.2021379 arXiv:0807.3917

Digital Library

[4]

Erdal Arikan. 2011. Systematic polar coding. IEEE Commun. Lett. 15, 8 (2011), 860--862. https://doi.org/10.1109/LCOMM.2011.061611.110862 arXiv:arXiv:1011.1669v3

[5]

Erdal Arıkan. 2010. Polar codes: A pipelined implementation. 4th Int. Symp. Broadband Commun. (ISBC 2010) (2010), 11--14.

[6]

Hoseok Chang and Wonyong Sung. 2008. Efficient vectorization of SIMD programs with non-aligned and irregular data access hardware. Embed. Syst. Week 2008 - Proc. 2008 Int. Conf. Compil. Archit. Synth. Embed. Syst. CASES'08 (2008), 167--175. https://doi.org/10.1145/1450095.1450121

Digital Library

[7]

Pierre Duhamel. 1990. A connection between bit reversal and matrix transposition: hardware and software consequences. IEEE Trans. Acoust. 38, 11 (1990), 1893--1896. https://doi.org/10.1109/29.103090

[8]

Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan Ten Brink, and B E R Bler. 2018. Belief Propagation List Decoding of Polar Codes. IEEE Commun. Lett. 22, 8 (2018), 1536--1539. https://doi.org/10.1109/LCOMM.2018.2850772 arXiv:1806.10503

[9]

Marc P.C. Fossorier, Miodrag Mihaljevic, and Hideki Imai. 1999. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Trans. Commun. 47, 5 (1999), 673--680. https://doi.org/10.1109/26.768759

[10]

Frank R. Kschischang and Brendan J. Frey. 1998. Iterative decoding of compound codes by probability propagation in graphical models. IEEE J. Sel. Areas Commun. 16, 2 (1998), 219--230. https://doi.org/10.1109/49.661110

Digital Library

[11]

Kai Niu and Kai Chen. 2012. CRC-aided decoding of polar codes. IEEE Commun. Lett. 16, 10 (2012), 1668--1671. https://doi.org/10.1109/LCOMM.2012.090312.121501

[12]

Youn Sung Park, Yaoyu Tao, Shuanghong Sun, and Zhengya Zhang. 2014. A 4.68Gb/s belief propagation polar decoder with bit-splitting register file. In IEEE Symp. VLSI Circuits, Dig. Tech. Pap. 2013--2014. https://doi.org/10.1109/VLSIC.2014.6858413

[13]

Yuanrui Ren, Chuan Zhang, Xing Liu, and Xiaohu You. 2016. Efficient early termination schemes for belief-propagation decoding of polar codes. Proc. - 2015 IEEE 11th Int. Conf. ASIC, ASICON 2015 (2016). https://doi.org/10.1109/ASICON.2015.7517046

[14]

Seyed A. Rooholamin and Sotirios G. Ziavras. 2015. Modular vector processor architecture targeting at data-level parallelism. Microprocess. Microsyst. 39, 4-5 (2015), 237--249. https://doi.org/10.1016/j.micpro.2015.04.007

Digital Library

[15]

Jin Sha, Jingbo Liu, Jun Lin, and Zhongfeng Wang. 2016. A Stage-Combined Belief Propagation Decoder for Polar Codes. J. Signal Process. Syst. (2016), 1--8. https://doi.org/10.1007/s11265-016-1181-y

[16]

Cemaleddin Simsek and Kadir Turk. 2016. Simplified Early Stopping Criterion for Belief-Propagation Polar Code Decoders. IEEE Commun. Lett. 20, 8 (2016), 1515--1518. https://doi.org/10.1109/LCOMM.2016.2580514

[17]

Bogdan Spinean, Georgi Kuzmanov, and Georgi Gaydadjiev. 2011. Vector processor customization for FFT. Proc. - 2011 Int. Conf. Embed. Comput. Syst. Archit. Model. Simulation, IC-SAMOS 2011 (2011), 110--117. https://doi.org/10.1109/SAMOS.2011.6045451

[18]

Shuanghong Sun and Zhengya Zhang. 2016. Architecture and optimization of high-throughput belief propagation decoding of polar codes. In 2016 IEEE Int. Symp. Circuits Syst., Vol. 2016-July. IEEE, 165--168. https://doi.org/10.1109/ISCAS.2016.7527196

[19]

Ido Tal and Alexander Vardy. 2015. List Decoding of Polar Codes. IEEE Trans. Inf. Theory 61, 5 (may 2015), 1--11. https://doi.org/10.1109/TIT.2015.2410251 arXiv:1206.0050

Digital Library

[20]

Menghui Xu, Shusen Jing, Jun Lin, Weikang Qian, Zaichen Zhang, Xiaohu You, and Chuan Zhang. 2018. Approximate Belief Propagation Decoder for Polar Codes. In 2018 IEEE Int. Conf. Acoust. Speech Signal Process. IEEE, 1169--1173. https://doi.org/10.1109/ICASSP.2018.8462478

[21]

Kai Zhang, Shuming Chen, Sheng Liu, Yaohua Wang, and Junhui Huang. 2011. Accelerating the data shuffle operations for FFT algorithms on SIMD DSPs. Proc. Int. Conf. ASIC (2011), 683--686. https://doi.org/10.1109/ASICON.2011.6157297

Cited By

Van Den Brink AMeteer OBekooij M(2023)Software Implementation and Performance of a Computational Complexity Reduced Belief Propagation Polar Code Decoder2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)10.1109/ICECCME57830.2023.10253123(1-7)Online publication date: 19-Jul-2023
https://doi.org/10.1109/ICECCME57830.2023.10253123

Index Terms

Conflict-Free Vectorized In-order In-place Radix-r Belief Propagation Polar Code Decoder Algorithm
1. Theory of computation
  1. Design and analysis of algorithms
    1. Parallel algorithms
      1. Shared memory algorithms
      2. Vector / streaming algorithms

Recommendations

Serially concatenated scheme of polar codes and the improved belief propagation decoding algorithm

In this study, a serially concatenated scheme of polar codes with convolutional codes is proposed to improve the error correction performance. The novel belief propagation (BP) decoding algorithm addresses two issues that are present in the currently ...
Improved Belief Propagation Decoding Algorithm for Short Polar Codes

In this paper, we discuss the belief propagation (BP) decoding of polar codes. The performance of polar codes for short lengths is not satisfactory. Therefore, motivated by this we propose a novel technique to improve the performance of polar codes ...
A Stage-Combined Belief Propagation Decoder for Polar Codes

Message-passing decoding algorithm based on belief propagation is a widely used decoding algorithm for error correction codes. For moderate length polar codes, it achieves the error correction performance similar to the successive cancellation algorithm ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICCBN '20: Proceedings of the 2020 8th International Conference on Communications and Broadband Networking

April 2020

95 pages

ISBN:9781450375047

DOI:10.1145/3390525

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Auckland University of Technology

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 May 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICCBN '20

ICCBN '20: 2020 8th International Conference on Communications and Broadband Networking

April 15 - 18, 2020

Auckland, New Zealand

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
73
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Van Den Brink AMeteer OBekooij M(2023)Software Implementation and Performance of a Computational Complexity Reduced Belief Propagation Polar Code Decoder2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)10.1109/ICECCME57830.2023.10253123(1-7)Online publication date: 19-Jul-2023
https://doi.org/10.1109/ICECCME57830.2023.10253123

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten