The existing algorithms based on parity-check relationship in the recognition of interleaver for Turbo codes have weak adaptability at low signal-to-noise ratio (SNR) and are prone to "error propagation" in the recognition process

In order to further improve the fault tolerance and real time of interleaving recognition

we propose two error correction algorithms based on the maximum sequence correlation recognition algorithm

including iterative decoding and small traversal

which make full use of the received data and enhance the error resilience. Simulation results show that the performance of the improved algorithm is obviously better than the original algorithm by adding error correction algorithm

and it only needs 1/3 of the data to complete the identification of all the interleaved parameters under the same conditions and has more than 2dB gain to achieve the identification of all the interleaved parameters under the condition of the same amount of data. In addition

the method based on decoding error correction is universal

which is also applied to other recognition algorithms of parity-check relationship.