论文标题
输入分布感知的连续取消列表解码了极地代码
Input-distribution-aware successive cancellation list decoding of polar codes
论文作者
论文摘要
极性代码是线性块代码，可以在无限代码长度下实现通道容量。连续的取消列表（SCL）解码取决于一组并行解码器；它在有限的代码长度下产生良好的错误校正性能，而实施复杂性和功耗的成本增加。目前的文献努力集中在设计时间解码器的复杂性降低上，而缺乏实用的运行时间降低功率方法。在这项工作中，提出了输入分布意识的SCL（IDA-SCL）解码，从而可以通过对解码器的输入进行简单的观察来确定并行性采用的并行性。该技术可确保固定的延迟固定，并允许硬件SCL解码器在每个解码过程之前动态关闭内部并行性的一部分。它可以与现有的复杂性和减功能技术结合使用。仿真结果表明，IDA-SCL可以将SCL的运行时复杂性降低到50 \％。
Polar codes are linear block codes that can achieve channel capacity at infinite code length. Successive cancellation list (SCL) decoding relies on a set of parallel decoders; it yields good error-correction performance at finite code length, at the cost of increased implementation complexity and power consumption. Current efforts in literature focus on design-time decoder complexity reduction, while lacking practical run-time power reduction methods. In this work, input-distribution-aware SCL (IDA-SCL) decoding is proposed, that allows to determine the parallelism to adopt by performing simple observations on the input of the decoder. This technique guarantees fixed, short latency and allows hardware SCL decoders to dynamically shut down part of the internal parallelism before each decoding process. It can be combined with existing complexity- and power- reduction techniques. Simulation results show that IDA-SCL can reduce the run-time complexity of SCL of up to 50\%.
