CN114362764B - Construction method and device of channel coding check matrix in URLLC scene - Google Patents
Construction method and device of channel coding check matrix in URLLC scene Download PDFInfo
- Publication number
- CN114362764B CN114362764B CN202210013758.3A CN202210013758A CN114362764B CN 114362764 B CN114362764 B CN 114362764B CN 202210013758 A CN202210013758 A CN 202210013758A CN 114362764 B CN114362764 B CN 114362764B
- Authority
- CN
- China
- Prior art keywords
- redistribution
- target
- candidate
- column
- row
- 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.)
- Active
Links
- 239000011159 matrix material Substances 0.000 title claims abstract description 169
- 238000010276 construction Methods 0.000 title claims abstract description 21
- 230000005540 biological transmission Effects 0.000 claims abstract description 62
- 238000000034 method Methods 0.000 claims abstract description 44
- 238000009826 distribution Methods 0.000 claims description 36
- 238000004891 communication Methods 0.000 claims description 14
- 238000012545 processing Methods 0.000 claims description 11
- 230000006399 behavior Effects 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012216 screening Methods 0.000 abstract description 4
- 238000013461 design Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 230000006978 adaptation Effects 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000004904 shortening Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 241000169170 Boreogadus saida Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007667 floating Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000003892 spreading Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
- 239000013598 vector Substances 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Landscapes
- Error Detection And Correction (AREA)
Abstract
Method and device for constructing channel coding check matrix in URLLC scene. The application discloses a method and a device for constructing channel coding code words in URLLC scenes, wherein the method comprises the following steps: based on the code length code rate requirement of the target code word, obtaining constraint errors of a total code rate, a total code rate range, a mother code rate range and the like; obtaining a plurality of candidate row redistribution and expansion modes according to constraint conditions, and screening candidate row redistribution meeting the row redistribution range and minimum variance conditions according to each candidate row redistribution; based on the method, screening out target row redistribution, target column redistribution and target expansion modes meeting the lowest condition of a decoding threshold; and generating a target check matrix according to the target row redistribution and the target column redistribution, and then encoding according to the target check matrix and the target extension mode to obtain a target transmission codeword. By the construction method and the construction device provided by the application, the generated target transmission code word has a low code rate short code structure, so that lower time delay can be ensured, and the reliability of code word transmission can be improved.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for constructing a channel coding check matrix in URLLC scenarios.
Background
High reliability low latency communications (Ultra Reliable Low Latency Communications, URLLC) are one of three application scenarios for 5G, including autopilot, smart grid, industrial automation, remote patient monitoring, and telemedicine, among others. Application in URLCC scene requires end-to-end frame error rate as low as 10 -6, time delay 1-10 ms. The implementation of high reliability requires a low code rate and the implementation of short delay requires a shorter codeword length for channel coding.
However, the high-performance low-code-rate coding method has great construction difficulty, and shortening the code length generally causes loss of coding gain and further worsens decoding performance. Thus, there is a need for a channel coding scheme that provides high performance, low code rate, short code length for URLLC scenarios.
Disclosure of Invention
In view of this, the present application provides a method and apparatus for constructing a coding and decoding check matrix in URLLC scenarios, which are used to solve the technical problem that the short code length and low code rate channel coding and decoding cannot be realized in the prior art, as follows:
A construction method of a channel coding check matrix in URLLC scenes comprises the following steps:
Obtaining constraint conditions of a channel coding check matrix, wherein the check matrix takes a behavior check node and takes a column as a variable node, and the constraint conditions at least comprise: total code rate error, total code rate range, mother code rate range, row re-range, column re-range;
Wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword;
Obtaining a combination of a plurality of candidate line redistribution and a candidate expansion mode according to the constraint condition, wherein the candidate line redistribution comprises the number of check nodes corresponding to each line weight value in the line weight range, the candidate expansion mode comprises the expansion proportion of the check nodes corresponding to each line weight value in the line weight range, and the combination of the candidate line redistribution and the candidate expansion mode meets the total code rate error, the total code rate range and the mother code rate range;
obtaining candidate column redistribution corresponding to each candidate row redistribution, wherein the candidate column redistribution comprises the number of variable nodes corresponding to each column weight value in the column weight range;
Determining a target extension mode, a target row redistribution and the target column redistribution according to the candidate extension mode, the candidate row redistribution and the candidate column redistribution;
and constructing a target check matrix according to the target row redistribution and the target column redistribution, wherein the row redistribution of the target check matrix is matched with the target row redistribution, the column redistribution of the target check matrix is matched with the target column redistribution, and the target check matrix and the target extension mode are used for encoding information bits in a channel to obtain a target transmission codeword.
The above method, preferably, the method further comprises:
encoding information bits in a channel by using the target check matrix to obtain LDPC code words, wherein the bit length of the LDPC code words corresponds to the number of the variable nodes;
processing the LDPC code word according to the expansion proportion of the check node represented by the target expansion mode to obtain an algebraic code word corresponding to the expanded check node, wherein the bit length of the algebraic code word is related to the row weight value of the check node row;
And obtaining a target transmission codeword according to the LDPC codeword and the algebraic code codeword.
The method preferably obtains a target transmission codeword according to the LDPC codeword and the algebraic code codeword, including:
and adding the algebraic code words to the LDPC code words according to the sequence among the corresponding check nodes to obtain target transmission code words.
The above method, preferably, after obtaining the target transmission codeword according to the LDPC codeword and the algebraic code word, the method further includes:
And performing puncturing processing on the target transmission code word so that the total code rate of the target transmission code word corresponds to the total code rate range.
The method preferably performs puncturing processing on the target transmission codeword, and includes:
and sequentially puncturing algebraic code words corresponding to corresponding row weight values in the target transmission code words according to the sequence from high to low of the corresponding row weight values in the target check matrix until the total code rate of the target transmission code words corresponds to the total code rate range.
In the above method, preferably, the ratio of the punctured codeword in the algebraic code words of the target transmission codeword in the algebraic code words is less than or equal to a preset ratio value.
In the above method, preferably, the variance of the column weight value corresponding to the candidate column weight distribution satisfies a variance minimum condition.
In the above method, preferably, determining the target extension mode, the target row redistribution and the target column redistribution according to the candidate extension mode, the candidate row redistribution and the candidate column redistribution includes:
And selecting a target extension mode, a target row redistribution and a target column redistribution which meet the lowest condition of a coding threshold from the candidate extension mode, the candidate row redistribution and the candidate column redistribution.
A construction device of a channel coding check matrix in URLLC scenes comprises:
The constraint obtaining unit is used for obtaining constraint conditions of a channel coding check matrix, the check matrix uses a behavior check node and uses a column as a variable node, and the constraint conditions at least comprise: total code rate error, total code rate range, mother code rate range, row re-range, column re-range;
Wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword;
A candidate line redistribution obtaining unit, configured to obtain a combination of a plurality of candidate line redistribution and a candidate extension mode according to the constraint condition, where the candidate line redistribution includes a number of check nodes corresponding to each line weight value in the line redistribution range, the candidate extension mode includes an extension proportion of the check nodes corresponding to each line weight value in the line redistribution range, and the combination of the candidate line redistribution and the candidate extension mode satisfies the total code rate error, the total code rate range and the mother code rate range;
a candidate column redistribution obtaining unit, configured to obtain a candidate column redistribution corresponding to each candidate row redistribution, where the candidate column redistribution includes a number of variable nodes corresponding to each column weight value in the column weight range;
A target distribution obtaining unit configured to determine a target expansion pattern, a target row redistribution and the target column redistribution according to the candidate expansion pattern, the candidate row redistribution and the candidate column redistribution;
the matrix construction unit is used for constructing a target check matrix according to the target row redistribution and the target column redistribution, wherein the row redistribution of the target check matrix is matched with the target row redistribution, the column redistribution of the target check matrix is matched with the target column redistribution, and the target check matrix and the target expansion mode are used for encoding information bits in a channel to obtain a target transmission codeword.
A communication device, comprising:
A memory for storing a computer program and data resulting from the execution of the computer program;
And a processor, configured to execute the computer program to implement a constraint condition for obtaining a channel coding check matrix, where the check matrix uses a behavior check node and uses a column as a variable node, and the constraint condition at least includes: total code rate error, total code rate range, mother code rate range, row re-range, column re-range; wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword; obtaining a combination of a plurality of candidate line redistribution and a candidate expansion mode according to the constraint condition, wherein the candidate line redistribution comprises the number of check nodes corresponding to each line weight value in the line weight range, the candidate expansion mode comprises the expansion proportion of the check nodes corresponding to each line weight value in the line weight range, and the combination of the candidate line redistribution and the candidate expansion mode meets the total code rate error, the total code rate range and the mother code rate range; obtaining candidate column redistribution corresponding to each candidate row redistribution, wherein the candidate column redistribution comprises the number of variable nodes corresponding to each column weight value in the column weight range; determining a target extension mode, a target row redistribution and the target column redistribution according to the candidate extension mode, the candidate row redistribution and the candidate column redistribution; and constructing a target check matrix according to the target row redistribution and the target column redistribution, wherein the row redistribution of the target check matrix is matched with the target row redistribution, the column redistribution of the target check matrix is matched with the target column redistribution, and the target check matrix and the target extension mode are used for encoding information bits in a channel to obtain a target transmission codeword.
As can be seen from the above solution, in the method and apparatus for constructing a channel coding check matrix in URLLC scenarios provided in the present application, after constraint conditions such as a row weight range and a column weight range of the check matrix are obtained, a combination of a plurality of candidate row weight distributions and candidate extension modes is obtained, where the combination of the candidate row weight distributions and the candidate extension modes satisfies a total code rate error, a total code rate range and a mother code rate range, then, for each candidate row weight distribution, candidate column weight distributions are screened out, then, a target check matrix is constructed by screening out target row weight distributions and target column weight distributions, and the constructed target check matrix can encode information bits in a channel in combination with the target extension modes to obtain a target transmission codeword. Therefore, the application can realize the code word structure with low code rate and short code length in URLLC scenes by constructing the check matrix which expands aiming at the check nodes and optimizing the check matrix used for realizing the coding, thereby not only ensuring lower time delay, but also improving the reliability of transmission.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a method for constructing a channel coding check matrix in URLLC scenarios according to an embodiment of the present application;
FIG. 2 is a tanner graph of a check matrix suitable for use in URLLC scenarios;
FIGS. 3 and 4 are flow charts of encoding using the target check matrix constructed in accordance with embodiments of the present application;
FIGS. 5-6 are schematic diagrams of target check matrices constructed in accordance with the present application, respectively;
fig. 7 is a schematic structural diagram of a device for constructing a channel coding check matrix in URLLC scenarios according to an embodiment of the present application;
Fig. 8 is another schematic structural diagram of a device for constructing a channel coding check matrix in URLLC scenarios according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of a communication device according to an embodiment of the present application.
Detailed Description
In URLLC scenarios, short latency requires shorter codeword lengths for channel coding, while high reliability implementations typically require low coding rates. On the one hand, shortening the code length generally results in a loss of coding gain. On the other hand, the high-performance coding method with low code rate and short code length has great construction difficulty.
The inventor of the present application found when conducting channel coding study in URLLC scene: there are many codewords of short code length that have been evaluated in URLLC scenarios: low-density parity check, LDPC, (low-DENSITY PARITY-check, gldpc) and Polar codes have been chosen as coding schemes for data and control channels, respectively, in a 5G enhanced mobile broadband (enhanced Mobile Broad Band, eMBB) scenario. They have also been evaluated in the URLLC scenario. However, the iterative decoding performance of the short LDPC code is deteriorated due to the fact that more short loops exist in the short LDPC code check matrix. The Polar code has a further improved performance under the short code length, and the serial decoding method thereof makes the decoding delay larger.
Based on the above defects, the inventor of the present application researches and discovers that the channel coding and decoding schemes in other scenes: the algebraic code is a block code with a structured verification relation, and has excellent error correction capability; however, the code length and code rate of the code number are inflexible, and the complexity of soft decision decoding increases rapidly with the increase of the code length, so that the code length and code rate are difficult to directly apply in URLLC scenes. Generalized sparse codes (generalized sparse codes, GS codes) extend the Single Parity Check (SPC) check nodes of LDPC codes into algebraic constraints and transmit the extended extra algebraic check sequences as redundancy over the channel. The code words can be expanded by adopting various algebraic codes, such as Hadamard codes, RS codes and the like, and the error correction performance is stronger and the code rate is lower. The decoding process of the GS code is similar to the BP algorithm of LDPC, and is realized by using external information to iteratively calculate and transfer between the LDPC variable nodes and algebraic check nodes. Long code length GS codes have proven to have excellent performance in many scenarios. But GS codes with short code length and low code rate suitable for URLLC still lack effective construction methods.
In order to overcome the defects existing in channel coding and decoding in URLLC scenes, the inventor of the application provides a construction method of a GS codeword with short code length and low code rate, which is suitable for URLLC scenes, and the method can still ensure the reliability of transmission under a shorter code length and can effectively support the application of URLLC scenes.
Specifically, the code word construction method proposed by the inventor of the present application mainly includes: firstly, a row-column degree sequence (namely check node and variable node degree sequence, which can be also called row redistribution and column redistribution) of LDPC code of GS code and constraint conditions required to be met by check node expansion modes are given, then all possible check node degree sequences and expansion modes are found, then corresponding variable node degree sequences with minimum variance are found for each check node degree sequence and expansion mode, the row-column degree sequence and the check node expansion mode with minimum decoding threshold are taken as code construction parameters, then an LDPC parent code check matrix is generated from the obtained degree sequences by using a PEG-ACE algorithm, and finally GS coding is executed in combination with the expansion modes.
The beneficial effects of the optimizing scheme of the code word coding and decoding provided by the application are as follows:
1. Short code construction: the GS code can select and use any algebraic code for expansion of the LDPC parent code, and can adopt different part expansion ratios for check nodes with different degrees, so that the GS code can better adapt to a channel compared with the LDPC code, and the transmission reliability is ensured.
2. Short code construction: the conventional method for constructing codewords of long codes only focuses on the decoding threshold, which is not applicable under short code length. The variable node degree sequence with the smallest variance is selected on the premise of optimizing the rank division and the expansion mode to minimize the decoding threshold, so that the most uniform variable node distribution is found. Based on the above, the GS code constructed by the application still has lower error code flat bottom under the condition of short code length, realizes very low frame error rate and meets the application requirement of URLLC.
3. Code rate adaptation: the selection of algebraic code types and expansion factors is effectively considered in the expansion mode of the short code GS codes, the search range under the target code rate is improved, and better code rate adaptation can be realized. And at the same time, the final target code rate is achieved through puncturing at the end of the code word construction.
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Referring to fig. 1, a flowchart of a method for constructing a channel coding check matrix in URLLC scenarios is disclosed in the embodiment of the present application, and the method may be applied to a communication device, such as a mobile phone or a base station. The technical scheme in the embodiment is mainly used for optimizing the implementation mode of constructing the code word of the code word transmitted in the channel by constructing the check matrix for realizing channel coding so as to realize low-delay and high-reliability channel transmission.
Specifically, the method in this embodiment may include the following steps:
step 101: and obtaining constraint conditions of the channel coding check matrix.
The check matrix uses behavior check nodes and uses columns as variable nodes. As shown in fig. 2, in the tanner graph of the GS code, the LDPC mother code check matrix of the GS code is denoted by H M×N, the mother code rate is denoted by R L, where there are M check nodes, N variable nodes, where a box represents a check node, a solid circle represents an LDPC variable node with a degree of j, and a dotted circle represents an algebraic code variable node with a degree of 1.
In this embodiment, each constraint condition may be obtained based on the requirement information of the code length code rate of the target codeword. The constraint conditions of the check matrix at least comprise: total code rate error, total code rate range, mother code rate range, row re-range, column re-range. The total code rate is as follows: the ratio of the bit length of the input sequence to the bit length of the output codeword is the mother code rate: the ratio of the bit length of the input sequence to the bit length of the output codeword. The bit length of the input sequence is denoted by K, which is M-N. The output code word comprises an LDPC code word and an algebraic code word, the algebraic code word can be Hadamard code, RS code and the like, the LDPC code word is code word bits output by encoding the variable nodes through the check matrix, and the algebraic code word is code word bits output by expanding the check nodes of the check matrix.
Specifically, the total code rate error may be represented by E, and may be a preset value, for example, 0.001; the total code rate range can be represented by R, and is a range obtained by E floating on the basis of a target code rate R G, namely R epsilon [ R G(1-E),RG ]; the mother code rate range may be represented by R L, with R L corresponding to a maximum value of R L,max and a minimum value of R L,min, R L∈[RL,min,RL,max.
The row weight of the check matrix can be understood as: the number of matrix elements with a value of 1 contained in a row of the check matrix may also be referred to as the check node degree. The column weight of the check matrix can be understood as: the number of matrix elements with a value of 1 contained in a column of the check matrix may also be referred to as variable node degree.
For example, if the mother code check matrix contains a plurality of different row weights (i.e. check node degrees), and the minimum and maximum row weights in the mother code are i min and i max respectively, the row redistribution (i.e. check node degree distribution) is expressed asWhere i is a number between i min and i max, and n c,i represents the number of rows of weight i (i.e., the number of check nodes of degree i); similarly, the mother code check matrix contains a plurality of different column weights (i.e. variable node degrees), and the minimum and maximum column weights in the mother code are j min and j max, and then the column weight distribution (i.e. variable node degree distribution) is expressed asWhere j is a number between j min and j max, and n v,j represents the number of columns with a weight of j (i.e., the number of variable nodes with a degree of j).
For all check nodes with the degree i in the LDPC parent code, obeying the single parity check code constraint with the parameter (i, i-1), a proper algebraic code can be selected for expansion to obtain the algebraic code check constraint of (n i, i-1), wherein the value of n i depends on the selected algebraic code and the degree i of the check node.
The expansion mode of the check matrix includes a proportion gamma i of expansion of the corresponding check node on each row weight value i. In particular, a selective partial algebraic expansion can be performed according to the expansion ratio gamma i; all check node degree expansion ratios can be expressed as expansion modes
To sum up, the row redistribution, column redistribution and expansion pattern in the check matrix may be represented by vectors in codeword parameters (N c,Nv, γ), and the corresponding constraint conditions are as shown in formula (1):
Specifically, in this embodiment, by receiving the requirement data, codeword construction design parameters given by a user are extracted from the requirement data, so as to obtain corresponding data in constraint conditions, for example: the bit length K of the input information, the target code rate R G, the total code rate error E, the mother code rate range minimum value R L,min, the mother code rate range maximum value R L,max, the maximum row weight i max, the minimum row weight i min, the maximum column weight j max, the minimum column weight j min, and the like.
Step 102: and obtaining a combination of the plurality of candidate row redistribution and the candidate expansion modes according to the constraint condition.
The candidate line redistribution comprises the number of check nodes corresponding to each line weight value in a line weight range, the candidate expansion mode comprises the expansion proportion of the check nodes corresponding to each line weight value in the line weight range, and the combination of the candidate line redistribution and the candidate expansion mode meets the total code rate error, the total code rate range and the mother code rate range.
Specifically, in this embodiment, according to the row weight range in the constraint condition, candidate row redistribution of the row weight range in which at least the row weight value satisfies the constraint condition is found in the matrix set where all possible matrices corresponding to M rows and N columns are located.
Each matrix in the matrix set is different in terms of row redistribution, column redistribution and expansion modes, and all matrix instances covering all M rows and N columns are formed in different row redistribution, column redistribution and expansion modes. For example, a matrix in the set of matrices covers all possible row redistribution, each possible row redistribution corresponding to all possible column redistribution and all possible extension patterns. In the present embodiment, in these matrices, candidate row redistribution which satisfies the row redistribution range in the constraint condition are found, and these candidate row redistribution correspond to a plurality of possible column redistribution and a plurality of possible extension modes.
Further, in the present embodiment, when obtaining the candidate row redistribution, in addition to the row redistribution scope in the constraint condition, other constraint contents related to the row redistribution need to be considered. Specifically, the candidate line redistribution obtained in this embodiment corresponds to a candidate extension mode, and the candidate extension mode corresponding to the candidate line redistribution includes a proportion of extending the corresponding check node on each line weight value. Based on this, in this embodiment, when the combination of the candidate line redistribution and the extension mode is obtained, it is required that the obtained extension codeword after performing codeword extension using the obtained candidate line redistribution and the candidate extension mode satisfies the total code rate error, the total code rate range, and the mother code rate range.
For example, in this embodiment, all the check node degree sequences satisfying constraint (1), i.e., candidate row redistribution and candidate expansion pattern combinations, are found to form a set
Step 103: and obtaining the corresponding candidate column redistribution of each candidate row redistribution.
The candidate column weight distribution here includes the number of variable nodes corresponding to each column weight value within the column weight range, the column weight value corresponding to the candidate column weight distribution satisfies the column weight range, and the variance of the column weight value corresponding to the candidate column weight distribution satisfies the variance minimum condition.
In a preferred implementation manner, in this embodiment, among a plurality of possible column distributions corresponding to each candidate row redistribution, according to a column weight range in the constraint condition, column redistribution whose column weight value does not exceed the column weight range is screened out first, and then further screening is performed from the screened column redistribution, that is: and selecting the column redistribution with the smallest column redistribution variance, so as to obtain the candidate column redistribution corresponding to each candidate row redistribution.
Since the variance of the column weight value is the smallest in the candidate column weight distribution corresponding to each candidate row weight distribution, the number of matrix elements having a value of 1, that is, the degree of the variable node, is uniformly distributed in the check matrix corresponding to the candidate column weight distribution. And the variable node degrees which are uniformly distributed can lead the performance of decoding to be the highest.
For example, for a collectionEach element in the list is obtained to obtain a variable node degree sequence which meets the constraint condition (1) and has minimum variance, namely, the redistribution of candidate columns, so as to obtain a new set/>The set contains a combination of all candidate row redistributions, candidate expansion patterns, candidate column redistributions.
Step 104: and determining the target extension mode, the target row redistribution and the target column redistribution according to the candidate extension mode, the candidate row redistribution and the candidate column redistribution.
In this embodiment, the target extension mode, the target row redistribution and the target column redistribution that satisfy the lowest condition of the decoding threshold may be selected from the candidate extension mode, the candidate row redistribution and the candidate column redistribution.
Specifically, in this embodiment, for each candidate row redistribution and a possible matrix formed by the corresponding candidate column redistribution and the expansion mode, according to the distribution of the row redistribution value and the column redistribution, the candidate expansion mode is combined to obtain a corresponding decoding threshold value, and the candidate row redistribution, the candidate column redistribution and the candidate expansion mode corresponding to the minimum decoding threshold value are selected, so as to obtain a target expansion mode, a target row redistribution and a target column redistribution which meet the minimum condition of the decoding threshold.
For example, for a collectionThe decoding threshold of the GS code under different parameter combinations is analyzed by using an external information transfer function (EXIT) diagram and expressed by Th (N c,Nv, gamma), thereby obtaining the parameter combination which makes the decoding threshold lowest, namely/>
Step 105: and constructing a target check matrix according to the target row redistribution and the target column redistribution corresponding to the candidate row redistribution.
The row weight of the target check matrix constructed in the embodiment is matched with the target row weight distribution, and the column weight of the target check matrix is matched with the target column weight distribution. Based on the method, when the code words in the channel are encoded by using the target check matrix and the target extension mode, the generated target transmission code words can be in a short code structure with a low code rate, so that lower time delay can be ensured, and the reliability of code word transmission can be improved.
For example, a step-wise edge growth algorithm (PEG-ACE algorithm) that approximates the degree of external messaging is used to generate a coincidence degree distribution asThe LDPC matrix is H M×N.
Based on the above, the generated target check matrix can encode the code word in the channel by combining the target extension mode, and the target transmission code word with the short code structure of low code rate is obtained.
As can be seen from the above solution, in the method for constructing a channel coding check matrix in URLLC scene provided by the embodiment of the present application, by constructing a check matrix that extends for check nodes and optimizing the check matrix used for implementing coding, the code word structure with low code rate and short code length can be implemented in URLLC scene by using the optimized check matrix, which not only can ensure lower time delay, but also can improve transmission reliability.
In one implementation, the method in this embodiment may further include the following steps, as shown in fig. 3:
step 301: and encoding the information bits in the channel by using the target check matrix to obtain the LDPC code word.
The LDPC code word is the LDPC mother code output by the target check matrix, and the bit length of the LDPC code word corresponds to the number of variable nodes.
For example, LDPC encoding is performed using the check matrix H M×N, resulting in codeword C L＝[c1,c2,...,cN, corresponding to N LDPC variable nodes.
Step 302: and processing the LDPC code word according to the expansion proportion of the check node represented by the target expansion mode to obtain the algebraic code word corresponding to the expanded check node.
Each of the expanded check nodes may have one or more bits in the algebraic code word, and specifically, the bit length of the algebraic code word is related to the row weight value of the row in which the corresponding expanded check node is located.
For example, for an LDPC check node of degree i, γ inc,i are randomly selected for algebraic constraint expansion.
The expansion method comprises the following steps:
for LDPC code word corresponding to one check node m, the LDPC code word is I.e./>All bits in the m-th check node are positioned, and algebraic constraint expansion is completed by corresponding algebraic codes, as follows:
Wherein G i is a generating matrix containing all 1-column systematic algebraic codes, which can be Hadamard codes, RS codes, etc., and the generated algebraic code words are
Step 303: and obtaining the target transmission code word according to the LDPC code word and the algebraic code word.
Specifically, in this embodiment, algebraic code words corresponding to each extended check node may be sequentially added to the LDPC code words according to the order between the check nodes corresponding to the algebraic code words, thereby obtaining the target transmission code words.
For example, after all the obtained algebraic code words are sequentially added to the LDPC codeword C L, a GS codeword c= [ C L,CG ] can be obtained, where C G＝[cG,1,…,cG,m,…,cG,M],cG,m is an algebraic code word of the m-th check node of the LDPC mother code, and if the node is not expanded, it is zero bit.
Further, after step 303, the method in this embodiment may further include the following steps, as shown in fig. 4:
step 304: and performing puncturing processing on the target transmission code word so that the total code rate of the target transmission code word corresponds to the total code rate range.
The actual code rate R t of the GS code obtained by the above construction method has a certain error with the target code rate R G, such as R t≤RG, so that in this embodiment, the actual code rate may be increased by puncturing the target transmission codeword until the actual code rate matches with the target code rate. And the total number of bits punctured may be denoted by Z, where,
Specifically, in this embodiment, puncturing processing may be sequentially performed on algebraic code words corresponding to corresponding row weight values in the target transmission codeword according to the sequence from high to low of the corresponding row weight values in the target check matrix until the total code rate of the target transmission codeword corresponds to the total code rate range, that is, the actual number of bits punctured reaches the total number of bits punctured z.
The proportion of the code words subjected to puncturing processing in the algebraic code words of the target transmission code words in the algebraic code words is smaller than or equal to a preset proportion value. For example, puncturing is performed for all expanded algebraic code words of degree i, and the ratio of punctured code words to algebraic code words must not exceed the ratio p i.
Based on the above implementation scheme, specific examples are given below to illustrate the effects of the technical scheme of the present application:
(1) GS code design based on BCH code:
First, the design parameter k=104, E＝0.001./> Imin= 5,i max＝7,jmin =3 and j max =4;
design result: the code length of the LDPC codeword is 210, and the dot-based degree distribution is:
namely 199 variable nodes with 3 degrees, 11 variable nodes with 4 degrees, 1 check node with 5 degrees, 99 check nodes with 6 degrees and 6 check nodes with 7 degrees in the LDPC code word. The check matrix is shown in fig. 5, where the blocks represent bit 1. The BCH generation matrices used by the check nodes with the expansions of 5, 6 and 7 are respectively:
wherein the extended mode I.e. all spreading, the puncturing ratio is 0.
(2) GS code design based on Hadamard code
First, the design parameter k=102,E＝0.005./> imin＝5,imax＝7,jmin＝3,jmax＝4。
Design result: the LDPC code length is 208, and its degree distribution is as follows:
The LDPC parent code comprises 189 variable nodes with 3 degrees, 19 variable nodes with 4 degrees, 4 check nodes with 5 degrees, 91 check nodes with 6 degrees and 11 check nodes with 7 degrees. The check matrix is shown in fig. 6, where the square represents bit 1. The generation matrix of the Hadamard code adopted by the check nodes with the expansion degree of 5, 6 and 7 is as follows:
the algebraic code expansion adopts a partial expansion mode, and the expansion mode is as follows:
γ＝{γ5＝0.5000,γ6＝0.9780,γ7＝0.4545}。
And the puncturing proportion is selected to be 0.0041, the number of the punctures is 5, and the punctures are uniformly distributed in 5 algebraic check sequences with the degree of 7, therefore, the check matrix construction scheme provided by the embodiment of the application can enable the constructed code word to have the characteristics of short code length and low code rate, and can realize the channel transmission with low time delay and high reliability.
Referring to fig. 7, a schematic structural diagram of a device for constructing a codec check matrix in URLLC scenarios according to an embodiment of the present application is disclosed, which may be applied to a communication device, such as a mobile phone or a base station. The technical scheme in the embodiment is mainly used for optimizing the implementation mode of constructing the code word of the code word transmitted in the channel by constructing the check matrix for realizing channel coding so as to realize low-delay and high-reliability channel transmission.
Specifically, the apparatus in this embodiment may include the following functional units:
Constraint obtaining unit 701, configured to obtain constraint conditions of a channel coding check matrix, where the check matrix uses a behavior check node and uses a column as a variable node, and the constraint conditions at least include: total code rate error, total code rate range, mother code rate range, row re-range, column re-range;
Wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword;
A candidate line re-obtaining unit 702, configured to obtain a combination of a plurality of candidate line re-distributions and candidate extension modes according to the constraint condition, where the candidate line re-distributions include a number of check nodes corresponding to each line re-value in the line re-range, the candidate extension modes include an extension proportion of the check nodes corresponding to each line re-value in the line re-range, and the combination of the candidate line re-distributions and the candidate extension modes satisfies the total code rate error, the total code rate range, and the mother code rate range;
A candidate column re-obtaining unit 703, configured to obtain a candidate column re-distribution corresponding to each candidate row re-distribution, where the candidate column re-distribution includes a number of variable nodes corresponding to each column re-value in the column re-range;
A target distribution obtaining unit 704, configured to determine a target expansion pattern, a target row redistribution and the target column redistribution according to the candidate expansion pattern, the candidate row redistribution and the candidate column redistribution;
The matrix construction unit 705 is configured to construct a target check matrix according to the target row redistribution and the target column redistribution, where a row weight of the target check matrix is matched with the target row redistribution, a column weight of the target check matrix is matched with the target column redistribution, and the target check matrix and the target extension mode are used for encoding information bits in a channel to obtain a target transmission codeword.
As can be seen from the above solution, in the device for constructing a channel coding check matrix in URLLC scene provided by the embodiment of the present application, by constructing a check matrix that extends for check nodes and optimizing the check matrix used for implementing coding, the code word structure with low code rate and short code length can be implemented in URLLC scene by using the optimized check matrix, which not only can ensure lower time delay, but also can improve transmission reliability.
Based on the above implementation, the apparatus in this embodiment further includes the following units, as shown in fig. 8:
an encoding unit 706, configured to encode information bits in a channel using the target check matrix to obtain an LDPC codeword, where a bit length of the LDPC codeword corresponds to the number of variable nodes; processing the LDPC code word according to the expansion proportion of the check node represented by the target expansion mode to obtain an algebraic code word corresponding to the expanded check node, wherein the bit length of the algebraic code word is related to the row weight value of the check node row; and obtaining a target transmission codeword according to the LDPC codeword and the algebraic code codeword.
Alternatively, the encoding unit 706 may add the algebraic code words to the LDPC codeword in order between its corresponding check nodes to obtain the target transmission codeword.
In addition, the encoding unit 706 is further configured to puncture the target transmission codeword so that a total code rate of the target transmission codeword corresponds to the total code rate range. The method comprises the following steps: and sequentially puncturing algebraic code words corresponding to corresponding row weight values in the target transmission code words according to the sequence from high to low of the corresponding row weight values in the target check matrix until the total code rate of the target transmission code words corresponds to the total code rate range. The proportion of the code words subjected to the puncturing processing in the algebraic code words of the target transmission code words in the algebraic code words is smaller than or equal to a preset proportion value.
In one implementation, the variance of the column weight value corresponding to the candidate column weight distribution obtained by the candidate column weight obtaining unit 703 satisfies the variance minimum condition.
In one implementation, the target distribution obtaining unit 704 is specifically configured to: and selecting a target extension mode, a target row redistribution and a target column redistribution which meet the lowest condition of a coding threshold from the candidate extension mode, the candidate row redistribution and the candidate column redistribution.
It should be noted that, the specific implementation of each unit in this embodiment may refer to the corresponding content in the foregoing, which is not described in detail herein.
Referring to fig. 9, a schematic structural diagram of a communication device according to an embodiment of the present application is disclosed, where the communication device may be a terminal device in channel transmission, such as a mobile phone or a base station. The technical scheme in the embodiment is mainly used for optimizing the implementation mode of constructing the code word of the code word transmitted in the channel by constructing the check matrix for realizing channel coding so as to realize low-delay and high-reliability channel transmission.
Specifically, the communication device in this embodiment may include the following structure:
a memory 901 for storing a computer program and data generated by the operation of the computer program;
A processor 902 for executing the computer program to implement: obtaining constraint conditions of a channel coding check matrix, wherein the check matrix takes a behavior check node and takes a column as a variable node, and the constraint conditions at least comprise: total code rate error, total code rate range, mother code rate range, row re-range, column re-range; wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword; obtaining a combination of a plurality of candidate line redistribution and a candidate expansion mode according to the constraint condition, wherein the candidate line redistribution comprises the number of check nodes corresponding to each line weight value in the line weight range, the candidate expansion mode comprises the expansion proportion of the check nodes corresponding to each line weight value in the line weight range, and the combination of the candidate line redistribution and the candidate expansion mode meets the total code rate error, the total code rate range and the mother code rate range; obtaining candidate column redistribution corresponding to each candidate row redistribution, wherein the candidate column redistribution comprises the number of variable nodes corresponding to each column weight value in the column weight range; determining a target extension mode, a target row redistribution and the target column redistribution according to the candidate extension mode, the candidate row redistribution and the candidate column redistribution; and constructing a target check matrix according to the target row redistribution and the target column redistribution, wherein the row redistribution of the target check matrix is matched with the target row redistribution, the column redistribution of the target check matrix is matched with the target column redistribution, and the target check matrix and the target extension mode are used for encoding information bits in a channel to obtain a target transmission codeword.
In addition, the communication device further includes an encoder 903, configured to encode information bits in a channel using the target check matrix and the target extension mode to obtain a target transmission codeword.
As can be seen from the above solution, in the communication device provided by the embodiment of the present application, by constructing the check matrix that extends for the check node and optimizing the check matrix that is used to implement coding, the codeword structure with low code rate and short code length can be implemented in URLLC scenarios by using the optimized check matrix, which not only can ensure lower time delay, but also can improve transmission reliability.
Of course, other components may be included in the communication device, such as an antenna, a display screen, and various types of sensors.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software modules may be disposed in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. The method for constructing the channel coding check matrix in URLLC scene is characterized by comprising the following steps:
Obtaining constraint conditions of a channel coding check matrix, wherein the check matrix takes a behavior check node and takes a column as a variable node, and the constraint conditions at least comprise: total code rate error, total code rate range, mother code rate range, row re-range, column re-range;
Wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword;
Obtaining a combination of a plurality of candidate line redistribution and a candidate expansion mode according to the constraint condition, wherein the candidate line redistribution comprises the number of check nodes corresponding to each line weight value in the line weight range, the candidate expansion mode comprises the expansion proportion of the check nodes corresponding to each line weight value in the line weight range, and the combination of the candidate line redistribution and the candidate expansion mode meets the total code rate error, the total code rate range and the mother code rate range;
obtaining candidate column redistribution corresponding to each candidate row redistribution, wherein the candidate column redistribution comprises the number of variable nodes corresponding to each column weight value in the column weight range;
Determining a target extension mode, a target row redistribution and a target column redistribution according to the candidate extension mode, the candidate row redistribution and the candidate column redistribution;
and constructing a target check matrix according to the target row redistribution and the target column redistribution, wherein the row redistribution of the target check matrix is matched with the target row redistribution, the column redistribution of the target check matrix is matched with the target column redistribution, and the target check matrix and the target extension mode are used for encoding information bits in a channel to obtain a target transmission codeword.
2. The method according to claim 1, wherein the method further comprises:
encoding information bits in a channel by using the target check matrix to obtain LDPC code words, wherein the bit length of the LDPC code words corresponds to the number of the variable nodes;
processing the LDPC code word according to the expansion proportion of the check node represented by the target expansion mode to obtain an algebraic code word corresponding to the expanded check node, wherein the bit length of the algebraic code word is related to the row weight value of the check node row;
And obtaining a target transmission codeword according to the LDPC codeword and the algebraic code codeword.
3. The method of claim 2, wherein obtaining a target transmission codeword from the LDPC codeword and the algebraic code codeword comprises:
and adding the algebraic code words to the LDPC code words according to the sequence among the corresponding check nodes to obtain target transmission code words.
4. A method according to claim 2 or 3, characterized in that after obtaining a target transmission codeword from the LDPC codeword and the algebraic code word, the method further comprises:
And performing puncturing processing on the target transmission code word so that the total code rate of the target transmission code word corresponds to the total code rate range.
5. The method of claim 4, wherein puncturing the target transmission codeword comprises:
and sequentially puncturing algebraic code words corresponding to corresponding row weight values in the target transmission code words according to the sequence from high to low of the corresponding row weight values in the target check matrix until the total code rate of the target transmission code words corresponds to the total code rate range.
6. The method of claim 5, wherein a ratio of punctured codewords among the algebraic codewords of the target transmission codeword to the algebraic codewords is less than or equal to a preset ratio value.
7. A method according to claim 1 or 2, wherein the variance of the column weight values corresponding to the candidate column weight distributions satisfies a variance minimum condition.
8. The method of claim 1 or 2, wherein determining a target expansion pattern, a target row redistribution and a target column redistribution from the candidate expansion pattern, the candidate row redistribution and the candidate column redistribution comprises:
And selecting a target extension mode, a target row redistribution and a target column redistribution which meet the lowest condition of a coding threshold from the candidate extension mode, the candidate row redistribution and the candidate column redistribution.
9. The device for constructing the channel coding check matrix in URLLC scene is characterized by comprising the following components:
The constraint obtaining unit is used for obtaining constraint conditions of a channel coding check matrix, the check matrix uses a behavior check node and uses a column as a variable node, and the constraint conditions at least comprise: total code rate error, total code rate range, mother code rate range, row re-range, column re-range;
Wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword;
A candidate line redistribution obtaining unit, configured to obtain a combination of a plurality of candidate line redistribution and a candidate extension mode according to the constraint condition, where the candidate line redistribution includes a number of check nodes corresponding to each line weight value in the line redistribution range, the candidate extension mode includes an extension proportion of the check nodes corresponding to each line weight value in the line redistribution range, and the combination of the candidate line redistribution and the candidate extension mode satisfies the total code rate error, the total code rate range and the mother code rate range;
a candidate column redistribution obtaining unit, configured to obtain a candidate column redistribution corresponding to each candidate row redistribution, where the candidate column redistribution includes a number of variable nodes corresponding to each column weight value in the column weight range;
a target distribution obtaining unit, configured to determine a target expansion mode, a target row redistribution and a target column redistribution according to the candidate expansion mode, the candidate row redistribution and the candidate column redistribution;
the matrix construction unit is used for constructing a target check matrix according to the target row redistribution and the target column redistribution, wherein the row redistribution of the target check matrix is matched with the target row redistribution, the column redistribution of the target check matrix is matched with the target column redistribution, and the target check matrix and the target expansion mode are used for encoding information bits in a channel to obtain a target transmission codeword.
10. A communication device, comprising:
A memory for storing a computer program and data resulting from the execution of the computer program;
A processor for executing the computer program to implement: obtaining constraint conditions of a channel coding check matrix, wherein the check matrix takes a behavior check node and takes a column as a variable node, and the constraint conditions at least comprise: total code rate error, total code rate range, mother code rate range, row re-range, column re-range; wherein, the row weight is: the number of matrix elements with the value of 1 contained in the rows of the check matrix is as follows: the number of matrix elements with a value of 1 contained in the columns of the check matrix; the total code rate is as follows: the ratio of the bit length of the input codeword to the bit length of the output codeword, the mother code rate is: a ratio of a bit length of an input codeword to a bit length of an LDPC codeword in the output codeword, the output codeword comprising the LDPC codeword and an algebraic code codeword; obtaining a combination of a plurality of candidate line redistribution and a candidate expansion mode according to the constraint condition, wherein the candidate line redistribution comprises the number of check nodes corresponding to each line weight value in the line weight range, the candidate expansion mode comprises the expansion proportion of the check nodes corresponding to each line weight value in the line weight range, and the combination of the candidate line redistribution and the candidate expansion mode meets the total code rate error, the total code rate range and the mother code rate range; obtaining candidate column redistribution corresponding to each candidate row redistribution, wherein the candidate column redistribution comprises the number of variable nodes corresponding to each column weight value in the column weight range; determining a target extension mode, a target row redistribution and a target column redistribution according to the candidate extension mode, the candidate row redistribution and the candidate column redistribution; and constructing a target check matrix according to the target row redistribution and the target column redistribution, wherein the row redistribution of the target check matrix is matched with the target row redistribution, the column redistribution of the target check matrix is matched with the target column redistribution, and the target check matrix and the target extension mode are used for encoding information bits in a channel to obtain a target transmission codeword.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210013758.3A CN114362764B (en) | 2022-01-06 | 2022-01-06 | Construction method and device of channel coding check matrix in URLLC scene |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210013758.3A CN114362764B (en) | 2022-01-06 | 2022-01-06 | Construction method and device of channel coding check matrix in URLLC scene |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114362764A CN114362764A (en) | 2022-04-15 |
| CN114362764B true CN114362764B (en) | 2024-05-28 |
Family
ID=81107542
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210013758.3A Active CN114362764B (en) | 2022-01-06 | 2022-01-06 | Construction method and device of channel coding check matrix in URLLC scene |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114362764B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025441A (en) * | 2009-09-11 | 2011-04-20 | 北京泰美世纪科技有限公司 | Method for constructing low density parity check (LDPC) code check matrix, and method and device for encoding LDPC code |
| CN104579576A (en) * | 2015-01-27 | 2015-04-29 | 清华大学 | Code modulation method and system |
| CN105262493A (en) * | 2015-11-17 | 2016-01-20 | 中国人民解放军92728部队 | Decoding method of low-density parity check codes |
| WO2017214851A1 (en) * | 2016-06-14 | 2017-12-21 | 华为技术有限公司 | Signal transfer method, transmitting terminal, and receiving terminal |
| CN108471340A (en) * | 2018-03-15 | 2018-08-31 | 深圳清华大学研究院 | Code-rate-compatible QC-LDPC codes construction and channel coding method and system |
| CN111313909A (en) * | 2018-12-12 | 2020-06-19 | 北京航空航天大学 | LDPC code decoding method and encoding method |
| CN113141185A (en) * | 2020-01-17 | 2021-07-20 | 北京新岸线移动多媒体技术有限公司 | Construction method and device of LDPC code check matrix |
| WO2021180217A1 (en) * | 2020-03-13 | 2021-09-16 | 华为技术有限公司 | Rate matching method for ldpc code, and communication device |
-
2022
- 2022-01-06 CN CN202210013758.3A patent/CN114362764B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025441A (en) * | 2009-09-11 | 2011-04-20 | 北京泰美世纪科技有限公司 | Method for constructing low density parity check (LDPC) code check matrix, and method and device for encoding LDPC code |
| CN104579576A (en) * | 2015-01-27 | 2015-04-29 | 清华大学 | Code modulation method and system |
| CN105262493A (en) * | 2015-11-17 | 2016-01-20 | 中国人民解放军92728部队 | Decoding method of low-density parity check codes |
| WO2017214851A1 (en) * | 2016-06-14 | 2017-12-21 | 华为技术有限公司 | Signal transfer method, transmitting terminal, and receiving terminal |
| CN108471340A (en) * | 2018-03-15 | 2018-08-31 | 深圳清华大学研究院 | Code-rate-compatible QC-LDPC codes construction and channel coding method and system |
| CN111313909A (en) * | 2018-12-12 | 2020-06-19 | 北京航空航天大学 | LDPC code decoding method and encoding method |
| CN113141185A (en) * | 2020-01-17 | 2021-07-20 | 北京新岸线移动多媒体技术有限公司 | Construction method and device of LDPC code check matrix |
| WO2021180217A1 (en) * | 2020-03-13 | 2021-09-16 | 华为技术有限公司 | Rate matching method for ldpc code, and communication device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114362764A (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11374682B2 (en) | Method and apparatus for encoding data using a polar code | |
| US10886950B2 (en) | Method and apparatus for generating a code word | |
| CN106685586B (en) | Method and apparatus for generating low density parity check code for transmission in a channel | |
| US10361811B2 (en) | Channel coding method of variable length information using block code | |
| US7757150B2 (en) | Structured puncturing of irregular low-density parity-check (LDPC) codes | |
| US11581905B2 (en) | Method and apparatus for wirelessly communicating over a noisy channel with a variable codeword length polar code to improve transmission capacity | |
| US9215457B2 (en) | Method and system for communicating multimedia using reconfigurable rateless codes and decoding in-process status feedback | |
| US20180191459A1 (en) | Apparatus and methods for decoding assistant bit-based polar code construction | |
| CN108282259B (en) | Coding method and device | |
| US10812107B2 (en) | Apparatus and methods for polar code construction and bit position allocation | |
| US10666392B2 (en) | Apparatus and methods for rate matching in polar coding | |
| US8214717B2 (en) | Apparatus and method for decoding LDPC code based on prototype parity check matrixes | |
| CN107733440B (en) | Polygonal structured LDPC processing method and device | |
| US9876608B2 (en) | Encoding apparatus and encoding method | |
| US8327215B2 (en) | Apparatus and method for encoding LDPC code using message passing algorithm | |
| US20190260398A1 (en) | Design of puncturing pattern for polar codes | |
| CN112737600B (en) | Decoding method and decoder | |
| CN114362764B (en) | Construction method and device of channel coding check matrix in URLLC scene | |
| WO2017214851A1 (en) | Signal transfer method, transmitting terminal, and receiving terminal | |
| US10523239B2 (en) | Method for generating encoded data that is encoded based on low-density parity-check codes, and method for decoding the encoded data | |
| WO2018126914A1 (en) | Method and device for coding of quasi-cyclic low-density parity-check code, and storage medium | |
| US20190319638A1 (en) | Method for generating encoded data that is encoded based on low-density parity-check codes, and method for decoding the encoded data |
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 |