Abstract
Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result and re-decode by increasing L, where L is the size of list. When CRC fails, these two algorithms waste useful information from the previous decoding. In this paper, a simplified adaptive successive cancellation list (SAD-SCL) is proposed. Before the re-decoding of updating value L each time, SAD-SCL uses the existing log likelihood ratio (LLR) information to locate the range of burst error bits, and then re-decoding starts at the incorrect bit with the smallest index in this range. Moreover, when the segmented information sequence cannot get the correct result of decoding, the SAD-SCL algorithm uses SC decoding to complete the decoding of the subsequent segmentation information sequence. Furthermore, its decoding performance is almost the same as that of the subsequent segmentation information sequence using the AD-SCL algorithm. The simulation results show that the SAD-SCL algorithm has lower computational complexity than AD-SCL and SCAD-SCL with negligible loss of performance.
Highlights
The polar codes [1], as a channel coding technique for 5G communication, are used as the coding of the control channel for transmitting signaling or synchronizing data
In order to overcome the shortcomings of the existing adaptive successive cancellation list (SCL) algorithm, this paper proposes an improved simplified adaptive successive cancellation list (SAD-SCL) algorithm, which is from the idea of segmented cyclic redundancy check (CRC) of SCAD-SCL
Proposes an improved SAD-SCL algorithm, which is from the idea of segmented CRC of SCAD-SCL
Summary
The polar codes [1], as a channel coding technique for 5G communication, are used as the coding of the control channel for transmitting signaling or synchronizing data. The simplified successive cancellation list (SSCL) algorithm proposed in [9] can identify and simplify the redundancy calculation in SCL This method greatly reduces the time complexity without loss of performance. The algorithm reduces the computation complexity without loss of performance, when a CRC fails, it has to re-decode from the first bit, which greatly increases the decoding delay caused by error bits. Before the re-decoding of updating value L each time, SAD-SCL uses the existing log likelihood ratio (LLR) information to locate the range of burst error bits This proposed method is to locate a starting bit in the re-decoding. The SAD-SCL algorithm further avoids redundant computation in the decoding process with negligible loss of performance and has a lower computational complexity than SCAD-SCL
Sign-in/Register to view highlights & summary 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.
