Multiple candidates successive-cancellation decoding of polar codes
暂无分享,去创建一个
This paper proposes an effective scheme to improve the error performance of conventional successive-cancellation (SC) decoding algorithm for polar codes. The proposed scheme, which is referred to as the multiple candidates (MC) scheme constructs a set of candidates for the starting vector for SC decoding. Each candidate vector in the set is generated by adding a random offset of the original received vector. Simulation results show that conventional SC decoding algorithm applying the MC scheme achieves noticeable gains over the original SC algorithms with reasonable increase in computational cost.
[1] Erdal Arikan,et al. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.
[2] Alexander Vardy,et al. How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.
[3] Frank R. Kschischang,et al. A Simplified Successive-Cancellation Decoder for Polar Codes , 2011, IEEE Communications Letters.