论文标题
CRC辅助高速公路卷积代码，其列表解码为短。
CRC-Aided High-Rate Convolutional Codes With Short Blocklengths for List Decoding
论文作者
论文摘要
最近，已证明具有循环冗余检查（CRC）辅助列表解码的速率-1/N零端端（ZT）和尾巴（TB）卷积代码（CCS），可密切接近用于短块长度的随机编码联盟（RCU）。本文为速率（N-1）/N ZT和TB CC设计的CRC多项式设计，其较短的块长度。本文考虑了标准速率 - （N-1）/N CC多项式和速率 - （N-1）/N设计，这是由于刺穿速率1/2代码而产生的。选择CRC多项式以最大化最小距离D_MIN并最大程度地减少最近邻居A_（D_MIN）的数量。对于标准速率 - （N-1）/N代码，Yamada等人提出的双重格子的利用。降低了CRC辅助串行列表Viterbi解码（SLVD）的复杂性。 TBCC的CRC辅助SLVD紧密接近128的区块长度。本文比较了FER性能（与RCU结合的差距）和CRC辅助标准和穿刺ZTCCS和TBCC的复杂性。本文还探讨了三个TBCC解码器的复杂性 - 性能权衡：一种单格式方法，一种多特雷利斯方法以及修改后的单格式方法，并使用围绕Viterbi算法的包装进行预处理。
Recently, rate-1/n zero-terminated (ZT) and tail-biting (TB) convolutional codes (CCs) with cyclic redundancy check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short blocklengths. This paper designs CRC polynomials for rate- (n-1)/n ZT and TB CCs with short blocklengths. This paper considers both standard rate-(n-1)/n CC polynomials and rate- (n-1)/n designs resulting from puncturing a rate-1/2 code. The CRC polynomials are chosen to maximize the minimum distance d_min and minimize the number of nearest neighbors A_(d_min) . For the standard rate-(n-1)/n codes, utilization of the dual trellis proposed by Yamada et al. lowers the complexity of CRC-aided serial list Viterbi decoding (SLVD). CRC-aided SLVD of the TBCCs closely approaches the RCU bound at a blocklength of 128. This paper compares the FER performance (gap to the RCU bound) and complexity of the CRC-aided standard and punctured ZTCCs and TBCCs. This paper also explores the complexity-performance trade-off for three TBCC decoders: a single-trellis approach, a multi-trellis approach, and a modified single-trellis approach with pre-processing using the wrap around Viterbi algorithm.
