A construction method of ldpc convolutional code

A construction method and technology of convolutional codes, applied in the field of communication coding, can solve the problems of complex algorithms and low coding efficiency, and achieve the effects of fast coding characteristics, low error code platform, and good decoding performance.

Inactive Publication Date: 2019-06-18
SOUTH CHINA NORMAL UNIVERSITY
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Some studies have pointed out that the parity check matrix H composed of monomials has better ring characteristics, but this structure is obtained by random search algorithm, the algorithm is more complicated, and the coding efficiency is not high

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
  • A construction method of ldpc convolutional code
  • A construction method of ldpc convolutional code
  • A construction method of ldpc convolutional code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] An LDPC convolutional code with code rate R=(n-m) / n can be defined as satisfying the equation vH T =0 sequence set, where v=(...,v 0 ,v 1 ,…,v t …), t∈Z,

[0050]

[0051] In formula (1), the symbol T is the transpose of the matrix, H T It is called the check model of the LDPC convolutional code, and H is called the parity check matrix of the LDPC convolutional code. Submatrix H i (t),i=0,1,...,m s , is an m×n binary matrix that satisfies the following properties:

[0052] 1)H i (t)=0, im s , any t;

[0053] 2) There is a time t such that

[0054] call m s is the verification model memory of the LDPC convolutional code, called v s =(m s +1)·n is the constraint length of the LDPC convolutional code. Equation vH T =0 can be rewritten as

[0055]

[0056] If an n×m binary submatrix is full rank, and the final m×m matrix is ​​the identity matrix, the equation can be used

[0057]

[0058] The LDPC convolutional code with a code length of n is...

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 relates to a LDPC convolutional code construction method, comprising the steps of generating all elements over a finite field GF(q), FORMULA, wherein q is an prime number or a power of the prime number, and alpha is a basic element over the GF(q); forming a m*n base matrix W by using the elements alpha<0> = 1, alpha, ..., alpha<q-2> of the finite field GF(q); and obtaining a time-invariant LDPC convolutional code polynomial matrix H(D) via the base matrix W. Compared with the existing skills, the LDPC convolutional code construction method provided by the invention has the characteristic of rapid coding, can obtain the code with the maximal achievable code memory, and has the lower error floor and good coding performance under the small constraint length.

Description

technical field [0001] The invention belongs to the field of communication coding, in particular to a high-performance time-invariant LDPC convolutional code construction algorithm. Background technique [0002] Convolutional codes are mainly used in real-time communication systems, however, due to the high complexity of the Viterbi decoding algorithm, only convolutional codes with smaller constraint lengths are generally used. In recent years, LDPC (Low Density Parity Check Code) convolutional codes have attracted the attention of researchers. The LDPC code is a type of linear code defined by the check matrix. In order to make decoding feasible, the check matrix needs to satisfy the "sparseness" when the code length is long, that is, the density of 1 in the check matrix is ​​relatively low, which is the requirement. The number of 1s in the parity check matrix is ​​much smaller than the number of 0s, and the longer the code length, the lower the density. [0003] Any (n, k...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H03M13/11H03M13/29
CPCH03M13/116H03M13/2939
Inventor 穆丽伟
Owner SOUTH CHINA NORMAL UNIVERSITY
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