CN107863971B - Construction method and system of LDPC code check matrix for PTN - Google Patents
Construction method and system of LDPC code check matrix for PTN Download PDFInfo
- Publication number
- CN107863971B CN107863971B CN201710958560.1A CN201710958560A CN107863971B CN 107863971 B CN107863971 B CN 107863971B CN 201710958560 A CN201710958560 A CN 201710958560A CN 107863971 B CN107863971 B CN 107863971B
- Authority
- CN
- China
- Prior art keywords
- matrix
- basic matrix
- elements
- finite field
- permutation
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
Landscapes
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention relates to a construction method and a system of an LDPC code check matrix aiming at PTN, wherein the method comprises the following steps: determining a finite field parameter according to an LDPC code to be constructed; constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix; according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element; and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix. The method can generate regular quasi-cyclic LDPC codes more quickly, obtain higher coding gain and reduce implementation complexity, and has better error correction performance than the reference LDPC (1723, 2048) codes given in IEEE 802.3.
Description
Technical Field
The invention belongs to the technical field of modern channel coding, and particularly relates to a construction method and a system of an LDPC code check matrix for PTN.
Background
The Packet Transport Network (PTN) technology adopts a routing architecture based on packets, can provide multi-service technical support, is a technology more suitable for IP service transmission, inherits the traditional advantages of optical transmission, and has high reliability and safety. The china industry and the informatization department are developing Packet Transport Network (PTN) engineering design standards. In the PTN standard, the transmission system may use an Optical Transmission Network (OTN), or may use a physical layer technology of IEEE 802.3, which is the standard of 10Gbps Ethernet (10Gb E), and the User Network Interface (UNI) supports an Ethernet network interface and an OTN interface.
The low density check (LDPC) code is a modern channel coding technology, the code length and the code rate can be flexibly designed, the LDPC code has excellent error correction performance, and simultaneously, the LDPC code has lower complexity and can be decoded in full parallel. LDPC is a linear block code with a sparse check matrix proposed by Robert g.gallager in 1963 for the first time, has good performance approaching Shannon limit, has low decoding complexity and flexible structure, is a research hotspot in the field of channel coding in recent years, and is currently widely applied to the fields of deep space communication, optical fiber communication, satellite digital video, audio broadcasting and the like. As a forward error correction coding (FEC) technique, LDPC codes are used in various high-speed communication standards, such as DVB-S2, WIMAX, WiFi, CCSDS, and other communication systems. In the ISO/IEC/IEEE 802.3 Standard for Ethernet Standard promulgated in 2014, the forward error correction code of the physical layer adopts a binary LDPC code.
The specification in section 5.1 interface design in "PTN design provisional specification" includes: the structure and physical specification of the Ethernet interface should conform to YD/T1948.2-2009 transport network Ethernet (EoT) technical requirements part 2: interface types and specifications of Ethernet User Network Interface (UNI) and Network Node Interface (NNI) specifications; the OTN interface and index should conform to the interface type and specification of YD/T1462-2006 Optical Transport Network (OTN) interface specification. The physical specifications of ethernet in the two standards use the related specifications in IEEE 802.3, and LDPC (1723, 2048) is used as a coding scheme in a physical coding layer (PCS) of 10GE in 802.3.
However, the reference LDPC codes (1723, 2048) specified in the IEEE 802.3 related specifications are currently used as encoding schemes, and the error correction performance thereof needs to be improved. In the construction of an LDPC code check matrix for PTN, how to obtain a higher coding gain and reduce implementation complexity, and improve the error correction performance of an LDPC code at the same time is an urgent problem to be solved.
In order to solve the problem of the storage complexity of the check matrix of the LDPC code, chinese patent document CN102386933B discloses a method for constructing a quasi-cyclic LDPC code check matrix, which determines each position offset value of a basis matrix according to a hanonauta number sequence, and determines the basis matrix according to the offset value, thereby improving the performance of the quasi-cyclic LDPC code and reducing the storage complexity. Chinese patent document CN 105207680 a discloses a method for constructing a quasi-cyclic LDPC code based on finite field primitive: determining the parameters of the code, selecting two primitive elements in a finite field, constructing a basic matrix based on the primitive elements, expanding the basic matrix and selecting a sub-matrix of a block matrix as a check matrix, thereby reducing the hardware implementation complexity of the code; wherein, the multiplication group of the finite field is based on when constructing the base matrix. In an LDPC code construction method based on cyclic subgroup generators in finite field multiplication groups disclosed in chinese patent document CN105207681A, a multiplication group based on finite field is also used when constructing a base matrix. However, the storage complexity of the DPC code constructing method using the finite field multiplier group-based constructed basis matrix still needs to be further reduced, and the error correction performance of the LDPC code is improved and a higher coding gain is obtained while the implementation complexity is reduced. However, none of the prior art methods of constructing LDPC codes specifically address the characteristics of PTNs.
In summary, an effective solution is still lacking for the problems that the storage complexity in the construction method of the LDPC code check matrix for PTN in the prior art needs to be further reduced, the implementation complexity is reduced, the error correction performance of the LDPC code is further improved, and a higher coding gain is obtained.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a construction method and a system of an LDPC code check matrix aiming at PTN, in particular to a finite field QC-LDPC-based construction method, which constructs a basic matrix based on the addition group of the finite field, ensures that the basic matrix for constructing the QC-LDPC code meets RC-constraint conditions by utilizing inversion operation in the finite field, can rapidly generate a regular quasi-cyclic LDPC code by using the method, and has the error correction performance superior to the reference LDPC (1723, 2048) code given in IEEE 802.3.
The first purpose of the invention is to provide a construction method of an LDPC code check matrix aiming at PTN.
In order to achieve the purpose, the invention adopts the following technical scheme:
a construction method of an LDPC code check matrix for PTN, the method comprises:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
In the invention, when a basic matrix is constructed, firstly, a generalized basic matrix is constructed by circularly adding primitive elements of a finite field and inverse elements of the primitive elements, and a basic construction is completed by circularly adding the elements of the finite field.
As a further preferred solution, in the method, the constructed generalized fundamental matrix simultaneously satisfies:
there is one and only one "0" element in each row of elements; the elements of each row are different elements in a finite field; elements with the same column position in any row are different elements;
and
there is one and only one "0" element in each column of elements; the elements of each column are different elements in a finite field; elements in any column that are in the same row position are different elements.
As a further preferred scheme, in the method, the number of rows and the number of columns of the basic matrix are selected according to the code length and code rate of the LDPC code to be constructed.
As a further preferable aspect, in the method, the fundamental matrix constructed on the basis of the generalized fundamental matrix satisfies:
the number of columns of the basic matrix is the number of nonzero elements in each row of the basic matrix;
there is no "0" element in the elements of each row;
and
there is no "0" element in the elements of each column;
and adjusting the row number and the column number of the basic matrix according to the conditions.
As a further preferable aspect, in the method, the fundamental matrix constructed on the basis of the generalized fundamental matrix satisfies:
the row number of the basic matrix is more than or equal to 2;
and adjusting the row number and the column number of the basic matrix according to the conditions.
In the invention, the number of rows of the constructed basic matrix is ensured to be more than or equal to 2 as much as possible, and excellent error correction performance can be obtained.
As a further preferred scheme, in the method, according to the basic matrix, vector representation bit permutation of any non-zero element is performed on the elements, and the specific step of obtaining the corresponding permutation matrix is as follows:
any non-zero element in the finite field is represented by a vector;
and (4) carrying out vector representation position permutation on any non-zero element in each element in the basic matrix to obtain a permutation matrix corresponding to the element.
As a further preferred solution, in the method, any non-zero element in the finite field is represented by a vector, wherein the vector representing any non-zero element in the finite field satisfies:
the vector elements have an ordinal number of 1, which is the power of any nonzero element;
and
the other elements are all 0.
As a further preferred scheme, in the method, in combination with the permutation matrix, the LDPC code check matrix obtained by extending the basic matrix satisfies:
the row number is the product of the row number of the basic matrix and the row number of the permutation matrix;
and
the number of columns is the product of the number of columns of the basic matrix and the number of columns of the permutation matrix.
It is a second object of the present invention to provide a computer-readable storage medium.
In order to achieve the purpose, the invention adopts the following technical scheme:
a computer readable storage medium having stored therein a plurality of instructions adapted to be loaded by a processor of a terminal device and to perform the process of:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
A third object of the present invention is to provide a terminal device.
In order to achieve the purpose, the invention adopts the following technical scheme:
a terminal device comprising a processor and a computer readable storage medium, the processor being configured to implement instructions; a computer readable storage medium for storing a plurality of instructions adapted to be loaded by a processor and to perform the process of:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
The invention has the beneficial effects that:
1. the invention relates to a construction method and a system of an LDPC code check matrix aiming at PTN, which construct a basic matrix based on the addition group of a finite field, ensure that the basic matrix constructing the QC-LDPC code meets RC-constraint conditions by utilizing inversion operation in the finite field, can quickly generate a regular quasi-cyclic LDPC code by using the method, and has the error correction performance superior to the error correction performance of a reference LDPC (1723, 2048) code given in IEEE 802.3 in the existing PTN design specification.
2. According to the construction method and the system of the LDPC code check matrix aiming at the PTN, when a basic matrix is constructed, firstly, the primitive elements of a finite field and the inverse elements of the primitive elements are circularly added to construct a generalized basic matrix, the basic construction is completed in a finite field element circulating addition mode, inversion operation in the finite field is utilized in the method, the condition of RC constraint can be effectively ensured to be achieved, namely four rings are avoided, and essentially, the basic matrix is constructed based on finite field group addition, compared with a common finite field multiplier group-based method in the existing method, the realization complexity of the LDPC code of the PTN is further reduced, meanwhile, the condition of RC constraint can be achieved by skillfully ensuring that the inversion operation in the finite field is utilized, and the realization complexity is further reduced; the method is simple to implement, and the regular quasi-cyclic LDPC code can be generated more quickly by using the method.
3. The invention discloses a construction method and a system of an LDPC code check matrix aiming at PTN, wherein a basic matrix constructed on the basis of a generalized basic matrix meets the following requirements: the row number of the basic matrix is more than or equal to 2; and adjusting the row number and the column number of the basic matrix according to the conditions to ensure that excellent error correction performance is obtained.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application.
FIG. 1 is a flow chart of the method of the present invention.
The specific implementation mode is as follows:
the invention will be further illustrated with reference to the following examples and drawings:
it should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
Example 1:
the purpose of this embodiment 1 is to provide a method for constructing an LDPC code check matrix for PTN. The method can quickly generate regular quasi-cyclic LDPC codes and has the error correction performance superior to the reference LDPC (1723, 2048) codes given in IEEE 802.3.
A method for constructing an LDPC code check matrix for PTN, as shown in fig. 1,
the method comprises the following steps:
step (1): determining a finite field parameter according to an LDPC code to be constructed;
in the finite field gf (q) selected in step (1), in this embodiment, an LDPC code having an approximate code length of 2048 and an information bit length 1723 needs to be constructed, that is, an approximate code of LDPC (1723, 2048) used in a physical coding layer (PCS) of 10GE in 802.3 is constructed. In this embodiment, q is 64, and the primitive polynomial is p (X) 1+ X6Generating the corresponding Galois field GF (2)6)。
Step (2): constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
in the invention, when a basic matrix is constructed, firstly, a generalized basic matrix is constructed by circularly adding primitive elements of a finite field and inverse elements of the primitive elements, and a basic construction is completed by circularly adding the elements of the finite field.
Specifically, the construction fundamental matrix B constructed in the step (2)m×nComprises the following steps:
step (2-1): construction of generalized fundamental matrix B(q-1)×(q-1)：
For 0 ≦ i, j<q-1, using primitive α and primitive inverse α-1Constructing a generalized basic matrix B with (q-1) × (q-1) dimensions in a finite field GF (q)(q-1)×(q-1)：
α thereini∈GF(q)，0≤i<q-1，B(q-1)×(q-1)Has the following characteristics:
a) each row (column) has one and only one "0" element;
b) the elements in each row (column) are different elements in the finite field gf (q);
c) elements in the same position in different rows (columns) are different.
Constructing a basic matrix B in step (2-2)m×nIt should be noted that in the finite field GF (q), α is its primitive element, i is greater than or equal to 0 ≦ i<q-1，αi∈ GF (q), set { α }0,α1,…,αq-2Q-1 non-zero elements in (q) form a multiplicative group of the finite field GF (q);
for any non-zero element α in finite fieldiCan use vectors
Where the vector M (α) isi) I (ip) th element
Wherein ip is more than or equal to 0<q-1, ip is the vector M (α)i) The ordinal number of (1) and other elements are all 0, and are called M (α)i) Is element αiThe M position vector of (a);
the basic matrix for constructing the QC-LDPC code should satisfy RC-constraint conditions:
1) for 0 ≦ i<m and 0. ltoreq. k, l<q-1，αkbiAnd αlbiWherein the elements are all from gf (q), but at most only one position of the elements is the same, i.e. at least n-1 positions of the two vertically extending rows are different;
2) for 0 ≦ i, j<m, i is not equal to j and 0 is not more than k, l<q-1，αkbiAnd αlbjAt least n-1 positions of the corresponding elements are different, namely at least n-1 positions of the corresponding elements of each row of the basic matrix after vertical expansion of any two rows of the basic matrix are different.
Step (2-2): constructing a fundamental matrix Bm×n：
The generalized fundamental matrix B of (q-1) × (q-1) dimension constructed from the above step (2-1)(q-1)×(q-1)M × n elements are selected to form a basic matrix Bm×n；
Wherein n represents the number of non-zero elements in each row of the basic matrix, Bm×nTo construct regular QC-LDPC code, the basic matrix B needs to be guaranteedm×nEach row and each column in the system do not contain '0' element, and m is more than or equal to 2 to the greatest extent in order to obtain better error correction performance;
as a further preferable scheme, in the method, the number of rows and columns of the basic matrix is selected according to the code length code rate of the LDPC code to be constructed, in this embodiment, m is 4, and n is 32;
the basic matrix constructed on the basis of the generalized basic matrix satisfies the following conditions:
the number of columns of the basic matrix is the number of nonzero elements in each row of the basic matrix;
there is no "0" element in the elements of each row;
and
there is no "0" element in the elements of each column;
to avoid Bi,j0 element of (3), elements in the areas from the second row to the fifth row and from the second column to the 33 rd column are selected to constitute a basic matrix B with dimension 4 × 32m,n；
In the method, the fundamental matrix constructed on the basis of the generalized fundamental matrix further needs to satisfy the following conditions: the row number of the basic matrix is more than or equal to 2; and adjusting the row number and the column number of the basic matrix according to the conditions. In the present embodiment, m is 4> 2. Ensuring to obtain better error correction performance.
And (3): according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
from the basic matrix Bm×nMiddle element br,c(0≤r<m,0≤c<n) obtaining a corresponding permutation matrix P (b)r,c)(q-1)×(q-1)Wherein r and c represent the basic matrix Bm×nRow-column ordinal number of middle element;
from the foregoing, it can be seen that for any non-zero element α in the finite fieldiCan use vectors
Where the vector M (α) isi) I (ip) th element
Wherein ip is more than or equal to 0<q-1, ip is the vector M (α)i) The ordinal number of (1), other elements are all 0; then to the basic matrix Bm×nMiddle element br,c(0≤r<m,0≤c<n) carrying out M-position permutation to obtain a permutation matrix P (b) of (q-1) × (q-1)r,c)(q-1)×(q-1)，
In the present embodiment, a cyclic permutation matrix P (b) having a dimension of 63 × 63 is obtained according to equation (3)r,c)63×63。
And (4): and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
It should be noted that, in this method, the LDPC code check matrix satisfies: the row number is the product of the row number of the basic matrix and the row number of the permutation matrix; and the number of columns is the product of the number of base matrix columns and the number of permutation matrix columns.
Determining a check matrix H with dimension m (q-1) × n (q-1) according to the basic matrix and the permutation matrixm(q-1)×n(q-1)Such as formula (4)
In the present embodiment, the check matrix H having the dimension of 252 × 2016 is obtained according to (4)252×2016。
And (5): obtaining a generating matrix:
according to the formula G.HTObtaining a generator matrix for encoding;
and (6): applied to the standard IEEE 802.3:
for this purpose, the LDPC (1723, 2048) code in the standard is obtained by first zero-padding the tail of 1723 bits of information bits to 1764 bits, coding the information bits by a generator matrix (generated by a check matrix) to obtain an LDPC (1764, 2016) code with a code length of 2016, and padding the information bits to 2048 bits to obtain a desired codeword.
Example 2:
the object of this embodiment 2 is to provide a computer-readable storage medium.
In order to achieve the purpose, the invention adopts the following technical scheme:
a computer readable storage medium having stored therein a plurality of instructions adapted to be loaded by a processor of a terminal device and to perform the process of:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
In the present embodiment, examples of the computer-readable recording medium include magnetic storage media (e.g., ROM, RAM, USB, floppy disks, hard disks, etc.), optical recording media (e.g., CD ROMs or DVDs), PC interfaces (e.g., PCI express, WiFi, etc.), and the like. However, the various aspects of the present disclosure are not limited thereto.
Example 3:
the purpose of this embodiment 3 is to provide a terminal device. The LDPC code check device is composed of terminal equipment composed of a processor for loading and executing the program codes.
In order to achieve the purpose, the invention adopts the following technical scheme:
a terminal device comprising a processor and a computer readable storage medium, the processor being configured to implement instructions; a computer readable storage medium for storing a plurality of instructions adapted to be loaded by a processor and to perform the process of:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
Those skilled in the art will appreciate that the present invention is not limited to any specific combination of hardware and software.
The steps of the present invention in embodiment 1 may be implemented by a general-purpose computer device, or alternatively, they may be implemented by program code executable by a computing device, so that they are stored in a storage device and executed by the computing device, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated into a single integrated circuit module.
Alternatively, each step of the present invention in embodiment 1 may implement the operation of each matrix in the form of a hardware circuit. The received real number sequence is demodulated by a demodulator firstly in a hardware circuit mode, then hard decision is carried out to obtain a hard decision 0,1 sequence, and finally the obtained hard decision sequence is transmitted to a hard decision decoder for decoding.
Alternatively, the steps of the present invention in embodiment 1 may also adopt a hybrid manner of combining a software implementation of program codes executable by a computing device and a hardware implementation of hardware circuits.
The invention has the beneficial effects that:
1. the invention relates to a construction method and a system of an LDPC code check matrix aiming at PTN, which construct a basic matrix based on the addition group of a finite field, ensure that the basic matrix constructing the QC-LDPC code meets RC-constraint conditions by utilizing inversion operation in the finite field, can quickly generate a regular quasi-cyclic LDPC code by using the method, and has the error correction performance superior to the error correction performance of a reference LDPC (1723, 2048) code given in IEEE 802.3 in the existing PTN design specification.
2. According to the construction method and the system of the LDPC code check matrix aiming at the PTN, when a basic matrix is constructed, firstly, the primitive elements of a finite field and the inverse elements of the primitive elements are circularly added to construct a generalized basic matrix, the basic construction is completed in a finite field element circulating addition mode, inversion operation in the finite field is utilized in the method, the condition of RC constraint can be effectively ensured to be achieved, namely four rings are avoided, and essentially, the basic matrix is constructed based on finite field group addition, compared with a common finite field multiplier group-based method in the existing method, the realization complexity of the LDPC code of the PTN is further reduced, meanwhile, the condition of RC constraint can be achieved by skillfully ensuring that the inversion operation in the finite field is utilized, and the realization complexity is further reduced; the method is simple to implement, and the regular quasi-cyclic LDPC code can be generated more quickly by using the method.
3. The invention discloses a construction method and a system of an LDPC code check matrix aiming at PTN, wherein a basic matrix constructed on the basis of a generalized basic matrix meets the following requirements: the row number of the basic matrix is more than or equal to 2; and adjusting the row number and the column number of the basic matrix according to the conditions to ensure that excellent error correction performance is obtained.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (8)
1. A construction method of an LDPC check matrix aiming at PTN is characterized by comprising the following steps:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
the basic matrix constructed on the basis of the generalized basic matrix satisfies the following conditions:
the number of columns of the basic matrix is the number of nonzero elements in each row of the basic matrix;
there is no "0" element in the elements of each row;
and
there is no "0" element in the elements of each column;
the row number of the basic matrix is more than or equal to 2;
adjusting the row number and the column number of the basic matrix according to the conditions;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
2. The method of constructing an LDPC code check matrix for PTN as claimed in claim 1, wherein in the method, the constructed generalized fundamental matrix simultaneously satisfies:
there is one and only one "0" element in each row of elements; the elements of each row are different elements in a finite field; elements with the same column position in any row are different elements;
and
there is one and only one "0" element in each column of elements; the elements of each column are different elements in a finite field; elements in any column that are in the same row position are different elements.
3. The method of claim 1, wherein the number of rows and columns of the basic matrix is selected according to a code length and a code rate of the LDPC code to be constructed.
4. The method for constructing the LDPC code check matrix for PTN according to claim 1, wherein in the method, the vector representation bit permutation of any non-zero element is performed on the elements according to the basic matrix, and the specific step of obtaining the corresponding permutation matrix is as follows:
any non-zero element in the finite field is represented by a vector;
and (4) carrying out vector representation position permutation on any non-zero element in each element in the basic matrix to obtain a permutation matrix corresponding to the element.
5. A method of constructing an LDPC code check matrix for PTN according to claim 1, wherein in the method any non-zero element in the finite field is represented by a vector, wherein the vector representing any non-zero element in the finite field satisfies:
the vector elements have an ordinal number of 1, which is the power of any nonzero element;
and
the other elements are all 0.
6. The method for constructing the LDPC check matrix for PTN as claimed in claim 1, wherein the LDPC check matrix obtained by extending the basic matrix in combination with the permutation matrix satisfies:
the row number is the product of the row number of the basic matrix and the row number of the permutation matrix;
and
the number of columns is the product of the number of columns of the basic matrix and the number of columns of the permutation matrix.
7. A computer readable storage medium having stored therein a plurality of instructions, wherein the instructions are adapted to be loaded by a processor of a terminal device and to perform the following:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
the basic matrix constructed on the basis of the generalized basic matrix satisfies the following conditions:
the number of columns of the basic matrix is the number of nonzero elements in each row of the basic matrix;
there is no "0" element in the elements of each row;
and
there is no "0" element in the elements of each column;
the row number of the basic matrix is more than or equal to 2;
adjusting the row number and the column number of the basic matrix according to the conditions;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
8. A terminal device comprising a processor and a computer readable storage medium, the processor being configured to implement instructions; a computer readable storage medium for storing a plurality of instructions adapted to be loaded by a processor and to perform the following:
determining a finite field parameter according to an LDPC code to be constructed;
constructing a generalized basic matrix by circularly adding the primitive elements of the finite field and the inverse elements of the primitive elements according to the determined finite field parameters, and constructing a basic matrix meeting RC-constraint conditions on the basis of the generalized basic matrix;
the basic matrix constructed on the basis of the generalized basic matrix satisfies the following conditions:
the number of columns of the basic matrix is the number of nonzero elements in each row of the basic matrix;
there is no "0" element in the elements of each row;
and
there is no "0" element in the elements of each column;
the row number of the basic matrix is more than or equal to 2;
adjusting the row number and the column number of the basic matrix according to the conditions;
according to the basic matrix, carrying out vector representation bit permutation of any nonzero element on the element to obtain a permutation matrix corresponding to the element;
and combining the permutation matrix, and expanding the basic matrix to obtain the LDPC code check matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710958560.1A CN107863971B (en) | 2017-10-16 | 2017-10-16 | Construction method and system of LDPC code check matrix for PTN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710958560.1A CN107863971B (en) | 2017-10-16 | 2017-10-16 | Construction method and system of LDPC code check matrix for PTN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107863971A CN107863971A (en) | 2018-03-30 |
| CN107863971B true CN107863971B (en) | 2020-09-18 |
Family
ID=61698462
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710958560.1A Active CN107863971B (en) | 2017-10-16 | 2017-10-16 | Construction method and system of LDPC code check matrix for PTN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107863971B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800618A (en) * | 2009-09-24 | 2010-08-11 | 北京理工大学 | LDPC code constructing method based on coding cooperative communication |
| CN103199877A (en) * | 2013-04-19 | 2013-07-10 | 中山大学 | Method for constructing and coding structured LDPC (Low Density Parity Check) convolutional codes |
| CN103825622A (en) * | 2014-02-25 | 2014-05-28 | 盐城师范学院 | Low complexity quasi-cyclic LDPC code designing method based on mask operation |
| CN107026709A (en) * | 2016-02-01 | 2017-08-08 | 中兴通讯股份有限公司 | A kind of data packet coding processing method and processing device, base station and user equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20070107521A (en) * | 2006-05-03 | 2007-11-07 | 삼성전자주식회사 | Method for generating of non binary structured low density parity check code |
| JPWO2015133095A1 (en) * | 2014-03-04 | 2017-04-06 | 日本電気株式会社 | Parity check code generation apparatus, encoding method, encoding apparatus, and control program |
-
2017
- 2017-10-16 CN CN201710958560.1A patent/CN107863971B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800618A (en) * | 2009-09-24 | 2010-08-11 | 北京理工大学 | LDPC code constructing method based on coding cooperative communication |
| CN103199877A (en) * | 2013-04-19 | 2013-07-10 | 中山大学 | Method for constructing and coding structured LDPC (Low Density Parity Check) convolutional codes |
| CN103825622A (en) * | 2014-02-25 | 2014-05-28 | 盐城师范学院 | Low complexity quasi-cyclic LDPC code designing method based on mask operation |
| CN107026709A (en) * | 2016-02-01 | 2017-08-08 | 中兴通讯股份有限公司 | A kind of data packet coding processing method and processing device, base station and user equipment |
Non-Patent Citations (2)
| Title |
|---|
| 《LDPC Encoding Based on the Primitive Polynomial》;Dai Nina等;《2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM)》;20101014;全文 * |
| 快速收敛准循环LDPC码的构造与译码实现;张瑞;《中国优秀硕士学位论文全文数据库 信息科技辑》;20150815;I136-108页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107863971A (en) | 2018-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI651954B (en) | Transmitting device, transmitting method, receiving device, and receiving method | |
| Uchôa et al. | Design of LDPC codes based on progressive edge growth techniques for block fading channels | |
| KR101929145B1 (en) | Data processing device, and data processing method | |
| US9525433B2 (en) | Method and apparatus for channel encoding and decoding in a communication system using a low-density parity check code | |
| RU2450442C2 (en) | Method and apparatus for channel encoding and decoding in communication system using low-density parity-check codes | |
| CN111565052A (en) | Data processing method and device of structured LDPC code | |
| US20100138720A1 (en) | Channel-encoding/decoding apparatus and method using low-density parity-check codes | |
| KR101929298B1 (en) | Data processing device and data processing method | |
| KR101929296B1 (en) | Data processing device and data processing method | |
| TW201824829A (en) | Transmission device, transmission method, reception device, and reception method | |
| Zhang et al. | On bit-level decoding of nonbinary LDPC codes | |
| CN111277354B (en) | Coding and decoding method and related device of low-density parity check LDPC code | |
| TWI672031B (en) | Sending method and receiving device | |
| KR101865068B1 (en) | Apparatus and method for mapping/demapping signal in a communication system using a low density parity check code | |
| TWI677197B (en) | Sending method and receiving device | |
| Jang et al. | Design of LDPC coded BICM in DVB broadcasting systems with block permutations | |
| JP4603518B2 (en) | Encoding device and decoding device | |
| KR20160100668A (en) | Bit interleaver for 1024-symbol mapping and low density parity check codeword with 64800 length, 4/15 rate, and method using the same | |
| CN107863971B (en) | Construction method and system of LDPC code check matrix for PTN | |
| TW201921846A (en) | Transmission method and reception device | |
| TWI667901B (en) | Sending method and receiving device | |
| CN102811064B (en) | Method for constructing multi-rate low density parity check (LDPC) code | |
| Kim et al. | A simple construction for QC-LDPC codes of short lengths with girth at least 8 | |
| KR20160060026A (en) | Data processing device and data processing method | |
| KR20160060027A (en) | Data processing device and data processing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |