CN118074728A - Recognition method of Turbo code puncturing mode - Google Patents
Recognition method of Turbo code puncturing mode Download PDFInfo
- Publication number
- CN118074728A CN118074728A CN202410465666.8A CN202410465666A CN118074728A CN 118074728 A CN118074728 A CN 118074728A CN 202410465666 A CN202410465666 A CN 202410465666A CN 118074728 A CN118074728 A CN 118074728A
- Authority
- CN
- China
- Prior art keywords
- data
- puncturing
- path
- path data
- bit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 239000011159 matrix material Substances 0.000 claims abstract description 54
- 239000000284 extract Substances 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 238000003909 pattern recognition Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 238000013075 data extraction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2957—Turbo codes and decoding
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a recognition method of a Turbo code puncturing mode. For puncturing period identification, the method firstly extracts R0 path data and R12 path data according to the arrangement mode of the data, then encodes the R0 path data by using an RSC component encoder to generate R1 path data of a non-puncturing Turbo code, finally compares the R1 path data and the R12 path data at intervals of T bits to obtain a matching rate M, and the maximum common factor of all T bits corresponding to the maximum matching rate is the puncturing period. For the identification of the puncturing matrix, firstly dividing R1 path data and R12 path data into g groups according to a puncturing period T, then traversing the g groups, comparing T bit data with the same index in the R1 path data and the R12 path data in each group, if at least one bit of data is overlapped, adding one to the overlapping bit number in the T bit, finally accumulating and summing the g groups to obtain the total overlapping bit number of each bit in the T bit, and selecting the bit with the total overlapping bit number larger than a preset value in the T bit to obtain the puncturing matrix.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a recognition method of a Turbo code puncturing mode.
Background
Non-cooperative communication is a special communication mode in which the communicating entity does not share information or resources with the sender entity. In such modes, the receiver generally cannot obtain a priori information about the sender, such as the type of encoding and the encoding parameters, and thus cannot select a suitable decoder and set the correct parameters for it, which presents a significant challenge for decoding to obtain the original data. In order to cope with the above problems, a channel coding blind identification technique has been developed, which is a technique that can identify specific coding parameters from only received signals. The technology is widely applied to military and civil communication, for example, in the field of intelligent automation communication, the channel coding blind identification technology can identify coding parameter information which is continuously changed along with the environment, and the technology helps to complete self-adaptive decision, and in the field of military communication, the technology is very helpful to military investigation and information countermeasure.
In the channel coding technology, the Turbo code occupies an important position due to the excellent error correction capability, so that the parameter of the blind recognition Turbo code becomes a key task in the field of channel coding blind recognition. The Turbo code blind identification technology of the receiving end is researched, and through accurate processing and analysis of the received code words, a receiving party can estimate key coding parameters under the condition of unknown specific coding rules, so that a basis can be provided for subsequent signal decoding.
At present, the blind recognition technology of non-deleted Turbo codes is mature day by day, and the blind recognition technology of the deleted Turbo codes with the puncturing mode of [ 01 ] has achieved some results. However, the puncturing pattern of the Turbo code in the actual system is various and unknown, and how to identify the puncturing pattern of the Turbo code is an important research direction for identifying the current puncturing Turbo code. In addition, turbo codes are used as a block code, two data arrangement modes in a code block are used, and only if the data arrangement modes are correctly distinguished, information bits and check bits can be extracted, so that the Turbo codes are used as the basis of erasure mode identification.
Disclosure of Invention
In order to solve the limitations and defects existing in the prior art, the invention provides a method for identifying a Turbo code puncturing mode, which comprises the following steps:
Obtaining original data, wherein the original data comprises 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 as R12 path data;
identifying an arrangement mode of the data;
extracting the R0 path data and the R12 path data according to the arrangement mode of the data;
Encoding the R0 path data by using an RSC component encoder to generate R1 path data of a non-puncturing Turbo code;
Comparing the R1 path data with the R12 path data at intervals of T bits to obtain a matching rate M, wherein the matching rate M=P/Q, P is the matching bit number, and Q is the total length of the R1 path data taken out at intervals of T bits;
when T is equal to integer times of the real puncturing period, the matching rate M reaches the maximum value, and all T when the matching rate reaches the maximum value takes the maximum common factor as the puncturing period;
dividing the R1 path of data and the R12 path of data into g groups according to a puncturing period T, wherein each group of T bit data corresponds to each other one by one;
traversing g groups, wherein each group compares T-bit data with the same index in the R1-path data and the R12-path data, and if data coincidence occurs in a certain bit, adding one to the number of coincidence bits in the T bits;
Accumulating and summing the g groups to obtain the total coincidence number of each bit in the T bits, wherein the maximum value of the coincidence number is g;
selecting the total number of coincidence bits in the T bits to be greater than Of (2), wherein/>Is threshold,/>Setting the value of the R12 path data to 55%, and taking the R1 path data at the position when the total weight bit number is greater than the threshold and deleting;
Outputting a data pattern and the puncturing period.
Optionally, the step of identifying the arrangement mode of the data includes:
Identifying an interleaving length L of the data;
constructing a Turbo codeword into an analysis matrix A of q rows and 2L columns;
acquiring the front L columns of the analysis matrix A, analyzing the analysis matrix A, and judging whether the analysis matrix A is full of rank;
and if the judgment result is that the analysis matrix A is full in rank, the data arrangement mode is a block arrangement mode, and if the judgment result is that the analysis matrix A is lack of rank, the data arrangement mode is a cross arrangement mode.
Optionally, the step of extracting the R0 way data and the R12 way data according to the arrangement mode of the data includes:
The puncturing matrix is used for representing a puncturing mode, the puncturing Yu Juzhen is represented as a 01 matrix, the column number T is a puncturing period, and the number of lines is 1;
The position of 1 in the puncturing matrix represents that R12 paths of data are R1 paths of data before puncturing, and the position of 0 in the puncturing matrix represents that R12 paths of data are R2 paths of data before puncturing;
and outputting the puncturing matrix.
Optionally, the value range of the puncturing period T is greater than or equal to 2 and less than or equal to 10.
The invention has the following beneficial effects:
The invention provides a recognition method of a Turbo code puncturing mode, which comprises the steps of extracting R0 path data and R12 path data according to an arrangement mode of data, encoding the R0 path data by using an RSC component encoder, generating R1 path data of a non-puncturing Turbo code, comparing the R1 path data and the R12 path data at intervals of T bits to obtain a matching rate M, when T is equal to integer multiples of a real puncturing period, maximizing the matching rate M, taking the maximum common factor of all T when the matching rate reaches the maximum value as the puncturing period, dividing the R1 path data and the R12 path data into g groups according to the puncturing period T, traversing the g groups one by one, comparing the T bit data with the same index in the R1 path data and the R12 path data by one, if at least one bit data is overlapped, adding one bit to the overlapped bit number in the T groups, accumulating the g groups to obtain the total bit number in the T bits, overlapping the maximum value of each bit number in the T bits is g, selecting the total overlapped bit number in the T bits to be larger than the preset value and outputting the matrix. The recognition method of the Turbo code puncturing pattern provided by the invention has high recognition accuracy for the puncturing period and the puncturing matrix.
Drawings
Fig. 1 is a schematic diagram of a coding structure of a Turbo code according to a first embodiment of the present invention.
Fig. 2 is a schematic diagram of an intra-codeword data arrangement mode according to a first embodiment of the present invention.
Fig. 3 is a flowchart of a method for identifying a puncturing pattern of a Turbo code according to an embodiment of the present invention.
Fig. 4 is a schematic diagram of a puncturing period identification result according to a first embodiment of the present invention.
Fig. 5 is a schematic diagram of a puncturing matrix identification result according to a first embodiment of the present invention.
Fig. 6 is a schematic diagram of puncturing period identification accuracy according to a first embodiment of the present invention.
Fig. 7 is a schematic diagram of puncturing matrix identification accuracy according to an embodiment of the present invention.
Detailed Description
In order to enable those skilled in the art to better understand the technical scheme of the present invention, the following describes in detail the method for identifying the puncturing pattern of the Turbo code provided by the present invention with reference to the accompanying drawings.
Example 1
The coding structure of the Turbo code is shown in fig. 1. The original data is divided into three paths through Turbo coding, wherein the first path of information bits are marked as R0 paths, the second path of check bits are marked as R1 paths, and the third path of check bits are marked as R2 paths. When puncturing is performed, the information bit is kept unchanged, the R1 and R2 paths are multiplexed into one path through different puncturing modes, and the path is marked as R12 paths, so that the puncturing Turbo code can be obtained.
The arrangement modes of R1 channel information bits and R12 channel check bits in the code block of the punctured Turbo code are two, namely a block mode and a 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, the final output codeword composition after the interleaving mode and the blocking mode is as shown in fig. 2.
An overall flow chart for identifying the puncturing matrix is shown in fig. 3. First, the arrangement pattern of the data needs to be identified so as to extract the correct R0-way information bit data and R12-way check bit data. It should be noted that the puncturing pattern recognition algorithm requires a component encoder of a recursive systematic convolutional code (Recursive System Convolutional, RSC) structure of the known punctured Turbo code.
After the data arrangement mode is obtained, the R0 path and the R12 path are extracted according to the data arrangement mode, and R1 path data of the non-puncturing Turbo code is generated after the R0 path data is subjected to RSC coding. The algorithm identification result depends on the generated data coincidence rate of the R1 path and the R12 path, and the coincidence rate is defined as: the ratio of the number of data coincidence bits of the R1 and R12 ways to the total data length.
For convenience of subsequent discussion, the puncturing pattern is represented as a 01 matrix, which is called a puncturing matrix, and the number of columns T is a puncturing period and the number of rows is 1. The position of 1 in the matrix 01 indicates that R12 is to fetch R1 data before puncturing, whereas 0 indicates that R12 is to fetch R2 data before puncturing.
The invention performs matching analysis on the reconstructed branch sequence and the received check bit sequence, and completes identification by utilizing the characteristic of highest matching degree when the data extraction period is equal to the puncturing period. For the identification of the puncturing matrix, the invention determines the numerical value of each bit in the puncturing matrix one by one so as to directly obtain the puncturing matrix, the basis is that the overlapping bit numbers of a plurality of groups of data are accumulated, the accumulated result of the position of the puncturing matrix with 0 or 1 has obvious distinction degree, and better error code resistance can be obtained by setting a reasonable distinction threshold.
1. Estimating data permutation patterns
Regardless of the data alignment pattern, the interleaving length L can be identified using existing algorithms. The Turbo codeword is constructed as a q row 2L column analysis matrix a. In a code block with the length of 2L, R0 paths of data subjected to RSC coding exist, each row of code words are processed by the same RSC coding and deleting modes, and the linear correlation position of each row is certain, so that the linear correlation columns are necessarily present in the analysis matrix A.
The first L columns of the analysis matrix A are taken for analysis. For the block arrangement mode, the front L columns of the matrix are analyzed to be completely random original data, linear related columns do not exist, and the matrix is full. For the cross arrangement mode, the data of R0 path and R0 path after RSC coding exist in the front L columns of the analysis matrix, linear correlation columns exist, and the matrix rank is deficient. Therefore, by analyzing whether the matrix a is full of rank, it can be determined which data arrangement mode is.
2. Estimating puncturing period
The possible value range of the puncturing period T is generally between 2 and 10 according to the parameter setting of a typical puncturing turbo code. Traversing the puncturing period, and carrying out the following operations for each value:
Step 1: and according to the extracted R1 path and R12 path, the R1 path and R12 path data are extracted and compared every T bits, and the matching rate M under the T is obtained. m=p/Q, where P is the number of matching bits and Q is the total length of the fetched R1-way data.
Step 2: when T is equal to integer multiple of the real puncturing period, the matching rate M reaches the maximum value, and the maximum common factor of the positions is the puncturing period. The matching rate reaches the maximum value of 1, which means that R12 paths of data are necessarily taken as R1 paths of data every period T when the data are deleted, and the data extracted from the R1 paths are completely consistent with the data extracted from the R12 paths. When the period estimation is wrong, the R1 path data is matched with the data from the R2 path in the R12 path, and the matching rate is reduced.
3. Estimating the position of 1 in the puncturing matrix
Step 1: and dividing R1 and R12 paths of data into g groups according to the identified puncturing period T, wherein each group of T-bit data corresponds to each other one by one.
Step 2: and traversing g groups, wherein each group compares T bit data with the same index in R1 and R12 paths, and if some bit data are coincident, the number of coincident bits in the T bits is increased by one. And cumulatively summing the g groups to obtain the total coincidence number of each bit in the T bits, wherein the coincidence number is the maximum group number g.
Step 3: to cope with bit errors, the total combined weight of the T bits is selected to be greater thanIs the position of 1 in the puncturing matrix, where/>The threshold is 55% in this embodiment. This means that R12 way data is taken as R1 way data at this position when puncturing. The pattern recognition is completed so far.
In this embodiment, a Turbo code with an interleaving length of 30, an rsc generator polynomial of [23,35], and a puncturing pattern of [ 101 10 ] is selected. The data arrangement modes in the first group of data code blocks are cross arrangement, and the second group of data code blocks are block arrangement.
Firstly, verifying the identification performance of the data arrangement mode in the code block. An analysis matrix with the number of columns being 2 times of the interleaving length is constructed, and the first 30 columns of ranks are calculated by adopting the algorithm. The first group of data has a rank of 29, and rank deficiency occurs, and is judged to be in a crossed arrangement. And the second group of data has a rank of 30 and a full rank, and is judged to be arranged in blocks. The data arrangement pattern determination result is correct. And secondly, verifying the puncturing period and the recognition result of the puncturing matrix, wherein simulation diagrams are shown in fig. 4 and 5.
As can be seen from fig. 4, the data overlap ratio is highest when the check length is an integer multiple of 5, and therefore the number of columns of the puncturing matrix, i.e., the puncturing period, is the greatest common factor of 5. As can be seen from fig. 5, since the number of data overlaps is highest at the positions 1, 3, and 4, the positions 1, 3, and 4 in the puncturing matrix are 1, and R1 paths of data are taken as representative check bits, so that puncturing Yu Juzhen is identified as [ 1011 0], which is consistent with the puncturing pattern adopted by the Turbo code.
Because of a certain degree of error code in an actual system, the accuracy of the puncturing period and the puncturing matrix identification is verified, and the error code resistance is verified. When the error rate of the system changes, the puncturing period and the recognition accuracy of the puncturing matrix are respectively shown in fig. 6 and fig. 7.
As can be seen from fig. 6 and 7, the puncturing period and the puncturing matrix can achieve 100% accurate recognition when the bit error rate is 0.08 or less, and the performance gradually deteriorates thereafter, but the accuracy of 70% or more can be achieved even when the bit error rate is 0.11.
The embodiment provides a recognition method of a Turbo code puncturing pattern, which extracts R0 path data and R12 path data according to an arrangement pattern of data, encodes the R0 path data by using an RSC component encoder, generates R1 path data of a non-puncturing Turbo code, compares the R1 path data and the R12 path data every T bits, obtains 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, takes the maximum common factor of all T when the matching rate reaches the maximum value as the puncturing period, divides the R1 path data and the R12 path data into g groups according to the puncturing period T, each group of T bit data corresponds to each other one by one, traverses the g groups, compares the T bit data with the same index in the R1 path data and the R12 path data, if a certain bit is overlapped, adds one bit to the overlapped bit number in the T groups, accumulates the g groups to obtain the total bit number of each bit, the overlapped bit number is g, the maximum value of the overlapped bit number is the g, the total bit number of the overlapped bit number is selected to be the total bit number of the T groups is larger than the preset bit number of the data and the puncturing pattern is output. The recognition method of the Turbo code puncturing pattern provided by the embodiment has high recognition accuracy for the puncturing period and the puncturing matrix.
It is to be understood that the above embodiments are merely illustrative of the application of the principles of the present invention, but not in limitation thereof. Various modifications and improvements may be made by those skilled in the art without departing from the spirit and substance of the invention, and are also considered to be within the scope of the invention.
Claims (4)
1. The method for identifying the Turbo code puncturing pattern is characterized by comprising the following steps of:
Obtaining original data, wherein the original data comprises 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 as R12 path data;
identifying an arrangement mode of the data;
extracting the R0 path data and the R12 path data according to the arrangement mode of the data;
Encoding the R0 path data by using an RSC component encoder to generate R1 path data of a non-puncturing Turbo code;
Comparing the R1 path data with the R12 path data at intervals of T bits to obtain a matching rate M, wherein the matching rate M=P/Q, P is the matching bit number, and Q is the total length of the R1 path data taken out at intervals of T bits;
when T is equal to integer times of the real puncturing period, the matching rate M reaches the maximum value, and all T when the matching rate reaches the maximum value takes the maximum common factor as the puncturing period;
dividing the R1 path of data and the R12 path of data into g groups according to a puncturing period T, wherein each group of T bit data corresponds to each other one by one;
traversing g groups, wherein each group compares T-bit data with the same index in the R1-path data and the R12-path data, and if data coincidence occurs in a certain bit, adding one to the number of coincidence bits in the T bits;
Accumulating and summing the g groups to obtain the total coincidence number of each bit in the T bits, wherein the maximum value of the coincidence number is g;
selecting the total number of coincidence bits in the T bits to be greater than Of (2), wherein/>Is threshold,/>Setting the value of the R12 path data to 55%, and taking the R1 path data at the position when the total weight bit number is greater than the threshold and deleting;
Outputting a data pattern and the puncturing period.
2. The method for recognizing a puncturing pattern for Turbo codes as claimed in claim 1, wherein the step of recognizing the arrangement pattern of the data comprises:
Identifying an interleaving length L of the data;
constructing a Turbo codeword into an analysis matrix A of q rows and 2L columns;
acquiring the front L columns of the analysis matrix A, analyzing the analysis matrix A, and judging whether the analysis matrix A is full of rank;
and if the judgment result is that the analysis matrix A is full in rank, the data arrangement mode is a block arrangement mode, and if the judgment result is that the analysis matrix A is lack of rank, the data arrangement mode is a cross arrangement mode.
3. The method for recognizing a puncturing pattern for Turbo codes as claimed in claim 1, wherein the step of extracting the R0 path data and the R12 path data according to the arrangement pattern of the data comprises:
The puncturing matrix is used for representing a puncturing mode, the puncturing Yu Juzhen is represented as a 01 matrix, the column number T is a puncturing period, and the number of lines is 1;
The position of 1 in the puncturing matrix represents that R12 paths of data are R1 paths of data before puncturing, and the position of 0 in the puncturing matrix represents that R12 paths of data are R2 paths of data before puncturing;
and outputting the puncturing matrix.
4. The method for recognizing puncturing patterns for Turbo codes as claimed in claim 1, wherein the value range of the puncturing period T is 2 or more and 10 or less.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410465666.8A CN118074728B (en) | 2024-04-18 | 2024-04-18 | Recognition method of Turbo code puncturing mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410465666.8A CN118074728B (en) | 2024-04-18 | 2024-04-18 | Recognition method of Turbo code puncturing mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118074728A true CN118074728A (en) | 2024-05-24 |
| CN118074728B CN118074728B (en) | 2024-06-21 |
Family
ID=91097507
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410465666.8A Active CN118074728B (en) | 2024-04-18 | 2024-04-18 | Recognition method of Turbo code puncturing mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118074728B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0827284A1 (en) * | 1996-08-28 | 1998-03-04 | France Telecom | Information bits transmission process with error correction coding, and coder and decoder therefor |
| WO2008086735A1 (en) * | 2007-01-12 | 2008-07-24 | Zte Corporation | Method for generating hybrid automatic request retransmission packet of low density parity check code |
| 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 |
| CN102244554A (en) * | 2010-05-11 | 2011-11-16 | 中国电子科技集团公司第三十六研究所 | Blind recognition method of punctured Turbo coding parameters |
| CN104683072A (en) * | 2015-03-26 | 2015-06-03 | 山东大学 | Parameter blind identification method of puncturing turbo code component coder |
| CN113078914A (en) * | 2021-03-26 | 2021-07-06 | 重庆邮电大学 | Blind identification method for parameters of single incomplete Turbo code component encoder |
-
2024
- 2024-04-18 CN CN202410465666.8A patent/CN118074728B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0827284A1 (en) * | 1996-08-28 | 1998-03-04 | France Telecom | Information bits transmission process with error correction coding, and coder and decoder therefor |
| US6065147A (en) * | 1996-08-28 | 2000-05-16 | France Telecom | Process for transmitting information bits with error correction coding, coder and decoder for the implementation of this process |
| WO2008086735A1 (en) * | 2007-01-12 | 2008-07-24 | Zte Corporation | Method for generating hybrid automatic request retransmission packet of low density parity check code |
| 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 |
| CN102244554A (en) * | 2010-05-11 | 2011-11-16 | 中国电子科技集团公司第三十六研究所 | Blind recognition method of punctured Turbo coding parameters |
| CN104683072A (en) * | 2015-03-26 | 2015-06-03 | 山东大学 | Parameter blind identification method of puncturing turbo code component coder |
| CN113078914A (en) * | 2021-03-26 | 2021-07-06 | 重庆邮电大学 | Blind identification method for parameters of single incomplete Turbo code component encoder |
Non-Patent Citations (2)
| Title |
|---|
| 吴昭军;张立民;钟兆根;: "归零Turbo码参数的盲识别", 电讯技术, no. 05, 28 May 2017 (2017-05-28) * |
| 郑丽敏;张卫党;董艳;: "基于DRP交织器的Turbo码码率设计", 通信技术, no. 08, 10 August 2009 (2009-08-10) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN118074728B (en) | 2024-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1101997C (en) | Method and apparatus for rate determination in communication system | |
| CN101867379B (en) | Cyclic redundancy check-assisted convolutional code decoding method | |
| CN108540141A (en) | Polar code coding/decoding methods and device | |
| CN107370566B (en) | Punctured Turbo code blind identification method under error code condition | |
| CZ407497A3 (en) | Optimal decoder with weak outputs for trellis codes with terminal bits | |
| WO2005046060A1 (en) | Method and apparatus for improved turbo multiuser detector | |
| CN1461528A (en) | Iteration terminating using quality index criteria of Turbo codes | |
| CN100512020C (en) | Decoding method and decoding device | |
| CN103236900B (en) | A kind of Serial concatenated turbo codes interleaver parameter blind estimating method | |
| Barbier | Reconstruction of turbo-code encoders | |
| Wu et al. | Blind recognition of BCH code based on Galois field Fourier transform | |
| CN118074728B (en) | Recognition method of Turbo code puncturing mode | |
| CN105391455B (en) | A kind of zero Turbo code starting point and depth blind-identification method | |
| CN112003672B (en) | Rate matching method, rate de-matching method and device for Polar codes | |
| CN101425869A (en) | Decoding method and apparatus | |
| CN112165337A (en) | Convolutional code random interleaving sequence interleaving relation estimation method based on linear constraint | |
| CN112332869A (en) | Improved TPC iteration method and apparatus | |
| SE511310C2 (en) | Method for bit detection in a radio communication system | |
| CN1741614A (en) | Method and system for decoding video, voice, and speech data using redundancy | |
| CN113132058B (en) | Improved convolution interleaving blind identification method based on Gaussian approximate elimination | |
| CN113078914B (en) | Blind identification method for parameters of single incomplete Turbo code component encoder | |
| CN108833057B (en) | Distributed CRC processing method based on 3GPP 5G-NR polarization code | |
| CN113395139A (en) | Convolutional code length blind identification method based on Gaussian column elimination | |
| CN112332866B (en) | Cascade code parameter identification method based on DVB-S and DVB-S2 signals | |
| CN111884662B (en) | Parameter identification method and system for polarization code under error code condition |
Legal Events
| 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 |