Min-Oh Jeong | Searcharxiv

arXiv2019

SC-Fano Decoding of Polar Codes

In this paper, we present a novel decoding algorithm of a polar code, named SC-Fano decoding, by appropriately incorporating the Fano sequential decoding into the standard successive-cancellation (SC) decoding. The proposed SC-Fano decoding follows the basic procedures of SC decoding with an additional operation to evaluate the reliability (or belief) of a current partial path. Specifically, at every decoding stage, it decides whether to move forward along a current path or move backward to find a more likelihood path. In this way, SC-Fano decoding can address the inherent drawback of SC decoding such as one wrong-decision will surely lead to a wrong codeword. Compared with the other improvements of SC decoding as SC-List (SCL) and SC-Stack (SCS) decodings, SC-Fano decoding has much lower memory requirement and thus is more suitable for hardware implementations. Also, SC- Fano decoding can be viewed as an efficient implementation of SC-Flip (SCF) decoding without the cost of cyclic-redundancy-code (CRC). Simulation results show that the proposed SC-Fano decoding significantly enhances the performance of SC decoding with a similar complexity as well as achieves the performance of SCL decoding with a lower complexity.

eess.SP↗

arXiv2018

An Efficient Construction of Rate-Compatible Punctured Polar (RCPP) Codes Using Hierarchical Puncturing

In this paper, we present an efficient method to construct a good rate-compatible punctured polar (RCPP) code. One of the major challenges on the construction of a RCPP code is to design a common information set which is good for all the codes in the family. In the proposed construction, a common information set is simply optimized for the highest-rate punctured polar code in the family and then, this set is updated for each other code by satisfying the condition that information bits are unchanged during retransmissions. This is enabled by presenting a novel hierarchical puncturing and information-copy technique. To be specific, some information bits are copied to frozen-bit channels, which yields an information-dependent frozen vector. Then, the updated information sets are obtained by appropriately combining the common information set and an information-dependent frozen vector. Moreover, the impact of unknown frozen bits are resolved using the proposed hierarchical puncturing. Simulation results demonstrate that the proposed RCPP code attains a significant performance gain (about 2dB) over a benchmark RCPP code where both codes use the same puncturing patterns but the latter uses the conventional all-zero frozen vector. Therefore, the proposed method would be crucial to construct a good RCPP code.

cs.IT↗