作者: Zhang, Zhaoyang; Zhang, Liang; Wang, Xianbin; 等.
来源：IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 卷: 34 期: 2 页: 292-302 出版年: FEB 2016
We observe for the first time that, in list decoding of Polar codes, a correct path will not split with high probability while an incorrect path will split almost surely in the subsequent decoding. Then a new splitting rule is proposed, which significantly reduces the unnecessary splits. Moreover, under this rule the decoding paths will merge to a single one with probability 1 at a certain position without performance loss. In this way, the overall decoding complexity and latency can be reduced by as much as 80% in typical cases.
