An efficient algorithm for the reconstruction of punctured convolutional codes

Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (N, K) convolutional code is obtainable by puncturing some (n, 1)mother codes. The objective of a blind recognition of a channel code is to obtain its generator from the intercepted noisy bit stream. The process of the blind recognition of punctured convolutional codes consists of two parts: the reconstruction of the PGM of the (N, K) punctured convolutional code and the searching process of the mother code and its puncturing pattern. The process of finding the mother code is important for designing the optimum channel decoder. In this paper, a new searching algorithm with the computational complexity of O(K4) polynomial operations is proposed, compared to the existing searching algorithm by M. Cluzeau which requires O(K6) polynomial operations.