Optimized and Approximate Belief Propagation Decoder for Polar Codes
DOI:
https://doi.org/10.61841/s23pv911Keywords:
Polar codes, belief propagation decoder, approximate computation, Ripple Carry Adder, PASTAAbstract
The polar code is one among the most effective error correcting code, attributable to the channel achieving property. In this paper, we propose an optimized and approximate belief propagation (BP) decoder for polar code for the first time with efficiency in delay. BP decoder is parallel in nature and is more attractive for low-latency applications. Adder is one of the key hardware blocks in BP decoder. By utilizing the approximate computation schemes and by using adders such as ripple carry adder and parallel self timed adder, delay can be reduced. The design is verified and synthesized using Xilinx ISE 14.7
Downloads
References
[1] Manoharan, Rajesh, et al. "Selection of Intermediate Routes for Secure Data Communication Systems using Graph Theory Application and Grey Wolf Optimization Algorithm in MANETs." IET Networks, 2020.
[2] Rajesh, M., & Gnanasekar, J.M. "Path Observation Based Physical Routing Protocol for Wireless Ad Hoc Networks." Wireless Personal Communications, 97, 1267–1289 (2017). https://doi.org/10.1007/s11277-017-4565-9
[3] Rajesh, M. "Streamlining Radio Network Organizing Enlargement Towards Microcellular Frameworks." Wireless Personal Communications, 2020. https://doi.org/10.1007/s11277-020-07336-9
[4] Xu, Menghui & Jing, Shusen. "Approximate Belief Propagation Decoder for Polar Codes." ICASSP, 2018, pp. 1169–1173.
[5] Arıkan, Erdal. "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels." IEEE Transactions on Information Theory, 55(7), 3051–3073 (2009).
[6] Leduc-Primeau, F., Hemati, S., Gross, W. J., & Mannor, S. "A Relaxed Half-Stochastic Iterative Decoder for LDPC Codes." IEEE Globecom, 2009, pp. 1–6.
[7] Zhang, Chuan, Yuan, Bo, & Parhi, Keshab K. "Reduced-Latency SC Polar Decoder Architectures." IEEE ICC, 2012, pp. 3471–3475.
[8] Zhang, Chuan, & Parhi, Keshab. "Low-Latency Sequential and Overlapped Architectures for Successive Cancellation Polar Decoder." IEEE Transactions on Signal Processing, 61(10), 2429–2441 (2013).
[9] Liang, Xiao, Zhang, Chuan, Xu, Menghui, Zhang, Shunqing, & You, Xiaohu. "Efficient Stochastic List Successive Cancellation Decoder for Polar Codes." IEEE SOCC, 2015, pp. 421–426.
[10] Arıkan, Erdal, Kim, Haesik, Markarian, Garik, Ozgur, U., & Poyraz, Efecan. "Performance of Short Polar Codes Under ML Decoding." IEEE ICT-Mobile Summit, 2009.
[11] Ren, Yuanrui, Zhang, Chuan, Liu, Xing, & You, Xiaohu. "Efficient Early Termination Schemes for Belief Propagation Decoding of Polar Codes." IEEE ASICON, 2015, pp. 1–4.
[12] Yang, Junmei, Zhang, Chuan, Zhou, Huayi, & You, Xiaohu. "Pipelined Belief Propagation Polar Decoders." IEEE ISCAS, 2016, pp. 413–416.
[13] Xu, Menghui, Liang, Xiao, Zhang, Chuan, Wu, Zhizhen, & You, Xiaohu. "Stochastic BP Polar Decoding and Architecture with Efficient Re-Randomization and Directive Register." IEEE SiPS, 2016, pp. 315–320.
[14] Huang, Chu Hsiang, Li, Yao, & Dolecek, Lara. "Belief Propagation Algorithms on Noisy Hardware." IEEE Transactions on Communications, 63(1), 11–24 (2015).
[15] Zhou, Yangcan, Lin, Jun, & Wang, Zhongfeng. "Efficient Approximate Layered LDPC Decoder." IEEE ISCAS, 2017, pp. 1–4.
[16] Giard, Pascal, Sarkis, Gabi, Thibeault, Claude, & Gross, Warren J. "A 237 Gbps Unrolled Hardware Polar Decoder." Electronics Letters, 51(10), 2014.
[17] Sarkis, G., & Gross, W.J. "Increasing the Throughput of Polar Decoders." IEEE Communications Letters, 17(4), 725–728 (2013).
[18] Sarkis, G., Giard, P., Vardy, A., Thibeault, C., & Gross, W.J. "Fast Polar Decoders: Algorithm and Implementation." IEEE Journal on Selected Areas in Communications, 32(5), 946–957 (2014).
[19] Tal, I., & Vardy, A. "List Decoding of Polar Codes." IEEE ISIT, 2011, pp. 1–5.
[20] Niu, K., & Chen, K. "Stack Decoding of Polar Codes." Electronics Letters, 48(12), 695–696 (2012).
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
