CN117097350A - LDPC code decoding realization method, device, equipment and medium - Google Patents
LDPC code decoding realization method, device, equipment and medium Download PDFInfo
- Publication number
- CN117097350A CN117097350A CN202311144537.0A CN202311144537A CN117097350A CN 117097350 A CN117097350 A CN 117097350A CN 202311144537 A CN202311144537 A CN 202311144537A CN 117097350 A CN117097350 A CN 117097350A
- Authority
- CN
- China
- Prior art keywords
- base matrix
- variable nodes
- decoding
- iteration
- rows
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 239000011159 matrix material Substances 0.000 claims abstract description 82
- 238000004080 punching Methods 0.000 claims abstract description 29
- 238000004590 computer program Methods 0.000 claims description 16
- 230000008707 rearrangement Effects 0.000 claims description 12
- 238000012795 verification Methods 0.000 claims description 7
- 238000003860 storage Methods 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 9
- 238000012545 processing Methods 0.000 description 7
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000004075 alteration Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008092 positive 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
-
- 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Error Detection And Correction (AREA)
Abstract
The application relates to a method, a device, equipment and a medium for realizing LDPC code decoding, wherein the method comprises the following steps: rearranging the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of the punching variable nodes; and carrying out layered decoding by adopting the rearranged base matrix. The application can optimize the decoding performance under the condition that the complexity is not improved.
Description
Technical Field
The present application relates to the field of wireless communications technologies, and in particular, to a method, an apparatus, a device, and a medium for implementing decoding of an LDPC code.
Background
The LDPC decoding algorithm is update decoded based on message passing on Tanner graph, as shown in fig. 1, wherein,is the initial received message of the channel, which represents the jth codeword c j The confidence level is 1. q ji (1) Is variable node v j To check node z i Delivered variable message representing variable node v j According to other check nodes and channel initial information +.>To check node z i Claim c j Confidence level of=1. r is (r) ij (1) Is the check node z i To variable node v j A transferred check message representing check node z i According to the current state of other variable nodes j Claim c j Let check node z =1 i The represented check equation satisfies the confidence level.
The information is converted into a logarithmic domain, and then: channel initial informationInformation of check node to variable node +.>Information of variable node transmitted to check node +.>Decision information of variable node->
Decoding according to a Layer scheduling scheme (using a hierarchical minimum sum decoding algorithm), wherein a check matrix of an LDPC code is divided into a plurality of layers according to rows, the hierarchical decoding is sequentially updated according to the layers, variable node information is updated immediately after the check node processing of each Layer is completed, the variable node information updated in the previous Layer can be used when the check node processing of the next Layer is completed, and when the update of all the Layer check nodes is completed, one iteration is completed, specifically:
(1) Initializing: initializing the information of all variable nodes and the information transmitted to the variable nodes by the check nodes, namely:
(2) And (3) iteration processing: calculating variable node information L of the first iteration and the k layer (l,k) (q j ) And the verification information L of the first iteration (l) (r ij ) The method specifically comprises the following steps:
and (5) updating in a layering way:and (3) judging: k is the last layer, if L (l,k) (q j ) < 0, then c j =1, otherwise c j ＝0。
(3) Stopping iteration if Hc T =0 or up to the maximum number of iterationsAnd if the number is the number, ending the iteration, otherwise, continuing the iteration.
The decoding update sequence is as follows: for the base matrix BG1, the scheduling update is performed in the order of the 1 st row to 46 th row of the matrix during decoding, and for the base matrix BG2, the scheduling update is performed in the order of the 1 st row to 42 th row of the matrix during decoding. In the hierarchical decoding process, the base matrix is updated from top to bottom, so that the decoding performance is limited.
Disclosure of Invention
The technical problem to be solved by the application is to provide a method, a device, equipment and a medium for realizing LDPC code decoding, which can optimize decoding performance under the condition that complexity is not improved.
The technical scheme adopted for solving the technical problems is as follows: the method for realizing LDPC code decoding comprises the following steps:
rearranging the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of the punching variable nodes;
and carrying out layered decoding by adopting the rearranged base matrix.
When the scheduling sequence of the base matrix is rearranged according to the row weights of the base matrix and the number of the punching variable nodes, the rows of the base matrix are divided into different sets according to the punching number, the sets are ordered according to the punching number from low to high, and the rows in the sets are arranged according to the row weights from low to high.
The rearrangement of the scheduling sequence of the base matrix according to the row weight of the base matrix and the number of the punching variable nodes specifically comprises the following steps:
classifying the rows of the base matrix according to the number of the row punching variable nodes;
the method comprises the steps of marking a set of lines with the number of the perforation variable nodes being 0 as a set R0, marking a set of lines with the number of the perforation variable nodes being 1 as a set R1, and marking a set of lines with the number of the perforation variable nodes being 2 as a set R2;
the rows in the set R0, the set R1 and the set R2 are arranged from low to high according to row weights, so that a new set R0', a set R1' and a set R2' are obtained;
and sequentially arranging the set R0', the set R1' and the set R2' to obtain a rearranged base matrix.
The layered decoding by adopting the rearranged base matrix specifically comprises the following steps:
initializing the information of all variable nodes and the information transmitted to the variable nodes by the check nodes;
in one iteration, variable node information and verification information of the iteration are updated according to the layer sequence of the rearranged base matrix;
when the last layer is updated, making a decision to obtain a decision bit sequence;
if Hc T And (c) stopping iteration if H is the check matrix and c is the decision bit sequence, outputting the decision bit as a decoding result, otherwise, continuing iteration until the maximum iteration number is reached.
The technical scheme adopted for solving the technical problems is as follows: there is provided an LDPC code decoding implementing apparatus including:
the rearrangement module is used for rearranging the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of the punching variable nodes;
and the decoding module is used for carrying out layered decoding by adopting the rearranged base matrix.
When the rearrangement module rearranges the scheduling sequence of the base matrix, the rows of the base matrix are divided into different sets according to the punching quantity, the sets are ordered from low to high according to the punching quantity, and the rows in the sets are arranged from low to high according to the row weight
The rearrangement module comprises:
the classifying unit is used for classifying the rows of the base matrix according to the number of the row punching variable nodes;
a marking unit, configured to mark a set of rows with a number of perforation variable nodes of 0 as a set R0, a set of rows with a number of perforation variable nodes of 1 as a set R1, and a set of rows with a number of perforation variable nodes of 2 as a set R2;
the sorting unit is used for arranging the rows in the set R0, the set R1 and the set R2 from low to high according to row weights to obtain a new set R0', a set R1' and a set R2';
the arrangement unit is used for arranging the set R0', the set R1' and the set R2' in sequence to obtain a rearranged base matrix.
The coding module includes:
the initialization unit is used for initializing the information of all the variable nodes and the information transmitted to the variable nodes by the check nodes;
the iteration unit is used for updating variable node information and verification information of the iteration according to the layer sequence of the rearranged base matrix in the iteration;
the judging unit is used for judging after the last layer is updated to obtain a judging bit sequence;
a termination judging unit for judging the termination of the operation of the device at Hc T And (c) stopping iteration if H is the check matrix and c is the decision bit sequence, outputting the decision bit as a decoding result, otherwise, continuing iteration until the maximum iteration number is reached.
The technical scheme adopted for solving the technical problems is as follows: there is provided an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the above LDPC code decoding implementation method when executing the computer program.
The technical scheme adopted for solving the technical problems is as follows: there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the LDPC code decoding implementation method described above.
Advantageous effects
Due to the adoption of the technical scheme, compared with the prior art, the application has the following advantages and positive effects: the application rearranges the base matrix in advance according to the row weight of the base matrix and the number of the punching variable nodes before decoding, and decodes based on the rearranged base matrix, so that the decoding performance can be effectively improved, the convergence is quickened, and the decoding performance gain of about 0.2dB can be obtained under the configuration of 5g nr BG1 through simulation.
Drawings
FIG. 1 is an LDPC decoding tanner graph;
FIG. 2 is a flowchart of a method for implementing LDPC code decoding according to a first embodiment of the present application;
fig. 3 is a flowchart of a base matrix rearrangement process according to a first embodiment of the present application;
fig. 4 is a schematic diagram of the rearranged base matrix BG 1;
fig. 5 is a schematic diagram of the rearranged base matrix BG 2.
Detailed Description
The application will be further illustrated with reference to specific examples. It is to be understood that these examples are illustrative of the present application and are not intended to limit the scope of the present application. Furthermore, it should be understood that various changes and modifications can be made by one skilled in the art after reading the teachings of the present application, and such equivalents are intended to fall within the scope of the application as defined in the appended claims.
A first embodiment of the present application relates to a method for implementing decoding of an LDPC code, as shown in fig. 2, including the steps of:
and step 1, rearranging the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of the punching variable nodes.
In the check matrix, when the row weight is lower, the variable nodes connected with check nodes of the row are fewer, so that the reliability of corresponding variable information is higher, and therefore, the row with lower row weight can be updated preferentially in layered decoding, and the variable information with high reliability can be obtained preferentially and transmitted to other nodes connected with the variable information earlier.
According to the 5g nr rate matching strategy, the variable nodes corresponding to the first two columns in the base matrix are punctured, so that the LLR of the two columns of variables is initialized to 0 in the decoding process. If one check node is connected with one punching variable node, in the decoding updating, the variable information of the punching variable node is not 0, and the information of other connected variable nodes is 0, if one check node is connected with two punching variable nodes, the information of the variable nodes connected with the check node is 0, and in essence, the updating of the row has no effect on decoding. Therefore, the row with less punching is preferentially selected, the information of the punching position can be updated as soon as possible, and the situation that the variable information is 0 in the follow-up process is avoided.
Therefore, in this step, when the scheduling sequence of the base matrix is rearranged, the row with the lower row weight is adjusted to the front, and the row with the larger number of the variable nodes is adjusted to the rear. As shown in fig. 3, the method comprises the following steps:
classifying the rows of the base matrix according to the number of the row punching variable nodes;
the method comprises the steps of marking a set of lines with the number of the perforation variable nodes being 0 as a set R0, marking a set of lines with the number of the perforation variable nodes being 1 as a set R1, and marking a set of lines with the number of the perforation variable nodes being 2 as a set R2;
the rows in the set R0, the set R1 and the set R2 are arranged from low to high according to row weights, so that a new set R0', a set R1' and a set R2' are obtained;
and sequentially arranging the set R0', the set R1' and the set R2' to obtain a rearranged base matrix.
The reason for the rearrangement in the above manner is that the fewer the variable nodes in the first two columns are, the lower the row weight is, so that the principle that the row weight is arranged from low to high is ensured while the arrangement of the punching number from low to high is also satisfied as much as possible.
Fig. 4 and 5 show schematic diagrams after rearrangement of the base matrix BG1 and the base matrix BG2, respectively.
And step 2, performing layered decoding by adopting the rearranged base matrix. The method specifically comprises the following steps:
initializing the information of all variable nodes and the information transmitted to the variable nodes by the check nodes;
in one iteration, variable node information and verification information of the iteration are updated according to the layer sequence of the rearranged base matrix;
when the last layer is updated, making a decision to obtain a decision bit sequence;
if Hc T =0, h isAnd c is a decision bit sequence, stopping iteration, outputting decision bits as decoding results, and otherwise, continuing iteration until the maximum iteration times.
It is not difficult to find that the application rearranges the base matrix in advance according to the row weight of the base matrix and the number of the variable nodes of punching before decoding, and decodes based on the rearranged base matrix, so that the decoding performance can be effectively improved, the convergence is quickened, and the decoding performance gain of about 0.2dB can be obtained under the configuration of 5g nr BG1 through simulation.
A second embodiment of the present application relates to an LDPC code decoding implementation apparatus, including:
the rearrangement module is used for rearranging the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of the punching variable nodes;
and the decoding module is used for carrying out layered decoding by adopting the rearranged base matrix.
When the rearrangement module rearranges the scheduling sequence of the base matrix, the rows of the base matrix are divided into different sets according to the punching quantity, the sets are ordered from low to high according to the punching quantity, and the rows in the sets are arranged from low to high according to the weight of the rows.
The rearrangement module comprises:
the classifying unit is used for classifying the rows of the base matrix according to the number of the row punching variable nodes;
a marking unit, configured to mark a set of rows with a number of perforation variable nodes of 0 as a set R0, a set of rows with a number of perforation variable nodes of 1 as a set R1, and a set of rows with a number of perforation variable nodes of 2 as a set R2;
the sorting unit is used for arranging the rows in the set R0, the set R1 and the set R2 from low to high according to row weights to obtain a new set R0', a set R1' and a set R2';
the arrangement unit is used for arranging the set R0', the set R1' and the set R2' in sequence to obtain a rearranged base matrix.
The coding module includes:
the initialization unit is used for initializing the information of all the variable nodes and the information transmitted to the variable nodes by the check nodes;
the iteration unit is used for updating variable node information and verification information of the iteration according to the layer sequence of the rearranged base matrix in the iteration;
a decision unit for obtaining a decision bit sequence;
a termination judging unit for judging the termination of the operation of the device at Hc T And (c) stopping iteration if H is the check matrix and c is the decision bit sequence, outputting the decision bit as a decoding result, otherwise, continuing iteration until the maximum iteration number is reached.
A third embodiment of the present application relates to an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the LDPC code decoding implementation method of the first embodiment when executing the computer program.
A fourth embodiment of the present application relates to a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the LDPC code decoding implementation method of the first embodiment.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein. The scheme in the embodiment of the application can be realized by adopting various computer languages, such as object-oriented programming language Java, an transliteration script language JavaScript and the like.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the spirit or scope of the application. Thus, it is intended that the present application also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.
Claims (10)
1. An implementation method for decoding LDPC codes is characterized by comprising the following steps:
rearranging the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of the punching variable nodes;
and carrying out layered decoding by adopting the rearranged base matrix.
2. The method according to claim 1, wherein when the scheduling sequence of the base matrix is rearranged according to the row weights of the base matrix and the number of the variable nodes of the holes, the rows of the base matrix are divided into different sets according to the number of the holes, the sets are ordered according to the number of the holes from low to high, and the interior of each set is ordered according to the row weights from low to high.
3. The method for implementing LDPC code decoding according to claim 1, wherein the reordering of the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of variable nodes of puncturing, specifically comprises:
classifying the rows of the base matrix according to the number of the row punching variable nodes;
the method comprises the steps of marking a set of lines with the number of the perforation variable nodes being 0 as a set R0, marking a set of lines with the number of the perforation variable nodes being 1 as a set R1, and marking a set of lines with the number of the perforation variable nodes being 2 as a set R2;
the rows in the set R0, the set R1 and the set R2 are arranged from low to high according to row weights, so that a new set R0', a set R1' and a set R2' are obtained;
and sequentially arranging the set R0', the set R1' and the set R2' to obtain a rearranged base matrix.
4. The method for implementing LDPC code decoding according to claim 1, wherein the performing layered decoding using the rearranged base matrix specifically includes:
initializing the information of all variable nodes and the information transmitted to the variable nodes by the check nodes;
in one iteration, variable node information and verification information of the iteration are updated according to the layer sequence of the rearranged base matrix;
when the last layer is updated, making a decision to obtain a decision bit sequence;
if Hc T And (c) stopping iteration if H is the check matrix and c is the decision bit sequence, outputting the decision bit as a decoding result, otherwise, continuing iteration until the maximum iteration number is reached.
5. An apparatus for implementing decoding of an LDPC code, comprising:
the rearrangement module is used for rearranging the scheduling sequence of the base matrix according to the row weights of the base matrix and the number of the punching variable nodes;
and the decoding module is used for carrying out layered decoding by adopting the rearranged base matrix.
6. The apparatus according to claim 5, wherein when the rearrangement module rearranges the scheduling sequence of the base matrix, the rows of the base matrix are divided into different sets according to the number of holes, the sets are ordered according to the number of holes from low to high, and the rows are arranged from low to high inside the sets.
7. The apparatus for implementing LDPC code decoding according to claim 5, wherein the reordering module comprises:
the classifying unit is used for classifying the rows of the base matrix according to the number of the row punching variable nodes;
a marking unit, configured to mark a set of rows with a number of perforation variable nodes of 0 as a set R0, a set of rows with a number of perforation variable nodes of 1 as a set R1, and a set of rows with a number of perforation variable nodes of 2 as a set R2;
the sorting unit is used for arranging the rows in the set R0, the set R1 and the set R2 from low to high according to row weights to obtain a new set R0', a set R1' and a set R2';
the arrangement unit is used for arranging the set R0', the set R1' and the set R2' in sequence to obtain a rearranged base matrix.
8. The apparatus for implementing LDPC code decoding according to claim 5, wherein the decoding module comprises:
the initialization unit is used for initializing the information of all the variable nodes and the information transmitted to the variable nodes by the check nodes;
the iteration unit is used for updating variable node information and verification information of the iteration according to the layer sequence of the rearranged base matrix in the iteration;
the judging unit is used for obtaining a judging bit sequence after the last layer is updated;
a termination judging unit for judging the termination of the operation of the device at Hc T And (c) stopping iteration if H is the check matrix and c is the decision bit sequence, outputting the decision bit as a decoding result, otherwise, continuing iteration until the maximum iteration number is reached.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the LDPC code decoding implementation method according to any of claims 1-4 when the computer program is executed.
10. A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the LDPC code decoding implementation method according to any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311144537.0A CN117097350A (en) | 2023-09-06 | 2023-09-06 | LDPC code decoding realization method, device, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311144537.0A CN117097350A (en) | 2023-09-06 | 2023-09-06 | LDPC code decoding realization method, device, equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117097350A true CN117097350A (en) | 2023-11-21 |
Family
ID=88783409
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311144537.0A Pending CN117097350A (en) | 2023-09-06 | 2023-09-06 | LDPC code decoding realization method, device, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117097350A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107294543A (en) * | 2017-06-19 | 2017-10-24 | 电子科技大学 | A kind of method for generating RC LDPC check matrixes |
| CN108092673A (en) * | 2018-02-10 | 2018-05-29 | 中国传媒大学 | A kind of BP iterative decoding method and system based on dynamic dispatching |
| CN109309502A (en) * | 2018-08-03 | 2019-02-05 | 西安电子科技大学 | The layering LDPC basic matrix of 5G NR standard handles interpretation method |
| CN111865333A (en) * | 2020-08-06 | 2020-10-30 | 南京信息工程大学 | Bit level punching method based on code rate compatibility of multivariate LDPC codes |
| CN113098530A (en) * | 2021-04-01 | 2021-07-09 | 中山大学 | LDPC code decoding method based on average cluster residual dynamic scheduling selection strategy |
| CN114499541A (en) * | 2022-01-05 | 2022-05-13 | 浙江科睿微电子技术有限公司 | Layered decoding method, device, terminal equipment and medium |
-
2023
- 2023-09-06 CN CN202311144537.0A patent/CN117097350A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107294543A (en) * | 2017-06-19 | 2017-10-24 | 电子科技大学 | A kind of method for generating RC LDPC check matrixes |
| CN108092673A (en) * | 2018-02-10 | 2018-05-29 | 中国传媒大学 | A kind of BP iterative decoding method and system based on dynamic dispatching |
| CN109309502A (en) * | 2018-08-03 | 2019-02-05 | 西安电子科技大学 | The layering LDPC basic matrix of 5G NR standard handles interpretation method |
| CN111865333A (en) * | 2020-08-06 | 2020-10-30 | 南京信息工程大学 | Bit level punching method based on code rate compatibility of multivariate LDPC codes |
| CN113098530A (en) * | 2021-04-01 | 2021-07-09 | 中山大学 | LDPC code decoding method based on average cluster residual dynamic scheduling selection strategy |
| US20220329262A1 (en) * | 2021-04-01 | 2022-10-13 | Sun Yat-Sen University | Decoding method of ldpc codes based on partial average residual belief propagation |
| CN114499541A (en) * | 2022-01-05 | 2022-05-13 | 浙江科睿微电子技术有限公司 | Layered decoding method, device, terminal equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liang et al. | An iterative BP-CNN architecture for channel decoding | |
| RU2739465C2 (en) | Method and apparatus for encoding and decoding codes with low density of parity checks | |
| CN105978577B (en) | A kind of serial list decoding method based on bit reversal | |
| CN102412847B (en) | Method and apparatus for decoding low density parity check code using united node processing | |
| EP3657684A1 (en) | Memory management and path sorting in a polar code successive cancellation list decoder | |
| CN102315911B (en) | A kind of low density parity check code encoding method and device | |
| CN109361404A (en) | A kind of LDPC decoding system and interpretation method based on semi-supervised deep learning network | |
| CN108574494B (en) | Coding and decoding method and device | |
| CN109889205B (en) | Coding method and system, decoding method and system, coding and decoding method and system | |
| US10135466B2 (en) | Data sending method and apparatus | |
| CN110024294A (en) | The generation of Space Coupling quasi-cyclic LDPC code | |
| CN111200441B (en) | Polar code decoding method, device, equipment and readable storage medium | |
| US20080168333A1 (en) | Decoding method and decoding apparatus as well as program | |
| CN109995380A (en) | Interpretation method and equipment | |
| CN114499743B (en) | Communication data processing method, device, equipment and storage medium | |
| EP3364578A1 (en) | Decoding method and decoder for low-density parity check code | |
| CN111210017B (en) | Method, device, equipment and storage medium for determining layout sequence and data processing | |
| CN111865335A (en) | Decoding method and device of packet error correcting code, storage medium and electronic device | |
| CN117097350A (en) | LDPC code decoding realization method, device, equipment and medium | |
| KR20160116980A (en) | Scheduling apparatus and method of the parity check matrix h for vertical shuffle scheduling algorithm of the low density parity check decoder | |
| CN106849959B (en) | Data processing method and decoder | |
| CN112737599A (en) | Self-learning rapid convergence decoding method and device for original pattern LDPC code | |
| CN110324111B (en) | Decoding method and device | |
| US11165447B2 (en) | GCC decoding and polar code successive-cancellation list decoding with decomposition into concatenated inner and outer codes | |
| US20200295787A1 (en) | Low latency sequential list decoding of polar codes |
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 |