CN105306072B - A kind of LDPC code building method based on basis domain cyclic group generators set - Google Patents
A kind of LDPC code building method based on basis domain cyclic group generators set Download PDFInfo
- Publication number
- CN105306072B CN105306072B CN201410334087.6A CN201410334087A CN105306072B CN 105306072 B CN105306072 B CN 105306072B CN 201410334087 A CN201410334087 A CN 201410334087A CN 105306072 B CN105306072 B CN 105306072B
- Authority
- CN
- China
- Prior art keywords
- matrix
- ldpc code
- basic matrix
- cyclic group
- domain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
The invention discloses a kind of LDPC code building method based on basis domain cyclic group generators set, the method includes the steps: basis domain GF (p) S1, is determined according to the long L of the LDPC code to be constructed；S2, the conjunction of its generators set is calculated according to the cyclic group of the basis domain GF (p)；S3, construction basic matrix is closed based on the generators set；S4, additivity extended operation is carried out to the basic matrix, obtains matrix in block form；S5, the piecemeal submatrix of the matrix in block form is taken to constitute check matrix；The kernel of the check matrix provides the LDPC code to be constructed.There is outstanding error performance using method construct LDPC code of the invention, in hardware realization with low complex degree, low bit error platform, fast convergence decoding performance, the check matrix of construction can be configured to completely new a kind of LDPC code in conjunction with the prior art, such as masking simultaneously.
Description
Technical field
The present invention relates to the channel coding technology fields in communication system, are more particularly to a kind of based on basis domain cyclic group
The LDPC code building method of generators set.
Background technique
LDPC code (Low Density Parity Check Code) was found in 1962 by Gallager, was existed later
1995 are rediscovered and are proved to be a kind of good code that can be close to shannon limit.Then, people are directed to the construction of LDPC code, compile
Code, decoding and hardware adaptations have carried out a large amount of research.According to the difference of make, LDPC code can be divided into random LDPC code
With structure LDPC code.
The construction process of random LDPC code is the process of computer search, by embodying us in the algorithm to desired
The constraint of LDPC code, such as corresponding Tanner figure have biggish ring length, the distribution of desired degree, biggish stopping collection, to search for
Or progressive search meets desired LDPC code.Emulation shows that well designed code length is 107LDPC code, Gao Sixin
Under road, apart from shannon limit 0.0045dB, this has absolutely proved that very outstanding error performance may be implemented in random LDPC code, although
The length of this yard is not suitable for the communication system in reality.Meanwhile the LDPC code of random configuration also inevitably has some lack
Point.Since check matrix is constructed by way of random search, thus do not have apparent configuration aspects the characteristics of, this coding and
In realization of decoding, especially in the realization of middle long code, there is very big complexity, and the LDPC code of random configuration is most
Lack effective constraint in small intersymbol distance, so that often mistake with higher is flat for random LDPC code, it in many
Asking in the system of the extremely low bit error rate cannot apply.
In contrast, the construction of structure LDPC code is a kind of LDPC code based on combinatorial theory construction, which is based on limited
The intersection of point, line, plane, hyperplane in geometry or the geometrical relationships such as parallel or primitive element in finite field plus group multiply
The characteristics such as group construct, and in conjunction with operations such as masking, ranks decomposition, extensions, having obtained one kind has rule check matrix structure
LDPC code.This kind of LDPC code usually has the architectural characteristic of circulation or quasi- circulation etc..This makes such LDPC code in hardware reality
There is lower complexity, circulation or quasi-cyclic structure post encoder in hardware realization by cyclic shift in existing
Storage can be realized, and greatly reduce encoder complexity；Meanwhile quasi-cyclic LDPC code can use standard simultaneously in realization of decoding
Capable decoding framework, this makes decoder have very big selection space between decoding speed and complexity during realization,
It is a series of to being provided between low performance low complex degree in the high complexity of high-performance and decoder for the realization of decoding of LDPC code
Selection.In middle long code length, structure LDPC code is often slightly inferior to random LDPC code, but the LDPC code of structure can guarantee it is biggish
Minimum intersymbol distance, this makes such code have lower error floor.
Summary of the invention
(1) technical problems to be solved
The technical problem to be solved by the present invention is to how guarantee that LDPC code has outstanding error performance, low bit error platform and fast
There is low complex degree in hardware realization while the decoding characteristic of speed convergence etc..
(2) technical solution
In order to solve the above-mentioned technical problems, the present invention provides a kind of LDPC codes based on basis domain cyclic group generators set
Building method the described method comprises the following steps:
S1, it determines code length L, and basis domain GF (p) is determined according to the code length L, wherein p indicates the size in basis domain, is
Prime number；
S2, determine that the generators set of basis domain GF (p) cyclic group is closed；
Each element of the cyclic group of the basis domain GF (p) is judged, if it is constituted from 0 to p-2 power
The all elements of the cyclic group of the basis domain GF (p), then it is first for a generation of basis domain GF (p) cyclic group；
S3, construction basic matrix is closed based on the generators set；
The generators set obtained by the step S2 close in element number be K, 0 the as generators set conjunction is added
0 element forms new generators set and closes；
The either element W of the basic matrixijThe mould p for closing i-th of element and j-th of element for the new generators set multiplies
Product；
S4, additivity extended operation is carried out to the basic matrix, obtains the matrix in block form of additivity extension；
The binary or Generalized Cyclic permutation matrix of p × p are expanded into each element of the basic matrix；
S5, the piecemeal submatrix of the matrix in block form is taken to constitute check matrix；The kernel of the check matrix provides institute
The LDPC code to be constructed.
Preferably, the step S4 specifically:
If construction binary LDPC code, for an element of the basic matrix, it is set as l, 0≤l < p, the p dimension on two element field
Unit row vector is v2(l), the v2It (l) is 1 at position l, remaining p-1 position is 0, constitutes the positioning of the element l
Vector；The location vector of element l, l+1 ..., l+p-1 are formed a line, the binary cycle permutation matrix of the element l is obtained；
Each element of the basic matrix is extended to binary cycle permutation matrix and obtains the binary additivity extension square of the basic matrix
Battle array；
If construction multielement LDPC code, for an element of the basic matrix, it is set as l, 0≤l < p, the p dimension on polynary domain
Unit row vector is vp(l), if l ≠ 0, in vp(l) it is l at position l, is 0 in remaining p-1 position；If l=0, vp(l)
Position 0 at be 1, remaining p-1 position be 0, constitution element l location vector；By element l, l+1 ..., l+p-1's determines
Bit vector forms a line, and obtains the Generalized Cyclic permutation matrix of the element l, each element of the basic matrix is extended to
Generalized Cyclic permutation matrix obtains the polynary additivity extended matrix of the basic matrix.
Preferably, basis domain GF (p) obtained in the step 1, the maximum length of the LDPC code of construction are (K+1) p,
K indicates the number of the generation member of basis domain GF (p) cyclic group, is calculated by Euler's function.
Preferably, the cyclic group of the basis domain GF (p) is { 1,2 ..., p-1 }.
Preferably, in the step S5 check matrix extracting method are as follows:
The piecemeal submatrix of the γ row piecemeal, ρ column piecemeal that take the matrix in block form is as check matrix, the ρ column piecemeal
Parameter ρ selection criteria be so that code given by check matrix code length ρ p the long L of the LDPC code to be constructed requirement model
In enclosing；The selection criteria of the parameter γ of the γ row piecemeal is the wherein r table so that the order of check matrix is close to the value of (1-r) ρ p
Show the code rate for the LDPC code to be constructed.
Preferably, the check matrix carries out masked operation as the basic matrix of masked operation, after carrying out masked operation
The kernel of check matrix provides the LDPC code to be constructed
Preferably, the basic matrix meets:
Additivity row constraint 1: any a line w in the basic matrixi, 0≤i≤K, for 0≤e, f < p, e ≠ f, meet to
Measure (lil0+e,lil1+e,…,lilK+ e) and vector (lil0+f,lil1+f,…,lilK+ f) there are different at p；
Additivity row constraint 2: for any two row in basic matrix, wi=(rir0,rir1,…,rirp-1) and wj=(rjr0,
rjr1,…,rjrp-1), 0≤i, j≤K and i ≠ j, for the vector of 0≤e, f < p, two (rir0+e,rir1+e,…,rirp-1+ e) and
(rjr0+f,rjr1+f,…,rjrp-1+ f) at most exist one at it is identical.
(3) beneficial effect
The present invention provides a kind of LDPC code building method based on basis domain cyclic group generators set, methods of the invention
The basic matrix constructed using the generators set conjunction based on basis domain cyclic group, the check matrix of construction, the zero of the check matrix
Space gives a quasi-cyclic LDPC code, such LDPC code has outstanding error performance, and having in hardware realization is low
Complexity, low bit error platform, fast convergence decoding performance, while the check matrix constructed can such as be covered in conjunction with the prior art
It covers, is configured to completely new a kind of LDPC code.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of flow chart of traditional LDPC code building method based on basis domain cyclic group generators set；
Fig. 2 is a kind of one embodiment of LDPC code building method based on basis domain cyclic group generators set of the invention
(2656,1328) QC-LDPC code for being constructed and (2407,2078) QC-LDPC code under the conditions of awgn channel using and accumulate and translate
Code algorithm obtained error performance schematic diagram under 50 greatest iterations.
Specific embodiment
Present invention is further described in detail with reference to the accompanying drawings and examples.Following embodiment is for illustrating this hair
It is bright, but cannot be used to limit the scope of the invention.
Fig. 1 is a kind of flow chart of traditional LDPC code building method based on basis domain cyclic group generators set；It is described
Method the following steps are included:
S1, code length L being determined according to communication requirement, and basis domain GF (p) being determined according to the code length L, wherein p indicates basis
The size in domain is prime number；The maximum length of the LDPC code of basis domain GF (p) construction is (K+1) p, to be made based on described
Maximum length (K+1) p of the LDPC code of former domain GF (p) construction is greater than code length L, and wherein K indicates the life of basis domain GF (p) cyclic group
The number of Cheng Yuan, is calculated by Euler's function:Wherein, P-1 can be decomposed
For the product of power of prime power,
S2, determine that the generators set of basis domain GF (p) cyclic group is closed；
The cyclic group of the basis domain GF (p) is { 1,2 ..., p-1 }；For any member in basis domain GF (p) cyclic group
Plain a, if the i power a of ai, 0≤i < p-1 gives all elements in basis domain GF (p) cyclic group, then the element is this
Generation member in former domain GF (p) cyclic group；Above-mentioned judgement behaviour is carried out to all elements in basis domain GF (p) cyclic group
Make, forms the set that the cyclic group generates member；
S3, construction basic matrix is closed based on the generators set；
(1) with 1,2 ..., the generation in the conjunction of generators set obtained in K markers step S2 is first, and the 0th generation member is added
It is denoted as 0；
(2) the basic matrix W for constructing (K+1) × (K+1), the row and column of W is marked with i and j, and wherein i and j value is
{0,1,…,K}；
(3) i-th in the updated generators set conjunction that the element of basic matrix the i-th row jth column obtains for step (1)
The mould p product of element and j-th of element, it is not difficult to find out that, the element in basic matrix W belongs to GF (p)；
So far, we construct the basic matrix W of one (K+1) × (K+1), as shown in formula (1),
Based on generation member set, (K+1) × (K+1) for capableing of the constructed LDPC code of unique identification can be constructed
Basic matrix W.
From formula (1), we obtain W have the property that 0 row of 1) matrix W, 0 column in all elements be all
0；2) all elements in any row or column in W in addition to 0 row and 0 column are all different；3) any two row in W or two it is listed in position
Setting at 0 has identical element 0, and the element in K every other position is all different.
Based on above-mentioned property, W meets following constraint:
Additivity row constrains any a line w in 1:Wi, 0≤i≤K meets vector (l for 0≤e, f < p, e ≠ fil0+e,
lil1+e,…,lilK+ e) and vector (lil0+f,lil1+f,…,lilK+ f) there are different at p；
Additivity row constraint 2: for any two row in W, wi=(rir0,rir1,…,rirp-1) and wj=(rjr0,
rjr1,…,rjrp-1), 0≤i, j≤K and i ≠ j, for the vector of 0≤e, f < p, two (rir0+e,rir1+e,…,rirp-1+ e) and
(rjr0+f,rjr1+f,…,rjrp-1+ f) at most exist one at it is identical；
S4, additivity extended operation is carried out to the basic matrix, obtains the matrix in block form of additivity extension；
Each element in W is expanded into the cyclic permutation matrices or Generalized Cyclic permutation matrix of p × p, obtains one
(K+1) × (K+1) matrix in block form H, as shown in formula (2),
Wherein, any submatrix Pi,j, 0≤i, j≤K are basic matrix element liljP times of additivity extended matrix, be p × p
Cyclic permutation matrices, be that binary LDPC code or multielement LDPC code are distinguished according to the code constructed, we carry out as follows respectively
Operation:
If constructing binary LDPC code,
(1) for either element l, 0≤l the < p in basic matrix W, the p on one and only one two element field tie up unit row to
Measure v2(l), in v2(l) it is 1 at position l, is 0 in remaining p-1 position, the unit vector v2It (l) is element l in GF
(2) location vector on, the location vector on the GF (2) of any two difference element in basis domain GF (p) be not identical；
(2) from the definition of location vector it can be seen that the location vector of element l+1 is the circulation right side of the location vector of element l
It moves, to the arbitrary element l in basic matrix W, the location vector of element l, l+1 ..., l+p-1 is formed a line, we obtain one
The cyclic permutation matrices of p × p, this matrix are p times of additivity extended matrix on the two element field of element l；
(3) the additivity extended operation on two element field is carried out to each element in basic matrix, obtains (K+1) × (K+
1) matrix in block form, each submatrix are the cyclic permutation matrices of p × p.
If constructing multielement LDPC code,
(1) on arbitrary element l, 0≤l the < p, one and only one GF (p) in basic matrix W p tie up unit row to
Measure vp(l), if l ≠ 0, in vp(l) it is l at position l, is 0 in remaining p-1 position；If l=0, vp(l) at position 0
It is 1, is 0 in remaining p-1 position, the unit vector vpIt (l) is location vector of the element l on GF (p), basic matrix W
In any two difference element GF (p) on location vector it is not identical；
(2) to the arbitrary element l in basic matrix W, the location vector of element l, l+1 ..., l+p-1 are formed a line, we
The Generalized Cyclic permutation matrix of a p × p is obtained, our this matrix is referred to as the p times of additivity extension square on the polynary domain of element l
Battle array；
(3) the additivity extended operation on GF (p) is carried out to each element in basic matrix, obtains one (K+1) × (K+1)
Matrix in block form, each submatrix be p × p Generalized Cyclic permutation matrix；
S5, it takes the piecemeal submatrix of the matrix in block form to constitute check matrix, takes γ row piecemeal, the ρ of the matrix in block form H
For the piecemeal submatrix of column piecemeal as check matrix H (γ, ρ), the selection criteria of the parameter ρ of the ρ column piecemeal is so that verification
In the claimed range of the long L of the LDPC code to be constructed, i.e. the value of ρ p is equal to or omits the code length ρ p of code given by matrix H (γ, ρ)
L long greater than the LDPC code to be constructed；The selection criteria of the parameter γ of the γ row piecemeal is so that check matrix H (γ, ρ)
Order R is close to the value of (1-r) ρ p, and wherein r indicates the code rate for the LDPC code to be constructed；
Through the above steps, we obtain a column weight be γ, the check matrix that row weight is ρ, which provides
One code length is ρ p, and code rate is the LDPC code of 1-R/ ρ p, and when γ is odd number, the minimum intersymbol distance of this yard is γ+1；Work as γ
When for even number, the minimum intersymbol distance of this yard is γ+2.
The basic matrix that the check matrix that step S5 is obtained is also used as masked operation carries out masked operation, carries out masking behaviour
The kernel of check matrix after work provides the regular LDPC code that new one kind has quasi- cyclic.
Embodiment:
The construction of binary LDPC code on GF (p):
(1) the basis domain of code parameter and code construction is determined
Here, choosing basis domain GF (83) is used as code structural domain.
(2) it according to step S2 in the method for aforementioned present invention, determines the generation member of basis domain cyclic group, obtains GF's (83)
Comprising 40 generation members in cyclic group, wherein generators set is combined into
{2,5,6,8,13,14,15,18,19,20,22,24,32,34,35,39,42,43,45,46,47,50,52,53,
54,55,56,57,58,60,62,66,67,71,72,73,74,76,79,80}
(3) construction basic matrix is closed based on generators set
The building method of the basic matrix of step S3 in method based on aforementioned present invention, we construct one 41 × 41
Element in basic matrix W, W belongs to basis domain GF (83).
(4) additivity extends basic matrix
By additivity extended operation on the two element field of step S4 in the method based on aforementioned present invention, we obtain one 41
× 41 matrix in block form H for meeting ranks constraint, the cyclic permutation matrices that submatrix is 83 × 83.
(5) piecemeal submatrix is extracted as check matrix, provides LDPC code
1) here, we take γ=4, ρ=29, from matrix in block form H take out one 4 × 29 piecemeal submatrix H (4,
29) it is used as parity matrix, which weighs 4, row with constant column and weigh 29, and kernel provides (2407,2078)
Quasi-cyclic LDPC code, the code are regular code, have code length 2407 and code rate 0.8633, error performance is as shown in Figure 2；The verification
4 × 29 submatrixs of basic matrix corresponding to matrix are as follows:
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,64,68,70,78,1,3,7,9,11,17,
21,23,25,27,29,31,33,37,41,37,77,4,9,29,44,49,59,64,69,1,11,16,21,26,31,36,
41,51,61,61,26,38,44,68,3,9,21,27,33,51,63,69,75,81,4,10,16,28,40,
0, 0, 0, 0, 0, 0, 0, 0, 0,
49,51,59,61,63,65,69,75,77,
81,3, 23,28,33,38,48,63,68,
64,70,11,17,23,29,41,59,65
2) we take γ=16, ρ=32, and one 16 × 32 piecemeal submatrix H (16,32) is taken out from matrix in block form H
As the basic matrix of masked operation, the cyclic permutation matrices that submatrix is 83 × 83, if masking matrix Z (16,32) is by two
The cyclic permutation matrices matrix in block form that is in line that primitive vector generates obtains, and two primitive vectors are respectively g0=[1 0100
1 0 0 0 0 0 0 0 0 0 0]、g1=[1 00010000010000 0], the check matrix after masking
It can be expressed asCheck matrix has constant column weight after the masking
3, row weighs 6, and kernel provides (2656, a 1328) quasi-cyclic LDPC code, which is regular code, has code length 2656 and code
Rate 0.5, error performance is as shown in Figure 2.16 × 32 submatrixs of basic matrix corresponding to the check matrix are as follows, wherein -1
Extended matrix be 83 × 83 null matrix:
38,-1,44,-1,-1,68,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,25,-1,-1,-1,-1,17,-1,
37,-1,-1,9,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,26,-1,-1,-1,-1,49,-1,26,-1,-1,68,-
1,-1,-1,-1,-1,-1,-1,-1,-1,-1,4,-1,-1,-1,-1,26,-1,23,-1,-1,4,-1,-1,-1,-1,-1,-
1,-1,-1,-1,-1,41,-1,-1,-1,-1,1,-1,40,-1,-1,61,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-
1,-1,-1,-1,-1,61,-1,48,-1,-1,49,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
27,-1,49,-1,-1,26,-1,-1,-1,-1,63,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,38,-1,27,-1,-
1,16,-1,-1,-1,-1,77,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,51,-1,25,-1,-1,37,-1,-1,-
1,-1,68,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,30,-1,7,-1,-1,44,-1,-1,-1,-1,61,-1,-1,-
1,-1,-1,-1,-1,-1,-1,-1,77,-1,38,-1,-1,4,-1,-1,-1,-1,41,-1,-1,-1,-1,-1,-1,-1,-
1,-1,-1,25,-1,38,-1,-1,-1,-1,-1,-1,-1,59,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,10,-1,
4,-1,68,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,40,-1,59,-1,44,-1,-1,
1,-1,-1,10,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,77,-1,-1,-1,51,-1,-1,33,-1,-1,3,-1,-
1,-1,-1,-1,-1,-1,-1,-1,-1,75,-1,-1,-1,65,
33,-1,-1,-1,-1,-1,61,-1,-1,-1,-1,-1
-1,51,-1,-1,-1,-1,-1,33,-1,-1,-1,-1
-1,-1,40,-1,-1,-1,-1,-1,29,-1,-1,-1
-1,-1,-1,30,-1,-1,-1,-1,-1,27,-1,-1
7, -1,-1,-1,41,-1,-1,-1,-1,-1,31,-1
-1,10,-1,-1,-1,81,-1,-1,-1,-1,-1,41
-1,-1,17,-1,-1,-1, 1,-1,-1,-1,-1,-1
-1,-1,-1,26,-1,-1,-1,69,-1,-1,-1,-1
-1,-1,-1,-1,28,-1,-1,-1,78,-1,-1,-1
-1,-1,-1,-1,-1, 9,-1,-1,-1,26,-1,-1
31,-1,-1,-1,-1,-1, 7,-1,-1,-1,78,-1
-1,29,-1,-1,-1,-1,-1, 9,-1,-1,-1,11
-1,-1,75,-1,-1,-1,-1,-1,44,-1,-1,-1
-1,-1,-1, 3,-1,-1,-1,-1,-1,11,-1,-1
-1,-1,-1,-1,21,-1,-1,-1,-1,-1,26,-1
-1,-1,-1,-1,-1,30,-1,-1,-1,-1,-1,49
Method of the invention closes the basic matrix of construction, the verification square of construction using the generators set based on basis domain cyclic group
Battle array, the kernel of the check matrix give the LDPC code with quasi- cyclic, such LDPC code has outstanding
Error performance, in hardware realization with low complex degree, low bit error platform, fast convergence decoding performance, while construct
Check matrix can be configured to completely new a kind of LDPC code in conjunction with the prior art, such as masking.
The above embodiments are only used to illustrate the present invention, rather than limitation of the present invention.Although referring to embodiment to this hair
It is bright to be described in detail, those skilled in the art should understand that, to technical solution of the present invention carry out it is various combination,
Modification or equivalent replacement should all cover and want in right of the invention without departure from the spirit and scope of technical solution of the present invention
It asks in range.
Claims (5)
1. a kind of LDPC code building method based on basis domain cyclic group generators set, which is characterized in that the method includes with
Lower step:
S1, basis domain GF (p) is determined, wherein p indicates the size in basis domain, is prime number；
Basis domain GF (p) in step 1, the maximum length of the LDPC code of construction are (K+1) p, and K indicates that basis domain GF (p) is followed
The number of the generation member of ring group, is calculated by Euler's function；
S2, determine that the generators set of basis domain GF (p) cyclic group is closed；
Each element of the cyclic group of the basis domain GF (p) is judged, if it is from 0 to described in p-2 power composition
The all elements of the cyclic group of basis domain GF (p), then it is first for a generation of basis domain GF (p) cyclic group；
S3, construction basic matrix is closed based on the generators set；
Element number is K in the generators set conjunction obtained by the step S2, and 0 the 0th closed as the generators set is added
Element forms new generators set and closes；
The either element W of the basic matrixijThe mould p product of i-th of element and j-th of element is closed for the new generators set；
S4, additivity extended operation is carried out to the basic matrix, obtains the matrix in block form of additivity extension；
The binary or Generalized Cyclic permutation matrix of p × p are expanded into each element of the basic matrix；S4 specifically:
If construction binary LDPC code, for an element of the basic matrix, it is set as l, 0≤l < p, the p on two element field ties up unit
Row vector is v2(l), the v2(l) be 1 at position l, be 0 in remaining p-1 position, constitute the positioning of the element l to
Amount；The location vector of element l, l+1 ..., l+p-1 are formed a line, the binary cycle permutation matrix of the element l is obtained；It will
Each element of the basic matrix is extended to binary cycle permutation matrix and obtains the binary additivity extended matrix of the basic matrix；
If construction multielement LDPC code, for an element of the basic matrix, be set as l, 0≤l < p, the p on polynary domain tie up unit row to
Amount is vp(l), if l ≠ 0, in vp(l) it is l at position l, is 0 in remaining p-1 position；If l=0, vp(l) position 0
Place is 1, is 0 in remaining p-1 position, constitution element l location vector；By the location vector of element l, l+1 ..., l+p-1
It forms a line, obtains the Generalized Cyclic permutation matrix of the element l, each element of the basic matrix is extended to broad sense and is followed
Ring permutation matrix obtains the polynary additivity extended matrix of the basic matrix；
S5, the piecemeal submatrix of the matrix in block form is taken to constitute check matrix；The kernel of the check matrix provides wanted structure
The LDPC code made.
2. the method according to claim 1, wherein the cyclic group of the basis domain GF (p) is { 1,2 ..., p-1 }.
3. the method according to claim 1, wherein in the step S5 check matrix extracting method are as follows:
The piecemeal submatrix of the γ row piecemeal, ρ column piecemeal that take the matrix in block form is as check matrix, the ginseng of the ρ column piecemeal
The selection criteria of number ρ is so that the code length ρ p of code given by check matrix is in the claimed range of the long L of the LDPC code to be constructed；
The selection criteria of the parameter γ of the γ row piecemeal is so that the order of check matrix is close to the value of (1-r) ρ p, and wherein r expression is wanted
The code rate of the LDPC code of construction.
4. the method according to claim 1, wherein the check matrix is carried out as the basic matrix of masked operation
The kernel of masked operation, the check matrix after carrying out masked operation provides the LDPC code to be constructed.
5. the method according to claim 1, wherein the basic matrix meets:
Additivity row constraint 1: any a line w in the basic matrixi, 0≤i≤K, for 0≤e, f < p, e ≠ f meet vector
(lil0+ e, lil1+ e ..., lilK+ e) and vector (lil0+ f, lil1+ f ..., lilK+ f) there are different at p；
Additivity row constraint 2: for any two row in basic matrix, wi=(rir0, rir1..., rirp-1) and wj=(rjr0,
rjr1..., rjrp-1), 0≤i, j≤K and i ≠ j, for 0≤e, f < p, two vector (rir0+ e, rir1+ e ..., rirp-1+e)
(rjr0+ f, rjr1+ f ..., rjrp-1+ f) at most exist one at it is identical.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410334087.6A CN105306072B (en) | 2014-07-14 | 2014-07-14 | A kind of LDPC code building method based on basis domain cyclic group generators set |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410334087.6A CN105306072B (en) | 2014-07-14 | 2014-07-14 | A kind of LDPC code building method based on basis domain cyclic group generators set |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105306072A CN105306072A (en) | 2016-02-03 |
| CN105306072B true CN105306072B (en) | 2019-05-14 |
Family
ID=55202910
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410334087.6A Expired - Fee Related CN105306072B (en) | 2014-07-14 | 2014-07-14 | A kind of LDPC code building method based on basis domain cyclic group generators set |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105306072B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105915232B (en) * | 2016-04-08 | 2019-03-26 | 西安电子科技大学 | A kind of polynary rate-compatible LDPC code building method of structuring |
| CN107707261B (en) * | 2017-09-20 | 2020-11-03 | 山东大学 | Method for constructing LDPC code check matrix based on original pattern |
| CN109547160B (en) * | 2018-11-15 | 2020-05-08 | 北京科技大学 | Cyclic shift network coding construction method |
| CN110611510B (en) * | 2019-09-17 | 2021-03-23 | 天地信息网络研究院(安徽)有限公司 | Binary LDPC short code construction method and construction device, terminal and storage medium thereof |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103825622A (en) * | 2014-02-25 | 2014-05-28 | 盐城师范学院 | Low complexity quasi-cyclic LDPC code designing method based on mask operation |
-
2014
- 2014-07-14 CN CN201410334087.6A patent/CN105306072B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103825622A (en) * | 2014-02-25 | 2014-05-28 | 盐城师范学院 | Low complexity quasi-cyclic LDPC code designing method based on mask operation |
Non-Patent Citations (2)
| Title |
|---|
| A Unified Approach to the Construction of Binary and Nonbinary Quasi-Cyclic LDPC Codes Based on Finite Fields;Shumei Song 等;《IEEE TRANSACTIONS ON COMMUNICATIONS》;20090131;第57卷(第1期);第84-93页 |
| Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels A Finite Field Approach;Lan Lan 等;《IEEE TRANSACTIONS ON INFORMATION THEORY》;20070731;第53卷(第7期);第2429-2458页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105306072A (en) | 2016-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104168030B (en) | A kind of LDPC code building method based on two generation members of basis domain cyclic group | |
| CN105306072B (en) | A kind of LDPC code building method based on basis domain cyclic group generators set | |
| Zhang et al. | Deterministic construction of compressed sensing matrices from protograph LDPC codes | |
| CN105207680B (en) | A kind of building method of the quasi-cyclic LDPC code based on finite field primitive element | |
| CN101159435B (en) | Low density check code check matrix constructing method based on shift matrix classified extension | |
| Damour et al. | Higher-order M-theory corrections and the kac–Moody algebra E10 | |
| CN104182209B (en) | A kind of GCRO DR algorithm method for parallel processing based on PETSc | |
| Rivasseau et al. | How to resum Feynman graphs | |
| CN101207386B (en) | Constitution method of binary low density parity check code | |
| CN109190169A (en) | A kind of golden numerical method of Three-dimensional Time Domain electromagnetism hybridization time-discontinuous gal the Liao Dynasty | |
| CN102289425A (en) | Hash algorithm based on extensible precision chaos | |
| Zhang | Type‐II quasi‐cyclic low‐density parity‐check codes from Sidon sequences | |
| CN103944587B (en) | A kind of m-ary LDPC code check matrix building method of ordered arrangement nonzero element | |
| CN103368585B (en) | A kind of building method of LDPC check matrix | |
| Runyan | A novel higher order finite difference time domain method based on the castillo-grone mimetic curl operator with applications concerning the time-dependent maxwell equations | |
| CN106603086B (en) | A kind of building method of the stud stable structure subcode based on cluster state | |
| CN105227190B (en) | A kind of building method multiplying the LDPC code of cyclic subgroup in group based on finite field | |
| Wang et al. | Coded alternating least squares for straggler mitigation in distributed recommendations | |
| CN104202059B (en) | Deterministic design method for structuring QC-LDPC (quasi-cyclic low-density parity check) codes 12 in girth | |
| CN105207681A (en) | LDPC code construction method based on generating elements of cyclic subgroups in finite field multiplicative group | |
| CN107437947A (en) | The coding method of LDPC code | |
| Thomas et al. | Optimizing glassy p-spin models | |
| Ma et al. | LDPC codes based on the space of symmetric matrices over finite fields | |
| CN103929188A (en) | Coding method, device and system | |
| CN107453760A (en) | The coding method of LDPC code |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190514 Termination date: 20200714 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |