期刊
IEEE TRANSACTIONS ON COMMUNICATIONS
卷 63, 期 12, 页码 4629-4638出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2015.2488661
关键词
Low-density parity-check codes; convolutional codes; turbo codes; low latency decoding
The performance of short block length low-density parity-check (LDPC) codes (both binary and nonbinary) and convolutional codes is compared under the constraint of tight structural delay constraints. Additionally, we use fundamental bounds on block codes and low rate turbo codes to evaluate our results in a broader context. It turns out that-depending on the code rate and given delay-convolutional codes are able to outperform fundamental lower bounds for block codes, yielding a definite result on the question, which codes are superior in this regime. From a break-even point onward, convolutional codes cannot compete with block codes anymore and nonbinary LDPC codes show the best performance. Turbo codes with a short interleaver length show competitive results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据