Dual cycle construction method suitable for high code rate quasi cyclic-low density parity check (QC-LDPC) code

A construction method and a double-cycle technology, applied in the field of low-density parity-check codes, can solve problems such as increasing column weight, increasing the minimum code distance, limiting the number of rows and maximum column weight, etc., and achieving the effect of improving codeword performance

Active Publication Date: 2015-08-05
南京融星智联信息技术有限公司
View PDF4 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0014] Purpose of the invention: In order to solve the problem of the limited number of rows and the maximum column weight in the QC-LDPC code base matrix, the present invention proposes a double-cycle construction method suitable

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
  • Dual cycle construction method suitable for high code rate quasi cyclic-low density parity check (QC-LDPC) code
  • Dual cycle construction method suitable for high code rate quasi cyclic-low density parity check (QC-LDPC) code
  • Dual cycle construction method suitable for high code rate quasi cyclic-low density parity check (QC-LDPC) code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] The present invention will be further described below in conjunction with the accompanying drawings.

[0050] Known QC-LDPC code base matrix column number N, code rate R, row number M=N(1-R), column weight is λ, row weight is ρ, maximum column weight and maximum row weight are respectively λ m and ρ m express. Use the DE algorithm to traverse and optimize the edge distribution of the basis matrix, and then construct the basis matrix H through the PEG-ACE algorithm M×N . Column weight λ of the current first variable node m0 = M, assuming we still need to increase the column weight of the first variable node to λ m (Mm ≤2M). So for the basis matrix H M×N The processing steps are as follows:

[0051] 1) Construct a size with H M×N The same all-zero matrix H 0 The first column of the matrix (λ m -M) element set "1";

[0052] 2) put H M×N and H 0 These two matrices are simply merged into a single matrix H of size 2(MxN) 2(MxN) , using the construction method of...

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

According to a quasi-cyclic low density parity check code basis matrix construction method, node distribution acquired through optimization of a density evolution algorithm is used, then a stretch factor Z is set, the circle length of the LDPC code check matrix and external message scale of the circle are jointed optimized, finally, a QC-LDPC code basis matrix with excellent performances is generated through extension. Each element in the basis matrix is corresponding to one Z*Z dimensional all-zero matrix, a unit matrix or a cyclic shift matrix of the unit matrix. But in construction of high code rate QC-LDPC code, the contradiction of limitation of matrix row number and maximum line number usually occurs, namely, the maximum line number is greater than the row number. To solve the problem, the invention provides construction of the basis matrix through a method increasing line number through superposition of a plurality of cyclic shift matrixes, namely, multiple cyclic shift matrixes are embedded in a single block matrix. The "superposition" operation is binary addition, the constructed basis matrix not only guarantees the cycle performance of the QC-LDPC code, but also meets the requirement of optimization of codon performance through increase of minimum code distance.

Description

technical field [0001] The present invention relates to a low-density parity-check code, in particular to a method for constructing a check matrix of a low-density parity-check code. Background technique [0002] Channel coding technology is an indispensable key technology for mobile communication systems, and the low density parity check (Low Density Parity Check, LDPC) code in channel coding technology is generally considered to be a channel coding method with superior performance. It has attracted widespread attention for its performance approaching the Shannon limit (referring to the maximum transmission rate for error-free transmission on a channel with random bit errors), and has been applied in the research of mobile communication systems. LDPC code is a special kind of linear block code. Its particularity lies in the fact that the number of 1s in its parity check matrix is ​​far less than the number of 0s, which is called sparsity, also known as low density. It is a...

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 南京融星智联信息技术有限公司
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