Journal of Computer and Communications

Volume 8, Issue 7 (July 2020)

ISSN Print: 2327-5219   ISSN Online: 2327-5227

Google-based Impact Factor: 1.24  Citations  

Improved Polar Decoder Utilizing Neural Network in Fast Simplified Successive-Cancellation Decoding

HTML  XML Download Download as PDF (Size: 623KB)  PP. 90-99  
DOI: 10.4236/jcc.2020.87008    269 Downloads   772 Views  
Author(s)

ABSTRACT

Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature. Fast simplified successive-cancellation decoding algorithm improves the situation in theoretically but not performs well as expected in practical for the workload of nodes identification and the existence of many short blocks. Meanwhile, Neural network (NN) based decoders have appeared as potential candidates to replace conventional decoders for polar codes. But the exponentially increasing training complexity with information bits is unacceptable which means it is only suitable for short codes. In this paper, we present an improvement that increases decoding efficiency without degrading the error-correction performance. The long polar codes are divided into several sub-blocks, some of which can be decoded adopting fast maximum likelihood decoding method and the remained parts are replaced by several short codes NN decoders. The result shows that time steps the proposed algorithm need only equal to 79.8% of fast simplified successive-cancellation decoders require. Moreover, it has up to 21.2 times faster than successive-cancellation decoding algorithm. More importantly, the proposed algorithm decreases the hardness when applying in some degree.

Share and Cite:

Fang, J. and Liu, C. (2020) Improved Polar Decoder Utilizing Neural Network in Fast Simplified Successive-Cancellation Decoding. Journal of Computer and Communications, 8, 90-99. doi: 10.4236/jcc.2020.87008.

Cited by

No relevant information.

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.