Method for constructing quasi-cyclic LDPC code based on finite field primitive elements

A technology of LDPC code and construction method, which is applied in the field of channel coding, can solve problems such as high complexity, too long, and lack of parity check matrix, and achieve the effect of low bit error platform and reduced implementation complexity

Active Publication Date: 2015-12-30
BEIJING UNIV OF POSTS & TELECOMM
View PDF4 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the code length of this code is too long to be used in the display system, it is enough to prove the excellent bit error performance of random LDPC
At the same time, due to the randomness of random or pseudo-random LDPC code construction, the parity check matrix ha

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 quasi-cyclic LDPC code based on finite field primitive elements
  • Method for constructing quasi-cyclic LDPC code based on finite field primitive elements
  • Method for constructing quasi-cyclic LDPC code based on finite field primitive elements

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment

[0063] figure 1 As shown, adopt a kind of construction method of the present invention based on the quasi-cyclic LDPC code of finite field primitive element to construct the check matrix based on the quasi-cyclic LDPC code of finite field primitive element and carry out as follows:

[0064] Step 1: Determine the code parameters, mainly refer to code length and code rate, and determine parameters such as the size q of the GF(q) domain and the row block and column block of the block check matrix according to the code parameters.

[0065] Step 2: Determine the two primitive elements in the finite field, GF(q) is the finite field determined in step 1, the value of q is a prime number or its power, let α be the primitive element of GF(q), Then the elements in GF(q) can be expressed in the form of the power of α, the set {α ∞ = 0, α 0 =1,α,…,α q-2}Constitute q elements of GF(q). if α i The exponent i and (q-1) in are relatively prime, then α i It is also the primitive element ...

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 the field of channel coding technologies in communication technologies, and specifically relates to a method for constructing a quasi-cyclic LDPC code based on finite field primitive elements. The method basically comprises five steps as follows: determining the parameters of the code, selecting two primitive elements in a finite field, constructing a basis matrix based on the primitive elements, extending the basis matrix, and selecting a sub matrix of a partitioned matrix as a check matrix, wherein the construction of a two-element field and the construction of a multi-element field share the basis matrix generated in the third step, and the difference lies in whether the matrix elements after extension operation in the fourth step belongs to the two-element field or the multi-element field. As the constructed code is a quasi-cyclic code, the generated matrix has a form of systemic cycle, and linear coding can be achieved.

Description

technical field [0001] The invention relates to the technical field of channel coding in communication technology, in particular to a method for constructing quasi-cyclic LDPC codes based on finite field primitives. Background technique [0002] The LDPC code is a good code close to the Shannon limit. It was discovered by Gallager in 1962, and it was rediscovered in 1995 and returned to people's sight. Subsequently, the design, construction, decoding, high-efficiency coding, performance analysis and application of this code in digital communication and storage systems have become research hotspots. According to different construction methods, LDPC codes can be divided into two categories, random or pseudo-random LDPC codes and structured LDPC codes. Among them, random or pseudo-random LDPC codes are found by computer, and the search algorithm should refer to specific design criteria and some Tanner graph structural characteristics, including girth, degree distribution and s...

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 BEIJING UNIV OF POSTS & TELECOMM
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