Abstract:

An effective method of recognition is proposed to solve the Turbo codes on the trellis termination problem. According to the special structure of Turbo codes on trellis termination, exhaustively search for the number of columns of the matrix to find related column average maximum, and complete recognition of the code length and the start point of Turbo codes on trellis termination. Then, build the interleaver model of Turbo codes on trellis termination, solve the interleaver parameter with the method of using the bitwise contrast based on hierarchy. Simulation results show that this method has better recognition results, which verify the validity and robustness of the method.