Construction of Polar Codes With Reinforcement Learning.

This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement-learning techniques. The proposed method provides a novel technique for polar-code construction that no longer depends on sorting and selecting bit-channels by reliability, as in most current algorithms. Instead, this technique decides whether the input bits should be frozen in a purely sequential manner. The equivalence of optimizing the polar-code construction for the SCL decoder under this technique and maximizing the expected reward of traversing a maze is drawn. Simulation results show that the standard polar-code constructions that are designed for the successive-cancellation decoder are no longer optimal for the SCL decoder with respect to the frame error rate (FER). In contrast, the proposed game-based construction method finds code constructions that have similar or lower FER for various code lengths and various list sizes of the SCL decoder, compared to the state-of-the-art construction methods. The advantage of the game-based constructions over the standard constructions increases with the channel signal-to-noise ratio and the list size of SCL decoding. Moreover, the learning is highly efficient in terms of the number of required training samples and computational operations. [ABSTRACT FROM AUTHOR]