Method for constructing LDPC (low density parity check) codes based on row-column combined iterative decoding

An LDPC code and joint iteration technology, applied in the field of information, can solve the problems of not fully exploiting the high-speed performance of the row-column joint iterative decoding algorithm, unable to obtain the LDPC code set, and restricting the decoding speed, so as to improve the throughput and reduce the delay. , the effect of improving the decoding rate

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

AI Technical Summary

Problems solved by technology

The time delay caused by hardware data update between row operations restricts the improvement of decoding speed, and does not give full play to the high-speed performance of the row-column joint it

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
  • Method for constructing LDPC (low density parity check) codes based on row-column combined iterative decoding
  • Method for constructing LDPC (low density parity check) codes based on row-column combined iterative decoding
  • Method for constructing LDPC (low density parity check) codes based on row-column combined iterative decoding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] Embodiment 1, constructing LDPC code based on PEG algorithm

[0063] Include steps:

[0064] 1) Initialize the parameters of the LDPC code, including the dimension distribution function of code length N, code rate R, check matrix H;

[0065] 2) The elements of each row of the check matrix H are regarded as check nodes, and the elements of each column are regarded as variable nodes, and the arrangement order of the check nodes during operation is set;

[0066] 3) Utilize the Peg algorithm to construct the parity check matrix H of the LDPC code, constructing the H matrix includes the following steps:

[0067] (a) each row of the H matrix is ​​regarded as a check node, each column is regarded as a variable node, and the bipartite graph of the initialization H matrix has m=N (1-R) ​​check nodes and n=N variable nodes;

[0068] (b) Add m check nodes to the bipartite graph, add variable nodes one by one, and establish a connection path with qualified destination check nodes...

Embodiment 2

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

[0076] Since it is more commonly used to construct QC-LDPC codes based on the Block-PEG algorithm, the following introduces in detail the present invention based on the Block-PEG algorithm, a QC-LDPC code construction method given, and the LDPC code constructed by this method is in the row operation order The non-zero blocks in the upper two adjacent rows do not share one column at the same time, thereby solving the delay problem of data update between rows in the row-column combination decoder, and improving the decoding rate.

[0077] The process of constructing QC-LDPC code is the process of constructing its base matrix. The base matrix contains two key parameters of the QC-LDPC code: the position of each unit cyclic shift matrix and the corresponding cyclic shift offset. Therefore, the construction algorithm can be divided into two main steps: first, determine the position of the cyclic shift matri...

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 a method for constructing LDPC (low density parity check) codes based on row-column combined iterative decoding, comprising the following steps: 1, initializing parameters of the LDPC codes; 2, setting an operation sequence of rows (block rows); and 3, using a Peg or (Block-Peg) algorithm to construct an H matrix of the LDPC codes [QC (quasi-cyclic)-LDPC codes], wherein when positions of nonzero elements (sub-blocks) are determined, that is, when the connection of bipartite graphs of the H matrix is determined, the condition met: any two check nodes in all connected check nodes at the same variable node are not adjacent under an arrangement sequence determined in the step 2. The nonzero blocks in the two adjacent rows under the operation sequence of the rows of the constructed LDPC codes are not in the same column, thus reducing the time delay of information updating between the rows when hardware is realized, and improving the decoding rate.

Description

technical field [0001] The invention relates to a channel coding technology, in particular to an LDPC code construction method based on row-column joint iterative decoding, and belongs to the field of information technology. Background technique [0002] Channel coding technology, as the basic technology to ensure the reliable transmission of communication system, has been developed rapidly. LDPC code is an important channel coding method, which has many efficient decoding methods. Compared with the decoding algorithm, the decoding speed is fast, and the column operator is not required. When decoding, its row operator is based on the belief propagation algorithm, according to the log likelihood ratio U j and external information v ij Calculate the new logarithmic natural ratio U' j and extrinsic information v’ ij , the specific algorithm is as follows: if the code length of the LDPC code is N, and the code rate is R, then the size of the parity check matrix H is M N, whe...

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
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap