平行信道编码: Gallager 边界及重复累积码应用
信息论
2007-07-13 v1 math.IT
摘要
本文聚焦于二进制线性块码(或编码集)的性能分析, 其传输通过独立且无记忆的平行信道完成。推导了关于最大似然(ML)解码错误概率的新型上界。将第二版 Duman 和 Salehi(DS2)边界框架推广至平行信道情形, 并推导了优化的倾斜措施。重新审视了 DS2 边界与1961年 Gallager 边界之间的关系, 适用于平行信道。新边界用于获得在ML解码下可达信道区域的改进内部边界。这些改进边界应用于 turbo 类编码集, 重点关注重复累积码及其最新变体。
关键词
引用
@article{arxiv.cs/0609099,
title = {Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes},
author = {Igal Sason and Idan Goldenberg},
journal= {arXiv preprint arXiv:cs/0609099},
year = {2007}
}
备注
5 pages, 4 figures. To be presented in the IEEE Conference for Electrical Engineers in Israel, Eilat, Nov. 15-17, 2006. The full paper version was submitted to the IEEE Trans. on Information Theory in June 2006, and is available at http://arxiv.org/abs/cs.IT/0607002