Non-return-to-zero Turbo code encoding parameter blind identification method

Abstract

The invention discloses a non-return-to-zero Turbo code encoding parameter blind identification method. In the method, after a non-return-to-zero Turbo code output code length and a codeword output starting point are determined by linear transformation, a matrix is analyzed to determine a generation polynomial of a sub-encoder RSC; and recovery is performed to obtain an interleaved sequence based on an interleaving length and an interleaving starting point obtained by the analysis, sampling weights of sequences to be interleaved and the interleaved sequence are further compared to finally determine interleaving relationships in non-return-to-zero Turbo codes. By the method, the problems of non-return-to-zero Turbo code output code length determination, codeword output starting point determination, interleaving length determination, interleaving starting point determination, interleaving relationship determination and the like are better solved, and the blind identification of non-return-to-zero Turbo code encoding parameters can be realized only by communication contents; and the method has the characteristics of simple algorithm, clear process, high identification speed and the like, and is applied in the fields of intelligent communication, information processing and the like.

Description

technical field [0001] The invention relates to a blind identification method of non-return-to-zero Turbo code encoding parameters in a digital communication system, and is applicable to the fields of intelligent communication, information processing and the like. Background technique [0002] Turbo codes are widely used in modern communication. With the development of digital communication technology, more and more fields will have the demand for Turbo code blind recognition technology. Turbo code blind recognition technology has become the frontier of today's communication research. [0003] The structure of Turbo code is as follows figure 1 as shown, figure 1 (a) is its general coding structure, and the commonly used classic structure is as figure 1 As shown in (b) in, figure 1 The encoder in (b) is mainly composed of two recursive circular convolutional codes (RSCs) cascaded in parallel, and the convolutional encoders are connected by an interleaver. Generally, the en...

AI Technical Summary

Problems solved by technology

[0006] But for the Turbo code of parallel concatenated convolutional code structure, do not see the relevant data of blind recognition aspect at present, the present invention mainly solves the blind recognition problem of non-return-to-zero Turbo code

Images