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\%.

翻译：极地代码是能够以无限的代码长度实现频道容量的线性区代码。 连续的取消列表(SCL)解码依赖于一套平行的解码器;它以更高的执行复杂性和电耗成本在有限的代码长度上产生良好的错误校正性,其代价是增加执行复杂性和电耗。 目前在文献中的努力侧重于设计- 时间解码器复杂性的减少,而同时又缺乏实用的运行时间节能减能方法。 在这项工作中,提出了输入- 分布- 可见 SCL(IDA- SCL)解码法,通过对解码器输入进行简单的观察来确定要采用的平行性。 这一技术保证了固定的、短的延时性,并允许硬件的SCL解码器在每次解码过程之前动态地关闭内部平行状态的一部分。 它可以与现有的复杂性和减少功率的技术相结合。 模拟结果显示, IDA- SCL(IDA- SCL) 可以将 SCC的运行时间复杂性降低到50 ⁇ 。