Abstract:

Since the existing matrix analysis method has a poor performance when solving the blind recognition problems of linear block codes, an improved method is proposed. Firstly, Gauss elimination algorithm is applied to the interception matrix and the normalized weight of each column is calculated, then a statistical estimation is used to find correlation columns in the matrix, based on which a statistical index is setted up to get the code length according to the distribution of maximum values. To achieve successful recognition of code start bit under high bit error rate (BER), shift operation with many times of average is adopted after code length identification. Simulation results show that the proposed method has a better faulttolerant performance when comparing to the traditional matrix analysis method, while the computational complexity is approximately the same, thus it can be more effective for the blind recognition problem.