技术领域Technical Field
本发明涉及通信技术领域，尤其涉及一种Turbo码删余模式的识别方法。The present invention relates to the field of communication technology, and in particular to a method for identifying a Turbo code puncturing mode.
背景技术Background technique
非合作通信是一种特殊的通信模式，其中的通信实体并不与发送方实体共享信息或资源。在这类模式下，接收方通常无法获取发送方的先验信息，例如编码类型以及编码参数，因而无法选择合适的译码器并为其设置正确参数，给译码获取原始数据带来巨大挑战。为了应对以上问题，信道编码盲识别技术应运而生，这是一种仅从接受到的信号中就可识别出具体编码参数的技术。该技术在军用和民用通信中均得到了广泛应用，例如在智能自动化通信领域，信道编码盲识别技术可识别出随环境不断变化的编码参数信息，帮助完成自适应决策，在军事通信领域，该技术对于军事侦查和信息对抗非常有帮助。Non-cooperative communication is a special communication mode in which the communication entity does not share information or resources with the sender entity. In this mode, the receiver usually cannot obtain the sender's prior information, such as the coding type and coding parameters, and therefore cannot select a suitable decoder and set the correct parameters for it, which brings great challenges to decoding and obtaining the original data. In order to deal with the above problems, channel coding blind identification technology came into being. This is a technology that can identify specific coding parameters only from the received signal. This technology has been widely used in both military and civilian communications. For example, in the field of intelligent automation communications, channel coding blind identification technology can identify coding parameter information that changes with the environment and help complete adaptive decision-making. In the field of military communications, this technology is very helpful for military reconnaissance and information confrontation.
在信道编码技术中，Turbo码因其卓越的误差校正能力而占据了重要地位，因此，信道编码盲识别领域中，盲识别Turbo码的参数成为关键任务。研究接收端的Turbo码盲识别技术，通过对接收码字的精确处理和分析，使接收方能够在未知具体编码规则的情况下估计出关键编码参数，可为后续信号译码提供依据。In channel coding technology, Turbo codes occupy an important position due to their excellent error correction capabilities. Therefore, in the field of blind recognition of channel coding, blind recognition of Turbo code parameters has become a key task. Research on blind recognition technology of Turbo codes at the receiving end enables the receiver to estimate key coding parameters without knowing the specific coding rules through accurate processing and analysis of received codewords, which can provide a basis for subsequent signal decoding.
目前，非删除Turbo码的盲识别技术已日趋成熟，删余模式为[0 1]的删余Turbo码盲识别技术也已取得一些成果。然而，实际系统中Turbo码的删余模式是种类繁多且未知的，如何识别出Turbo码的删余模式，是当前删余Turbo码识别的重要研究方向。此外，Turbo编码作为一种分组码，码块内部的数据排列模式有两种，只有正确区分数据排列模式，才能提取出信息位和校验位，以此作为删余模式识别的基础。At present, the blind recognition technology of non-erased Turbo codes has become increasingly mature, and the blind recognition technology of punctured Turbo codes with a puncturing pattern of [0 1] has also achieved some results. However, the puncturing patterns of Turbo codes in actual systems are diverse and unknown. How to identify the puncturing patterns of Turbo codes is an important research direction for the current punctured Turbo code recognition. In addition, as a block code, Turbo coding has two data arrangement patterns within the code block. Only by correctly distinguishing the data arrangement patterns can the information bits and check bits be extracted, which serves as the basis for puncturing pattern recognition.
发明内容Summary of the invention
为解决现有技术存在的局限和缺陷，本发明提供一种Turbo码删余模式的识别方法，包括：In order to solve the limitations and defects of the prior art, the present invention provides a method for identifying a Turbo code puncturing pattern, comprising:
获得原始数据，所述原始数据包括R0路数据、R1路数据、R2路数据，所述R0路数据的信息位标记为R0路，所述R1路数据的校验位标记为R1路，所述R2路数据的校验位标记为R2路，所述R1路数据和所述R2路数据复用为R12路数据；Obtaining original data, the original data comprising R0-path data, R1-path data, and R2-path data, the information bit of the R0-path data is marked as R0-path, the check bit of the R1-path data is marked as R1-path, the check bit of the R2-path data is marked as R2-path, and the R1-path data and the R2-path data are multiplexed into R12-path data;
识别数据的排列模式；Identify patterns in data;
根据数据的排列模式提取所述R0路数据和所述R12路数据；Extract the R0-way data and the R12-way data according to the data arrangement mode;
使用RSC分量编码器对所述R0路数据进行编码，生成非删余Turbo码的R1路数据；Encode the R0 data using an RSC component encoder to generate R1 data of a non-punctured Turbo code;
将所述R1路数据和所述R12路数据每隔T位取出进行比较，获得匹配率M，所述匹配率M=P/Q，其中P为匹配位数，Q为每隔T位取出的R1路数据的总长度；The R1 data and the R12 data are taken out everyT bits and compared to obtain a matching rateM , wherein the matching rateM=P/Q , whereP is the number of matching bits andQ is the total length of the R1 data taken out everyT bits;
当T等于真实删余周期的整数倍时，所述匹配率M达到最大值，将匹配率达到最大值时的所有T取最大公因数即为删余周期；WhenT is equal to an integer multiple of the real puncturing period, the matching rateM reaches a maximum value, and the greatest common factor of allTs when the matching rate reaches the maximum value is the puncturing period;
根据删余周期T将所述R1路数据和所述R12路数据分别划分为g组，每组T位数据一一对应；Divide the R1 data and the R12 data intog groups according to the puncturing periodT , each group ofT bits of data corresponds to each other;
遍历g组，每组比对所述R1路数据和所述R12路数据中索引相同的T位数据，若某位出现数据重合，T位中该位重合位数加一；Traverseg groups, and comparethe T -bit data with the same index in the R1 data and the R12 data in each group. If data overlaps in a certain bit, the number of the overlapping bits in theT bits is increased by one;
对g组累积求和，获得T位中每一位总的重合位数，所述重合位数的最大值为g；Cumulatively sumthe g groups to obtain the total number of overlapping digits for each of theT digits, where the maximum value of the overlapping digits isg ;
选择T位中总的重合位数大于的位，其中/>为门限，/>的数值设置为55%，当总重合位数大于该门限时，删余时所述R12路数据在该位置取的是所述R1路数据；Select the number ofT positions where the total number of overlaps is greater than of bits, where /> is the threshold, /> The value is set to 55%. When the total number of overlapping bits is greater than the threshold, the R12 data is replaced by the R1 data at this position during puncturing.
输出数据模式和所述删余周期。The output data pattern and the puncturing period.
可选的，所述识别数据的排列模式的步骤包括：Optionally, the step of identifying the arrangement pattern of data includes:
识别数据的交织长度L；Identify the interleaving lengthL of the data;
将Turbo码字构造为q行2L列的分析矩阵A；The Turbo codeword is constructed as an analysis matrix A withq rows and 2L columns;
获取所述分析矩阵A的前L列对所述分析矩阵A进行分析，判断所述分析矩阵A是否满秩；Obtain the firstL columns of the analysis matrix A to analyze the analysis matrix A and determine whether the analysis matrix A is full rank;
若判断结果为所述分析矩阵A满秩，数据的排列模式为分块排列模式，若判断结果为所述分析矩阵A秩缺，数据的排列模式为交叉排列模式。If the judgment result is that the analysis matrix A is full rank, the data arrangement mode is a block arrangement mode; if the judgment result is that the analysis matrix A is rank-deficient, the data arrangement mode is a cross arrangement mode.
可选的，所述根据数据的排列模式提取所述R0路数据和所述R12路数据的步骤之后包括：Optionally, after the step of extracting the R0 path data and the R12 path data according to the data arrangement mode, the step includes:
使用删余矩阵表示删余模式，所述删余矩阵表示为一个01矩阵，列数T为删余周期，行数为1；A puncturing matrix is used to represent a puncturing pattern, wherein the puncturing matrix is represented as a 01 matrix, the number of columnsT is the puncturing period, and the number of rows is 1;
所述删余矩阵中1的位置表示所述R12路数据取的是删余前的R1路数据，所述删余矩阵中0的位置表示所述R12路数据取的是删余前的R2路数据；The position of 1 in the puncturing matrix indicates that the R12-way data is the R1-way data before puncturing, and the position of 0 in the puncturing matrix indicates that the R12-way data is the R2-way data before puncturing;
输出所述删余矩阵。The puncture matrix is output.
可选的，所述删余周期T的取值范围是大于等于2而且小于等于10。Optionally, the value range of the puncturing periodT is greater than or equal to 2 and less than or equal to 10.
本发明具有下述有益效果：The present invention has the following beneficial effects:
本发明提供一种Turbo码删余模式的识别方法，根据数据的排列模式提取R0路数据和R12路数据，使用RSC分量编码器对R0路数据进行编码，生成非删余Turbo码的R1路数据，将R1路数据和R12路数据每隔T位取出进行比较，获得匹配率M，当T等于真实删余周期的整数倍时，匹配率M达到最大值，将匹配率达到最大值时的所有T取最大公因数为删余周期，根据删余周期T将R1路数据和R12路数据分别划分为g组，每组T位数据一一对应，遍历g组，每组比对R1路数据和R12路数据中索引相同的T位数据，若至少一位数据重合，T位中该位重合位数加一，对g组累积求和，获得T位中每一位总的重合位数，重合位数的最大值为g，选择T位中总的重合位数大于预设值的位，输出数据模式和删余矩阵。本发明提供的Turbo码删余模式的识别方法对删余周期和删余矩阵的识别准确率高。The invention provides a method for identifying a Turbo code puncturing pattern. The method comprises the following steps: extracting R0 data and R12 data according to a data arrangement pattern, encoding the R0 data by using an RSC component encoder, generating R1 data of a non-punctured Turbo code, taking out the R1 data and the R12 data every T bits for comparison, obtaining a matching rate M, and obtaining a matching rate M. When T is equal to an integer multiple of a real puncturing period, the matching rate M reaches a maximum value. The greatest common factor of allTs when the matching rate reaches the maximum value is taken as the puncturing period. According to the puncturing period T, the R1 data and the R12 data are respectively divided into g groups, each group of T-bit data corresponds to each other, traversing the g groups, comparing the T-bit data with the same index in the R1 data and the R12 data in each group, and if at least one bit of data overlaps, the number of overlapped bits of the bit in the T bits is increased by one, accumulating and summing the g groups, obtaining a total number of overlapped bits for each bit in the T bits, the maximum value of the number of overlapped bits is g, selecting a bit whose total number of overlapped bits in the T bits is greater than a preset value, and outputting a data pattern and a puncturing matrix. The method for identifying a Turbo code puncturing pattern provided by the present invention has high recognition accuracy for a puncturing period and a puncturing matrix.
附图说明BRIEF DESCRIPTION OF THE DRAWINGS
图1为本发明实施例一提供的Turbo码的编码结构示意图。FIG. 1 is a schematic diagram of a coding structure of a Turbo code provided in Embodiment 1 of the present invention.
图2为本发明实施例一提供的码字内部数据排列模式示意图。FIG. 2 is a schematic diagram of a codeword internal data arrangement mode provided in Embodiment 1 of the present invention.
图3为本发明实施例一提供的Turbo码删余模式的识别方法的流程图。FIG. 3 is a flow chart of a method for identifying a Turbo code puncturing pattern according to a first embodiment of the present invention.
图4为本发明实施例一提供的删余周期识别结果示意图。FIG. 4 is a schematic diagram of a puncturing cycle identification result provided in Embodiment 1 of the present invention.
图5为本发明实施例一提供的删余矩阵识别结果示意图。FIG5 is a schematic diagram of a puncture matrix recognition result provided in Embodiment 1 of the present invention.
图6为本发明实施例一提供的删余周期识别准确率示意图。FIG6 is a schematic diagram of the accuracy of puncturing cycle recognition provided by the first embodiment of the present invention.
图7为本发明实施例一提供的删余矩阵识别准确率示意图。FIG. 7 is a schematic diagram of the recognition accuracy of the puncturing matrix provided in the first embodiment of the present invention.
具体实施方式Detailed ways
为使本领域的技术人员更好地理解本发明的技术方案，下面结合附图对本发明提供的Turbo码删余模式的识别方法进行详细描述。In order to enable those skilled in the art to better understand the technical solution of the present invention, the method for identifying a Turbo code puncturing pattern provided by the present invention is described in detail below with reference to the accompanying drawings.
实施例一Embodiment 1
Turbo码的编码结构如图1所示。原始数据经过Turbo编码分为三路，第一路信息位标记为R0路，第二路校验位标记为R1路，第三路校验位标记为R2路。删余时，信息位保持不变，R1和R2路通过不同的删余模式复用为一路，标记为R12路，即可得到删余Turbo码。The coding structure of Turbo code is shown in Figure 1. The original data is divided into three paths after Turbo coding. The first path of information bits is marked as R0 path, the second path of check bits is marked as R1 path, and the third path of check bits is marked as R2 path. When puncturing, the information bits remain unchanged. R1 and R2 paths are multiplexed into one path through different puncturing modes, marked as R12 path, and the punctured Turbo code can be obtained.
删余Turbo码的码块内部，R1路信息位和R12路校验位的排列模式有两种，一种是分块模式，一种是交叉模式。假设交织长度为6，码块长度为12，R0路输出码字为xi，R12路输出码字为yi，则经过交叉模式和分块模式的最终输出码字构成如图2所示。There are two arrangement modes of R1 information bits and R12 check bits in the code block of the punctured Turbo code, one is the block mode and the other is the cross mode. Assuming that the interleaving length is 6, the code block length is 12, the R0 output codeword is xi, and the R12 output codeword is yi, then the final output codeword structure after the cross mode and block mode is shown in Figure 2.
识别删余矩阵的整体流程图如图3所示。首先需要识别数据的排列模式，以便提取出正确的R0路信息位数据和R12路校验位数据。需要注意的是，删余模式识别算法需要已知删余Turbo码的递归系统卷积码（Recursive System Convolutional，RSC）结构的分量编码器。The overall flow chart of identifying the puncturing matrix is shown in Figure 3. First, the data arrangement pattern needs to be identified in order to extract the correct R0 information bit data and R12 check bit data. It should be noted that the puncturing pattern recognition algorithm requires a component encoder of the recursive system convolutional code (RSC) structure of the known punctured Turbo code.
在得到数据排列模式后，根据数据排列模式提取出R0路和R12路，将R0路数据经过RSC编码后生成非删余Turbo码的R1路数据。算法识别结果依赖于生成的R1路和R12路的数据重合率，重合率定义为：R1和R12路的数据重合位数与总数据长度的比值。After obtaining the data arrangement pattern, the R0 and R12 paths are extracted according to the data arrangement pattern, and the R0 path data is RSC encoded to generate the R1 path data of the non-punctured Turbo code. The algorithm recognition result depends on the data overlap rate of the generated R1 and R12 paths, which is defined as the ratio of the number of overlapped bits of the R1 and R12 paths to the total data length.
为方便后续讨论，将删余模式表示为一个01矩阵，该矩阵称为删余矩阵，列数T为删余周期，行数为1。01矩阵中1的位置表示R12路取的是删余前的R1路数据，反之0表示R12路取的是删余前的R2路数据。To facilitate subsequent discussion, the puncturing pattern is represented as a 01 matrix, which is called the puncturing matrix. The number of columnsT is the puncturing period and the number of rows is 1. The position of 1 in the 01 matrix indicates that the R12 path takes the R1 path data before puncturing, and vice versa, 0 indicates that the R12 path takes the R2 path data before puncturing.
本发明通过对重构的支路序列和接收到的校验位序列进行匹配分析，利用数据抽取周期与删余周期相等时匹配度最高的特点完成识别。对于删余矩阵的识别，本发明逐个确定删余矩阵中各位的数值从而直接得到删余矩阵，依据是对多组数据的重合位数累加，删余矩阵为0或1的位置的累加结果具有明显的区分度，通过设置合理的区分门限能获得更好的抗误码性能。The present invention performs matching analysis on the reconstructed branch sequence and the received check bit sequence, and completes the identification by utilizing the characteristic that the matching degree is the highest when the data extraction period is equal to the puncturing period. For the identification of the puncturing matrix, the present invention determines the values of each bit in the puncturing matrix one by one to directly obtain the puncturing matrix, based on the accumulation of the overlapping bits of multiple groups of data, and the accumulation result of the positions of 0 or 1 in the puncturing matrix has obvious discrimination, and better error resistance performance can be obtained by setting a reasonable discrimination threshold.
1、估计数据排列模式1. Estimating data arrangement patterns
无论何种数据排列模式，均可采用已有算法识别出交织长度L。将Turbo码字构造为一个q行2L列的分析矩阵A。由于在长度为2L的码块中，存在R0路经过RSC编码后的数据，且每行码字经过相同的RSC编码和删余模式处理，每行的线性相关位置一定，故分析矩阵A中一定存在线性相关列。Regardless of the data arrangement mode, the interleaving lengthL can be identified by using the existing algorithm. The Turbo codeword is constructed as an analysis matrix A withq rows and2L columns. Since there are R0-path RSC-encoded data in the code block of length2L , and each row of codewords is processed by the same RSC encoding and puncturing mode, the linear correlation position of each row is certain, so there must be a linear correlation column in the analysis matrix A.
取分析矩阵A的前L列进行分析。对于分块排列模式，分析矩阵前L列为完全随机的原始数据，不存在线性相关列，矩阵满秩。对于交叉排列模式，分析矩阵前L列存在R0路和R0路经过RSC编码后的数据，存在线性相关列，矩阵秩亏。因此，通过分析矩阵A是否满秩，可以判断出是哪种数据排列模式。Take the firstL columns of the analysis matrix A for analysis. For the block arrangement mode, the firstL columns of the analysis matrix are completely random original data, there are no linearly correlated columns, and the matrix is full rank. For the cross arrangement mode, the firstL columns of the analysis matrix contain R0 and R0 data after RSC encoding, there are linearly correlated columns, and the matrix is rank deficient. Therefore, by analyzing whether the matrix A is full rank, it is possible to determine which data arrangement mode it is.
2、估计删余周期2. Estimated pruning cycle
根据典型删余turbo码的参数设置，删余周期T可能的取值范围一般在2到10之间。遍历删余周期，针对每个取值进行如下操作：According to the parameter settings of typical punctured turbo codes, the possible value range of the puncturing periodT is generally between 2 and 10. Traverse the puncturing period and perform the following operations for each value:
步骤1：根据所述提取出R1路和R12路，将R1路和R12路数据每隔T位取出进行比较，求出该T下的匹配率M。M=P/Q，其中P为匹配位数，Q为取出的R1路数据的总长度。Step 1: Extract R1 and R12 as described above, take out R1 and R12 data everyT bits for comparison, and calculate the matching rateM under theT.M=P/Q , whereP is the number of matching bits, andQ is the total length of the extracted R1 data.
步骤2：当T等于真实删余周期的整数倍时，匹配率M达到最大值，这些位置的最大公因数即为删余周期。匹配率达最大值1，说明在删余时，R12路数据每隔周期T一定取的是R1路数据，导致R1路提取出的数据与R12路提取出的完全一致。当周期估计错误时，R1路数据与R12路中取自R2路的数据匹配，匹配率降低。Step 2: WhenT is equal to an integer multiple of the actual puncturing period, the matching rateM reaches its maximum value, and the greatest common factor of these positions is the puncturing period. The matching rate reaches the maximum value of 1, indicating that during puncturing, the data on R12 must be taken from the data on R1 every periodT , resulting in the data extracted from R1 being exactly the same as that extracted from R12. When the period estimation is wrong, the data on R1 matches the data taken from R2 in R12, and the matching rate decreases.
3、估计删余矩阵中1的位置3. Estimate the position of 1 in the punctured matrix
步骤1：根据已识别出的删余周期T，将R1和R12路数据分别划分为g组，每组T位数据一一对应。Step 1: According to the identified puncturing periodT , divide the R1 and R12 data intog groups respectively, with each group ofT bits of data corresponding to each other.
步骤2：遍历g组，每组比对R1和R12路中索引相同的T位数据，若某位数据重合，则T位中该位重合位数加一。对g组累积求和，得出T位中每一位总的重合位数，重合位数最大为组数g。Step 2: Traverseg groups, and compare theT -bit data with the same index in R1 and R12 in each group. If a bit of data overlaps, the number of overlapping bits inT is increased by 1. Cumulatively sumthe g groups to obtain the total number of overlapping bits for each bit inT. The maximum number of overlapping bits is the number of groupsg .
步骤3：为应对误码，选择T位中总重合位数大于的位，即为删余矩阵中1的位置，其中，/>为门限，本实施例中取值55%。这意味着删余时R12路数据在该位置取的是R1路数据。至此删余模式识别完成。Step 3: To deal with bit errors, select the number of bits with the total number of overlaps in theT bit to be greater than The bit is the position of 1 in the puncture matrix, where / > is the threshold, and in this embodiment, the value is 55%. This means that when puncturing, the R12 data at this position is the R1 data. At this point, the puncturing pattern recognition is completed.
本实施例中，选取交织长度为30，RSC生成多项式为[23,35]，删余模式为[1 0 1 10]的Turbo码。第一组数据码块内部数据排列模式为交叉排列，第二组为分块排列。In this embodiment, a Turbo code with an interleaving length of 30, an RSC generating polynomial of [23,35], and a puncturing pattern of [1 0 1 10] is selected. The data arrangement mode within the first group of data code blocks is cross arrangement, and the second group is block arrangement.
首先验证码块内部数据排列模式的识别性能。构造列数为交织长度2倍的分析矩阵，采用上述算法求前30列秩。第一组数据秩为29，出现秩亏，判定为交叉排列。第二组数据，秩为30，满秩，判定为分块排列。数据排列模式判定结果正确。其次验证删余周期和删余矩阵的识别结果，仿真图如图4、图5所示。First, verify the recognition performance of the data arrangement pattern within the code block. Construct an analysis matrix with a column number twice the interleaving length, and use the above algorithm to find the ranks of the first 30 columns. The rank of the first group of data is 29, which has a rank deficiency and is determined to be a cross arrangement. The rank of the second group of data is 30, which is full rank and is determined to be a block arrangement. The result of the data arrangement pattern judgment is correct. Secondly, verify the recognition results of the puncturing cycle and the puncturing matrix. The simulation diagrams are shown in Figures 4 and 5.
由图4可知，当校验长度为5的整数倍时，数据重合率最高，因此删余矩阵的列数即删余周期为最大公因数5。由图5可知，在1、3、4的位置处数据重合数最高，故删余矩阵中的索引1、3、4处为1，代表校验位取R1路数据，由此识别出删余矩阵为[1 0 1 1 0]，与Turbo码采用的删余模式一致。As shown in Figure 4, when the check length is an integer multiple of 5, the data overlap rate is the highest, so the number of columns of the puncturing matrix, that is, the puncturing period, is the greatest common factor of 5. As shown in Figure 5, the data overlap number is the highest at positions 1, 3, and 4, so the indexes 1, 3, and 4 in the puncturing matrix are 1, indicating that the check bit takes R1 data, thereby identifying the puncturing matrix as [1 0 1 1 0], which is consistent with the puncturing mode used by the Turbo code.
由于实际系统中存在一定程度的误码，故验证删余周期和删余矩阵识别的准确率，校验其抗误码性能。当系统的误码率变化时，删余周期和删余矩阵的识别准确率分别如图6、图7所示。Since there is a certain degree of bit error in the actual system, the accuracy of the puncturing period and the puncturing matrix is verified to check its error resistance performance. When the bit error rate of the system changes, the recognition accuracy of the puncturing period and the puncturing matrix is shown in Figure 6 and Figure 7 respectively.
由图6和图7可知，删余周期和删余矩阵在误码率为0.08以下时，能够实现100%正确识别，之后性能会逐渐恶化，但在误码率为0.11的情况下仍能达到70%以上的准确率。As shown in Figures 6 and 7, the puncturing period and puncturing matrix can achieve 100% correct recognition when the bit error rate is below 0.08, and the performance will gradually deteriorate afterwards, but can still achieve an accuracy of more than 70% when the bit error rate is 0.11.
本实施例提供一种Turbo码删余模式的识别方法，根据数据的排列模式提取R0路数据和R12路数据，使用RSC分量编码器对R0路数据进行编码，生成非删余Turbo码的R1路数据，将R1路数据和R12路数据每隔T位取出进行比较，获得匹配率M，当T等于真实删余周期的整数倍时，匹配率M达到最大值，将匹配率达到最大值时的所有T取最大公因数为删余周期，根据删余周期T将R1路数据和R12路数据分别划分为g组，每组T位数据一一对应，遍历g组，每组比对R1路数据和R12路数据中索引相同的T位数据，若某位出现数据重合，T位中该位重合位数加一，对g组累积求和，获得T位中每一位总的重合位数，重合位数的最大值为g，选择T位中总的重合位数大于预设值的位，输出数据模式和删余矩阵。本实施例提供的Turbo码删余模式的识别方法对删余周期和删余矩阵的识别准确率高。The present embodiment provides a method for identifying a puncturing pattern of a Turbo code. According to a data arrangement pattern, R0 data and R12 data are extracted, and an RSC component encoder is used to encode the R0 data to generate R1 data of a non-punctured Turbo code. The R1 data and R12 data are taken out every T bits to compare and obtain a matching rate M. When T is equal to an integer multiple of a real puncturing period, the matching rate M reaches a maximum value. The greatest common factor of allTs when the matching rate reaches the maximum value is taken as the puncturing period. According to the puncturing period T, the R1 data and the R12 data are respectively divided into g groups, each group of T-bit data corresponds to each other. The g groups are traversed, and each group compares the T-bit data with the same index in the R1 data and the R12 data. If data overlaps in a certain bit, the number of overlapped bits of the bit in the T bits is increased by one. The g groups are cumulatively summed to obtain the total number of overlapped bits for each bit in the T bits. The maximum value of the number of overlapped bits is g. Bits whose total number of overlapped bits in the T bits is greater than a preset value are selected, and a data pattern and a puncturing matrix are output. The method for identifying a Turbo code puncturing pattern provided by this embodiment has a high recognition accuracy rate for a puncturing period and a puncturing matrix.
可以理解的是，以上实施方式仅仅是为了说明本发明的原理而采用的示例性实施方式，然而本发明并不局限于此。对于本领域内的普通技术人员而言，在不脱离本发明的精神和实质的情况下，可以做出各种变型和改进，这些变型和改进也视为本发明的保护范围。It is to be understood that the above embodiments are merely exemplary embodiments used to illustrate the principles of the present invention, but the present invention is not limited thereto. For those of ordinary skill in the art, various modifications and improvements can be made without departing from the spirit and essence of the present invention, and these modifications and improvements are also considered to be within the scope of protection of the present invention.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410465666.8ACN118074728B (en) | 2024-04-18 | 2024-04-18 | A Turbo code puncturing pattern recognition method |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410465666.8ACN118074728B (en) | 2024-04-18 | 2024-04-18 | A Turbo code puncturing pattern recognition method |
| Publication Number | Publication Date |
|---|---|
| CN118074728A CN118074728A (en) | 2024-05-24 |
| CN118074728Btrue CN118074728B (en) | 2024-06-21 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410465666.8AActiveCN118074728B (en) | 2024-04-18 | 2024-04-18 | A Turbo code puncturing pattern recognition method |
| Country | Link |
|---|---|
| CN (1) | CN118074728B (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101753194A (en)* | 2008-11-28 | 2010-06-23 | Tcl集团股份有限公司 | De-repeating and de-deleting method in TD-SCMA |
| CN101836387A (en)* | 2007-06-08 | 2010-09-15 | 艾利森电话股份有限公司 | Computationally efficient convolutional coding with rate matching |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR2753025B1 (en)* | 1996-08-28 | 1998-11-13 | Pyndiah Ramesh | METHOD FOR TRANSMITTING INFORMATION BITS WITH ERROR CORRECTING CODER, ENCODER AND DECODER FOR CARRYING OUT SAID METHOD |
| CN101005334B (en)* | 2007-01-12 | 2010-12-29 | 中兴通讯股份有限公司 | Method for forming mixed automatic request re-sending packet of low density parity check code |
| CN102244554B (en)* | 2010-05-11 | 2014-06-18 | 中国电子科技集团公司第三十六研究所 | Blind recognition method of punctured Turbo coding parameters |
| CN104683072A (en)* | 2015-03-26 | 2015-06-03 | 山东大学 | A Blind Identification Method of Parameters of Component Encoders with Punctured Turbo Codes |
| CN113078914B (en)* | 2021-03-26 | 2023-08-08 | 重庆邮电大学 | A Blind Identification Method for the Parameters of a Single Incomplete Turbo Code Component Encoder |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101836387A (en)* | 2007-06-08 | 2010-09-15 | 艾利森电话股份有限公司 | Computationally efficient convolutional coding with rate matching |
| CN101753194A (en)* | 2008-11-28 | 2010-06-23 | Tcl集团股份有限公司 | De-repeating and de-deleting method in TD-SCMA |
| Publication number | Publication date |
|---|---|
| CN118074728A (en) | 2024-05-24 |
| Publication | Publication Date | Title |
|---|---|---|
| CN101867379B (en) | A Decoding Method of Convolutional Codes Aided by Cyclic Redundancy Check | |
| CN106712898B (en) | Channel Coding Blind Recognition Method Based on Gaussian Iterative Column Elimination | |
| CN107517095A (en) | A Polar Code Coding and Decoding Method for Non-Uniform Segment Checking | |
| CN107370566B (en) | A Blind Recognition Method of Punctured Turbo Codes under Error Condition | |
| CN107147400B (en) | A Blind Recognition Method of IRA Code Open Set | |
| CN114285418B (en) | An improved polar code EPC-MS-SCL decoding method | |
| CN110943745B (en) | Polarization code BP decoding method and system for early terminating iterative output result | |
| CN103236900B (en) | A kind of Serial concatenated turbo codes interleaver parameter blind estimating method | |
| CN111800145A (en) | A Blind Code Length Recognition Method for Linear Block Codes Based on Cosine Similarity | |
| Ding et al. | An improved blind recognition method for synchronization position and coding parameters of k/n rate convolutional codes in a noisy environment | |
| CN112165337B (en) | Convolutional code random interleaving sequence interleaving relation estimation method based on linear constraint | |
| CN120128196A (en) | A method, device and storage medium for blind identification of system convolutional code parameters | |
| CN115473537B (en) | An Improved ES-SCL Decoding Method for Polar Codes | |
| CN118074728B (en) | A Turbo code puncturing pattern recognition method | |
| CN105391455B (en) | A zero-returning turbo code starting point and depth blind recognition method | |
| CN113395139A (en) | Convolutional code length blind identification method based on Gaussian column elimination | |
| CN112165338B (en) | Estimation method for interleaving relation of convolutional code random interleaving sequence | |
| CN111726125B (en) | Error-containing concatenated code identification method based on template matching | |
| CN108833057B (en) | Distributed CRC processing method based on 3GPP 5G-NR polarization code | |
| CN111884662B (en) | Parameter identification method and system for polarization code under error code condition | |
| CN100433836C (en) | Method and system for decoding video, voice, and speech data using redundancy | |
| Yang et al. | Recognition of punctured convolutional codes based on multi-scale CNN | |
| Wang et al. | Blind recognition of convolutional codes: A matrix transformation-aided deep learning approach | |
| CN107342775B (en) | Viterbi decoding method for punctured convolutional code | |
| CN102916707B (en) | Compatible convolutional code generator polynomial defining method, coding method and encoder |
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |