Blind reconstruction of punctured convolutional codes is an important problem in non-cooperative communications. In this problem, the goal is to identify the employed mother code and the puncturing pattern. The state-of-the-art method employs a two-stage algebraic-based search technique. First, all the equivalent non-punctured encoders are reconstructed. Then, the mother code and the puncturing pattern are identified by searching over all equivalent encoders. In some cases, the number of equivalent encoders is very large that makes the reconstruction process very complex, time-consuming, and impractical. In this paper, we propose an algebraic-based search method for reconstruction of the mother code and the puncturing pattern that significantly reduces the complexity of blind reconstruction. The problem is formulated and solved in the general case of mother codes with more than one input bit. The proposed algorithm also works well for non-punctured convolutional codes.

穿孔卷积码的盲重构是非合作通信中的重要问题。在这个问题中，目标是识别所使用的母码和打孔模式。最先进的方法采用了基于二级代数的搜索技术。首先，重建所有等效的非打孔编码器。然后，通过搜索所有等效编码器来识别母码和打孔图案。在某些情况下，等效编码器的数量非常大，这使得重建过程非常复杂，耗时且不切实际。在本文中，我们提出了一种基于代数的搜索方法来重构母码和删截模式，从而显着降低了盲目重构的复杂性。在具有多于一个输入位的母代码的一般情况下，提出并解决了该问题。所提出的算法也适用于非打孔卷积码。