论文标题
滑动窗口极地代码
Sliding Window Polar Codes
论文作者
论文摘要
我们提出了一种新型的耦合技术，用于设计长度为n的极性代码，使其通过大小m <n的滑动窗口进行解码。此功能允许减少解码器的计算复杂性，这是无线通信下行链接场景中的重要可能性。我们的方法基于将插入多内核极性代码框架中的临时内核的设计；该结构启用了代码的滑动窗口解码。仿真结果表明，所提出的滑动窗口极性代码在提议的方案中以独立块的传输优于传输，而成本可忽略不计的开销。
We propose a novel coupling technique for the design of polar codes of length N, making them decodable through a sliding window of size M < N. This feature allows to reduce the computational complexity of the decoder, an important possibility in wireless communication downlink scenarios. Our approach is based on the design of an ad-hoc kernel to be inserted in a multi-kernel polar code framework; this structure enables the sliding window decoding of the code. Simulation results show that the proposed sliding window polar codes outperform the independent blocks transmission in the proposed scenario, at the cost of a negligible decoding overhead.
