首页> 外文期刊>Information Theory, IEEE Transactions on >Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes
【24h】

Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes

机译:周期性时变和尾比特LDPC卷积码的距离限制

获取原文
获取原文并翻译 | 示例

摘要

Existence type lower bounds on the free distance of periodically time-varying LDPC convolutional codes and on the minimum distance of tail-biting LDPC convolutional codes are derived. It is demonstrated that the bound on free distance of periodically time-varying LDPC convolutional codes approaches the bound on free distance of general (nonperiodic) time-varying LDPC convolutional codes as the period increases. The proof of the bound is based on lower bounding the minimum distance of corresponding tail-biting LDPC convolutional codes, which is of interest in its own right.
机译:推导了周期性时变LDPC卷积码的自由距离和咬尾LDPC卷积码的最小距离的存在类型下界。结果表明,随着周期的增加,周期性时变LDPC卷积码的自由距离的界限趋近于普通(非周期性)时变LDPC卷积码的自由距离的界限。边界的证明是基于相应的咬尾LDPC卷积码的最小距离的下限,这本身就是有趣的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号