Exploiting source redundancy to improve the rate of polar codes
Exploiting source redundancy to improve the rate of polar codes
复制标题
利用信源冗余提高Polar码码率
DOI：
10.1109/isit.2017.8006651
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Anxiao Jiang
中科院分区：
文献类型：
--
作者：
Y. Wang;K. Narayanan;Anxiao Jiang
我们考虑一个联合信源信道解码（JSCD）的问题，源编码器在源中留下的残余冗余。我们首先在源编码器输出的冗余模型的边信息信道在信道解码器的输出，并表明，这提高了随机误差指数。然后，我们考虑在这个框架中使用极化码时，使用一系列的t-擦除校正块码的源冗余建模。对于该模型，极化码的速率可以通过解冻一些最初冻结的比特来提高，并且速率的提高取决于码字内冻结比特的分布。我们提出了一个证明，该分布的收敛性，以及收敛的最大速率的改善。显著的性能改进和改进的速率提供了强有力的证据，证明极化码是利用JSCD方案中的源冗余的益处的良好候选。
We consider a joint source-channel decoding (JSCD) problem where the source encoder leaves residual redundancy in the source. We first model the redundancy in the source encoder output as the output of a side information channel at the channel decoder, and show that this improves random error exponent. Then, we consider the use of polar codes in this framework when the source redundancy is modeled using a sequence of t-erasure correcting block codes. For this model, the rate of polar codes can be improved by unfreezing some of originally frozen bits and that the improvement in rate depends on the distribution of frozen bits within a codeword. We present a proof for the convergence of that distribution, as well as the convergence of the maximum rate improvement. The significant performance improvement and improved rate provide strong evidences that polar code is a good candidate to exploit the benefit of source redundancy in the JSCD scheme.
自然冗余的LDPC解码研究
DOI：
10.1109/allerton.2017.8262803
发表时间：
2017
期刊：
Control and Computing (Allerton
影响因子：
--
作者：
Upadhyaya, Pulakesh;Jiang, Anxiao Andrew
通讯作者：
Jiang, Anxiao Andrew