论文标题
作为擦除通道的雷利通道上的串联卷积偏振密码降低
Concatenated Convolution-Polar codes over Rayleigh Channels degraded as Erasure Channels
论文作者
论文摘要
极地代码已显示可接近对称二元擦除通道的容量，并且编码和解码的复杂性也很低。无线通道本质上是突发的，提出了一种在无线通道上应用极地代码的方法。本文研究了典型的城市褪色无线通道的性能的性能。无线通道通过使用内部卷积代码和交织来建模为退化的擦除通道。当卷积代码未能纠正任何错误时，相应的位会丢弃并将其视为擦除。我们使用内部卷积代码的不同代码速率在此类降级的无线通道上介绍了极地代码的性能。
Polar codes have been shown to approach capacity of symmetric binary erasure channels and also have low encoding and decoding complexity. Wireless channels are bursty in nature and a method to apply polar codes over wireless channels is proposed. This paper investigates the performance of polar codes over typical urban fading wireless channels. The wireless channel is modeled as a degraded erasure channel by using an inner convolution code and interleaving. When the convolution code fails to correct any errors, the corresponding bits are discarded and treated as erasures. We present the performance of polar codes over such degraded wireless channels using different code rates for the inner convolution code.
