摘要
应用列表连续删除(Successive Cancellation List,SCL)译码算法的极化码可以取得优异的译码性能。然而串行译码特性导致该算法的时延很高。提出一种递归信道合并的方法,用来构造多位比特同时译码的并行译码信道。通过递归信道的合并,两位信息比特的联合转移概率可直接由极化信道转移概率计算得到。仿真结果和性能分析表明,在改进译码算法与原始SCL译码算法相比性能损失可忽略不计情况下,提出的两比特同时译码算法有效的减少了译码器的译码时延,而且在一定条件下,降低了译码复杂度。
SCL （Successive Cancellation List） decoding algorithm could enjoy excellent decoding performance of polar code, and however, the characteristics of serial decoding would cause high time-delay. A recursive channel combination method is proposed to construct parallel decoding channel for multi-bit decoding. By this method, joint transition probability of two information bits could be calculated directly from the polarization of channel transition probability. Simulation results and performance analysis indicate that when decoding performance loss of the modified decoding algorithm is negligible, the proposed decoding algorithm could effectively reduce decoding time-delay as compared with the original SCL decoding algorithm, while under certain conditions, reducing the decoding complexity.
出处
《通信技术》
2016年第3期270-273,共4页
Communications Technology
关键词
极化码
SCL译码
时延
并行译码
polar code
SCL decoding
latency
parallel decoding
