In this paper, we conduct performance comparison of rate compatible parallel concatenated convolutional code (PCCC) and serially concatenated convolutional code (SCCC) in additive white Gaussian noise (AWGN) and frequency selective fading channels. Series of computer simulation results show that the packet error rate (PER) performance of memory 2 SCCC is worse than that of memory 3 PCCC by 0.4-0.8dB at 10-2 PER after the sufficient number of decoding iterations, whereas the complexity of SCCC is lower than that of PCCC by about 39%. Increasing the memory length in SCCC does not lead to performance gain. On the other hand, reducing memory length in PCCC leads to significant performance degradation. However, reducing the number of iterations to half in PCCC leads to lower complexity than SCCC and still offers better PER performance than SCCC in terms of the required Eb/N0 for 10-2 PER. Therefore, PCCC can achieve better trade-off between complexity and performance than SCCC.
展开▼
机译：在本文中，我们在添加白色高斯噪声（AWGN）和频率选择性衰落通道中的速率兼容并联卷积码（PCCC）和串联连接卷积码（SCCC）的性能比较。一系列计算机仿真结果表明，在足够数量的解码后，存储器2 SCCC的数据包错误率（每）存储器2 SCCC的性能比存储器3 PCCC的10.4-0.8db差迭代，而SCCC的复杂性低于PCCC的复杂性约39％。增加SCCC中的存储器长度不会导致性能增益。另一方面，降低PCCC中的存储器长度导致显着的性能下降。然而，将迭代的数量降低到PCCC中的一半导致复杂性低于SCCC，并且在所需的E B / N 0 的方面仍然比SCCC更好每次10 -2 因此，PCCC可以在复杂性和性能之间实现更好的权衡而不是SCCC。
展开▼
