首页> 外文会议>48th Annual Allerton Conference on Communication, Control, and Computing >Coding with a latency constraint: The benefits of sequential decoding
【24h】

Coding with a latency constraint: The benefits of sequential decoding

机译:带有延迟约束的编码:顺序解码的好处

获取原文

摘要

This paper compares the performance of convolutional codes to that of LDPC block codes with identical decoding latencies. The decoding algorithms considered are the Viterbi algorithm and stack sequential decoding for convolutional codes and iterative message passing for LDPC codes. It is shown that, at very low latencies, convolutional codes with Viterbi decoding offer the best performance, whereas for high latencies LDPC codes dominate - and sequential decoding of convolutional codes offers the best performance over a range of intermediate latency values. The “crossover latencies” - i.e., the latency values at which the best code/decoding selection changes - are identified for a variety of code rates (1/2, 2/3, 3/4, and 5/6) and target bit/frame error rates. Thus, sequential decoding can substantially extend the range of latency values over which continuous decoding of convolutional codes proves advantageous compared to LDPC block codes, beyond what is observed when only Viterbi decoding is employed.
机译:本文将卷积码的性能与具有相同解码延迟的LDPC分组码的性能进行了比较。所考虑的解码算法是针对卷积码的Viterbi算法和堆栈顺序解码,以及针对LDPC码的迭代消息传递。结果表明,在非常低的延迟下,采用维特比解码的卷积码可提供最佳性能,而对于高延迟,LDPC码占主导地位-卷积码的顺序解码在一系列中间延迟值范围内可提供最佳性能。针对各种编码率(1 / 2、2 / 3、3 / 4和5/6)和目标位,确定“交叉延迟”(即最佳代码/解码选择更改时的延迟值) /帧错误率。因此,与仅使用维特比解码时所观察到的相比,顺序解码可以实质上扩展等待时间值的范围,在该等待时间值上,与LDPC块代码相比,卷积码的连续解码被证明是有利的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号