Since the decoding of polar codes goes wrong in sometime, several decoding methods have been proposed to overcome this issue. Unfortunately, the several schemes are still suffering from high decoding complexity. To this end, we propose a reused-public-path successive-cancellation list decoder, which can re-do the decoding from ${E}$ -th level when the current decoding process fails. In addition, a reused public-path scheme is proposed. By properly designing, simulation results in binary-input additive white gaussian noise channel show that this decoding approach provides significant computational complexity reduction in the moderate and high signal-to-noise ratio regime without performance loss.

+More

decoding approach additive white gaussian noise channel inlineformula texmath notationlatexe texmathinlineformulath level signaltonoise ratio reusedpublicpath successivecancellation list decoder which publicpath scheme decoding of polar codes computational complexity

Shibao Li, Lijin Lu, Yunqiang Deng, Tingpei Huang, Jianhang Liu,.A Reused-Public-Path Successive Cancellation List Decoding for Polar Codes With CRC. 21 (12),2566-2569.

Shibao Li, et al."A Reused-Public-Path Successive Cancellation List Decoding for Polar Codes With CRC" 21

Shibao Li, Lijin Lu, Yunqiang Deng, Tingpei Huang, Jianhang Liu,"A Reused-Public-Path Successive Cancellation List Decoding for Polar Codes With CRC"