Comparative study of partitioned and parallel concatenated convolutional codes with puncturing

We design and implement the partitioned convolutional code (PCC) and the parallel-concatenated nonrecursive convolutional code (PCNCC). A comparison of the two codes is then carried out based on the following aspects: BER, encoder and decoder complexity, effective code rate, and throughput. It is shown that the PCNCC has identical error performance to the PCC but with less hardware complexity and a slightly higher effective code rate. Also, puncturing is used to increase the code rate of the PCNCC and computer simulation results show that the best PCNCC are those in which the component encoders are derived from the basic encoder