Recently, rate-1/n zero-terminated and tail-biting convolutional codes (ZTCCs and TBCCs) 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 CRCs for rate-(n-1)/n CCs with short blocklengths, considering both the ZT and TB cases. The CRC design seeks to optimize the frame error rate (FER) performance of the code resulting from the concatenation of the CRC and the CC. Utilization of the dual trellis proposed by Yamada et al. lowers the complexity of CRC-aided serial list Viterbi decoding (SLVD) of ZTCCs and TBCCs. CRC-aided SLVD of the TBCCs closely approaches the RCU bound at a blocklength of 128. Application of the multi-trellis approach and Wrap Around Viterbi Algorithm (WAVA) further improves the decoding efficiency while maintaining the decoder's error-detection and correction performance.
翻译:最近,以循环-冗余检查(CRC)辅助名单解码的零断裂和尾尾咬混合代码(ZTCCs和TBCCs)被证明接近随机编码联盟(RCU)的短长条形线,本文设计了以短块长度的速(n-1)/n CCs的CRCs,同时考虑到ZT和TB两种情况。CRC的设计旨在优化《儿童权利公约》和《公约》交配产生的代码的框架误差率(FER)。Yamada等人提议的双轨线的使用降低了《儿童权利公约》辅助的ZTCC和TBCCs的维特比序列编码(SLVD)的复杂程度。《儿童权利公约》援助TBCCs的SLVDs密切接近了RCU,时间长度为128个,应用多管线线路和圆环维特比阿尔戈里特姆(WAVA)应用多链条形方法,进一步提高了解码效率,同时保持了解码错误和误判。