摘要
极化码是基于信道极化(Channel Polarization)现象,首次以构造性的方法逼近信道容量的码。尽管极化码的编码和译码都具有较低的复杂度,但在中短码长时,极化码的性能并不理想,甚至不如LDPC和Turbo码。针对这一问题,提出了一种采用CRC作为内码,并与极化码级联的方案。与现有方案不同的是算法在译码时仅对内码位之间的位采用列表译,从而获得较低的译码复杂度。从仿真结果看,算法在BEC信道下可以显著地提高极化码的性能,并接近最大似然译码的性能;在AWGN信道下可以获得0.5dB的性能改善。
A method is proposed to improve the short and moderate block lengths performance of polar codes on basis of using short classic error codes as Inner block codes. Different from usual schemes, approach is a combina- tion of successive cancellation and list decoding idea supplied with cyclic redundancy check when decoding between the indexes of inner block codes. Simulation results in the binary erasure channel and binary-input additive white Gaussian noise channel show a significant performance improvement and very close to the ML bound with low com- plexity in BEC. And have a significant performance improvement of approx 0. 5 dB.
出处
《科学技术与工程》
北大核心
2013年第19期5657-5660,共4页
Science Technology and Engineering
基金
陕西省教育厅科学技术项目(2013JK1208)资助
