Unlock instant, AI-driven research and patent intelligence for your innovation.

LDPC (low density parity code) code construction method for realizing parallel decoding

A technology of LDPC codes and construction methods, which is applied in the information field and can solve problems such as high decoding parallelism and unobtainable

Inactive Publication Date: 2011-09-14
PEKING UNIV
View PDF2 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, according to the current LDPC code construction method, it is not possible to obtain an LDPC code with a high degree of decoding parallelism suitable for JRC operations.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • LDPC (low density parity code) code construction method for realizing parallel decoding
  • LDPC (low density parity code) code construction method for realizing parallel decoding
  • LDPC (low density parity code) code construction method for realizing parallel decoding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] The steps of constructing an LDPC code based on the PEG algorithm include:

[0063] 1) Initialize the parameters of the LDPC code, including the code length N and the code rate R; use the density derivation method or the EXIT graph method to determine the dimensional distribution function of the parity check matrix H.

[0064] 2) Determine the decoding parallelism Pr; Pr can divide N(1-R); each row of the H array is regarded as a check node, each column is regarded as a variable node, and the check node is planned as N(1-R) / Pr sets, denoted by Cprj, j represents the label of the set, j=1, 2...N(1-R) / Pr, each set has Pr check nodes.

[0065] 3) Use the Peg algorithm to construct the H matrix of the LDPC code, which requires that when determining the position of the non-zero element, the condition is met: among all the check nodes connected to the same variable node, there are no two check nodes belonging to the same variable node. A set of check nodes Cprj, j=1, 2...N(...

Embodiment 2

[0074] Embodiment 2, construct QC-LDPC code based on Block-PEG algorithm

[0075] Because the QC-LDPC code based on the Block-PEG algorithm is more widely used in practice, the following uses the QC-LDPC code as an example to introduce the new code structure proposed by the present invention based on the Block-PEG algorithm and suitable for JRC parallel decoders method (called JRC-QC-PEG code construction method).

[0076] The Block-PEG construction method is an upgrade of the PEG algorithm. It uses the PEG algorithm to construct the quasi-cyclic LDPC base matrix, but the construction process is combined with the calculation of the cyclic offset in the quasi-cyclic LDPC code base matrix. The Block-PEG algorithm constructs LDPC codes based on graph theory. Section 1 analyzes the requirements of JRC parallel decoding for the check matrix of LDPC codes. For QC-LDPC codes, if the parallelism of decoding is to be further improved, the base matrix must also meet the above requireme...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides an LDPC (low density parity code) code construction method for realizing parallel decoding, comprising the followings steps: 1) initializing parameters of LDPC codes; 2) determining decoding degree of parallelism (Pr), namely, the line number of decoding is required simultaneously, elements in each line of an H array are taken as verification nodes, elements in each row of the H array are taken as variable nodes, all the verification nodes form a plurality of verification node collections in accordance with parallel arithmetic requirements, and each collection comprisesmultiple verification nodes; and 3) constructing an H array with the LDPC codes, wherein when the positions of nonzero elements are determined, namely, when the connection of bipartite graphs of the H array is determined, the phenomenon that any two verification nodes in all the connected verification nodes on the same variable node belong to the same verification node collection does not occur. The construction method is utilized to construct the LDPC codes with higher degree of parallelism, thereby being capable of supporting higher parallel decoding rate.

Description

technical field [0001] The invention relates to a channel encoding method, in particular to an LDPC code construction method suitable for realizing parallel decoding, and belongs to the field of information technology. Background technique [0002] As a basic technology to ensure reliable transmission of communication systems, channel coding technology has been developed rapidly. LDPC code is an important channel coding, and there are many efficient decoding methods. Among them, Joint Row-Column Decoding (Joint Row-Column Decoding, JRC decoding method for short) is an efficient and fast decoding algorithm, which can also be combined with the min-sum algorithm for hierarchical decoding. The following is a brief analysis of the JRC algorithm flow. [0003] Let H mxn Is the LDPC parity check matrix, first initialized: U i = u i0 1≤i≤n; u ji =0, i∈N(j), 1≤j≤m. U in the above formula i Indicates the sum of extrinsic information sent by variable node i. u i0 is the log-l...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H03M13/11
Inventor 董明科郑雅丹王达项海格金野
Owner PEKING UNIV