Abstract
Compared with successive cancellation list (SCL) decoders, belief propagation (BP)-based decoders suffer performance loss in middle-and high-signal-to-noise ratio (SNR) regions. By analyzing the behavior of the incorrect decoding results of the bit-flipping BP decoder with a critical set of order ω (BFBP-CS ω ), we found that undetected errors mainly contribute to the error floor. Based on this observation, we proposed a belief propagation decoder with multiple bit-flipping sets (BFSs) and stopping criteria (BP-MF-MC) in this work. We use multiple stopping criteria to identify undetected errors and a small BFS to find an additional estimated codeword given by the bit-flipping BP (BFBP) function. For uncorrected errors, we use multiple BFSs to find estimated codewords with the BFBP function. Furthermore, we propose a method to dynamically generate a BFS based on the submatrix check. This method can remove unnecessary bit-flipping positions and increase the order of the critical set. Then, the best codeword is selected from all estimated codewords according to the maximum likelihood principle. Numerical results show that BP-MF-MC performs similarly to the cyclic redundancy check-aided SCL (CA-SCL) decoder with list size 16 and is slightly worse than CA-SCL with list size 32.
Highlights
Polar codes are well known for their ability to achieve Shannon capacity and their low encoding and decoding complexity [1]
The main contributions of this paper are summarized as follows: 1) In this work, we propose a belief propagation decoder with multiple bit-flipping sets (BFSs) and stopping criteria (BP-MF-MC), which is a generalization of bit-flipping BP (BFBP)-CSω
The design signal-to-noise ratio (SNR) is 2.5 dB, which is optimized according to the simulation results of CA-successive cancellation list (SCL) decoders with various list sizes over a wide range
Summary
Polar codes are well known for their ability to achieve Shannon capacity and their low encoding and decoding complexity [1]. The successive-cancellation (SC) decoding algorithm proposed by Arıkan [1] is one of the common decoding methods for polar codes. Wang: BP Decoder With Multiple BFSs and Stopping Criteria for Polar Codes achieve significant error-correction performance improvement compared to conventional CRC-aided BP decoders, were proposed. Inspired by the SC-based bit-flipping decoders, a bit-flipping BP decoder using a critical set of order ω (BFBP-CSω) was proposed in [16]. The main contributions of this paper are summarized as follows: 1) In this work, we propose a belief propagation decoder with multiple bit-flipping sets (BFSs) and stopping criteria (BP-MF-MC), which is a generalization of BFBP-CSω. We propose a method to dynamically generate a BFS based on the submatrix check This method can use the submatrix check to remove unnecessary bit-flipping positions.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
