Performance Bound Analysis on Hamming-Weight-Analysis Algorithm for Blind Recognition of Linear Block Codes

In this paper, the performance bound has been analyzed on Hamming-Weight-Analysis (HWA) algorithm. We first introduce the description of the linear block code and the theoretical analysis of the HWA algorithm. According to the theoretical analysis, we build simulation model and analyze the performance of HWA algorithm. HWA algorithm has a good recognition performance under the condition of low code rate and high BER. Finally, the performance bound of HWA algorithm is given based on the simulation results. The results in this paper have been validated through simulation on MATLAB.