CN107786210B - Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system - Google Patents

Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system Download PDF

Info

Publication number
CN107786210B
CN107786210B CN201610786198.XA CN201610786198A CN107786210B CN 107786210 B CN107786210 B CN 107786210B CN 201610786198 A CN201610786198 A CN 201610786198A CN 107786210 B CN107786210 B CN 107786210B
Authority
CN
China
Prior art keywords
code
code word
intercepted
word
rate
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
Application number
CN201610786198.XA
Other languages
Chinese (zh)
Other versions
CN107786210A (en
Inventor
张文军
张根宁
何大治
徐胤
管云峰
王延峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Jiaotong University
Original Assignee
Shanghai Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Jiaotong University filed Critical Shanghai Jiaotong University
Priority to CN201610786198.XA priority Critical patent/CN107786210B/en
Publication of CN107786210A publication Critical patent/CN107786210A/en
Application granted granted Critical
Publication of CN107786210B publication Critical patent/CN107786210B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/11Error 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/1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148Structural properties of the code parity-check or generator matrix
    • H03M13/116Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • H03M13/1162Array based LDPC codes, e.g. array codes
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/11Error 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/1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148Structural properties of the code parity-check or generator matrix
    • H03M13/118Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
    • H03M13/1185Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal

Abstract

The invention provides a medium-high code rate LDPC code word structure and a coding method for a multi-point cooperative communication system, wherein a code word with the lowest code rate is called a mother code and is an LDPC code word of a QC-IRA structure with the code length of N and information bits of K, and the code is carried out according to a coding code table and a coding method to obtain an original code word. Other code words with higher code rate than the mother code are called as intercepted code words, and are obtained by intercepting the original code words after the mother code is coded, part of bits are intercepted from the original code words and are spliced together for transmission, the rest bits are not transmitted, and the specifically intercepted bits are given by an intercepted bit code table. The multi-point cooperative communication system requires that the LDPC code words can be independently coded and decoded, and simultaneously, the code words with different code rates can be combined together for joint decoding, so that performance gain is obtained. The code word structure and the coding method provided by the invention can well meet the requirement.

Description

Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system
Technical Field
The invention relates to the technical field of communication coding, in particular to a medium and high code rate LDPC code word structure and a coding method suitable for a multi-point cooperative communication system.
Background
The LDPC codeword was first proposed by bolager in 1963, and provided with a codeword and a corresponding iterative decoding algorithm, but the initial iterative decoding algorithm was complex, and the development of the integrated circuit technology was slow, so the LDPC codeword was not considered at that time. In a later period of time, few scholars have much attention paid to LDPC codewords, except that Tanner visualizes the iterative decoding of LDPC with bipartite graphs. Subsequently, in the last 90 th century, Turbo codes based on iterative decoding mechanism were found to be a coding scheme that can approach Shannon limit, so far people began to pay attention to the excellent performance of iterative decoding. Meanwhile, the iteration theory based on the bipartite graph (Tanner graph) also makes a great breakthrough: spielman explains the error correction process as a process of gradually reducing errors, proves that a bipartite Graph-based coding and decoding algorithm has linear complexity, on the basis, scholars propose conditions and a method for generating a bipartite Graph with certain error correction capability by using an Expander Graph, then Kschischang and the like establish the theory of a Factor Graph (Factor Graph), further deepens the Graph theory basis based on LDPC iterative decoding, and on the basis of the researches, Wiber proposes an LDPC iterative decoding algorithm based on a Graph. All these theories are proposed, so that in 1995, Mackay and Neal discovered that LDPC codes have performance approaching the shannon limit as Turbo codes, thereby causing a hot tide of research on LDPC codes.
Through deep research on LDPC code words, the LDPC code is found to have advantages in all aspects compared with Turbo code, has better decoding performance and lower realization complexity, and can meet the requirements of high-speed data transmission and high performance of a future system, thereby being widely applied. Currently, communication systems using LDPC codewords include: the european second generation digital broadcast television transmission standard DVB2 series; IEEE802.11 n wireless local area network standard; the ieee802.11e wireless wide area network standard; the terrestrial transmission standard for digital television (DTTB) in china, and the near-earth, deep space communication systems of the north american CCSDS, and the like.
At present, the theoretical basis of LDPC is indeed gradually perfected, and the research on the code words is gradually shifted from pure theory to the research on the requirement of theory combined application. Specific LDPC code words are designed to meet specific application scenarios and application requirements. In the coordinated multi-point communication system, a plurality of base stations encode and transmit the same content, so as to ensure the coverage rate in complex terrain, and therefore, if a receiving end receives a signal of any one of the base stations, the receiving end can directly decode the signal. However, when a receiving end receives signals transmitted by a plurality of base stations, if the information carried in the signals cannot be fully utilized for joint decoding, a large amount of spectrum waste is caused, so that the multi-point cooperative communication system requires that the LDPC code words transmitted by any base station can be decoded independently, and simultaneously, the LDPC code words transmitted by different base stations can be decoded jointly, the information carried in the signals transmitted by different base stations is fully utilized, and the performance of joint decoding is greatly improved compared with the performance of independent decoding. For the above application requirements, the code word and the corresponding coding method need to be designed separately to meet the requirements.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a medium and high code rate (code rate greater than or equal to 1/2) LDPC code word structure and a coding method suitable for a multipoint cooperative communication system, which are used for meeting the requirement that different code rate code words can be jointly decoded in the multipoint cooperative communication system.
According to a first aspect of the present invention, there is provided a medium and high code rate LDPC codeword structure suitable for a coordinated multi-point communication system, including:
mother code: the code word with the lowest code rate is an LDPC code word with a QC-IRA structure, and an original code word is obtained by encoding according to a mother code encoding code table through an encoding method of the QC-IRA structure;
intercepting a code word: except the mother code, other code rate code words are obtained by intercepting the original code words after the mother code is coded.
Further, the mother code is directed at a QC-IRA structure LDPC code word having an information bit length of K and a code word length of N, and includes a check matrix H, where N-K rows represent check nodes and N columns represent variable nodes;
the check matrix H is composed of1And H2Left and right parts, H1At left, H2Spliced together side by side on the right, wherein:
H1the matrix comprises N-K rows and K columns, which are composed of L rows and J columns, and L x J submatrices in total, and are obtained after row-column transformation, each submatrix is a Z x Z square matrix of Z rows and Z columns, the submatrix is a zero matrix or a circulant, and the weight of the circulant is 1;
H2the array is a double diagonal array with N-K rows and N-K columns.
In one embodiment, the code rate of the mother code is 1/2, the code length is 69120, and the size of the submatrix is 360 × 360, and the code of the mother code is shown in appendix I. The intercepted code rates are 3/5A, 3/5B, 3/5C, 2/3A, 2/3B, 3/4A, 3/4B, 3/4C, 6/7A, 6/7B, 6/7C, 6/7D, 6/7E and 6/7F respectively, meanwhile, the code length of the code word with code rate 3/5 is 57600, the code length of the code word with code rate 2/3 is 51840, the code length of the code word with code rate 3/4 is 46080 and the code length of the code word with code rate 6/7 is 40320, and the corresponding intercepted code is shown in appendix II.
Furthermore, the LDPC code words with medium and high code rates can be independently decoded and can also be jointly decoded in a multi-point cooperative communication system, and one set of code words comprises a plurality of medium and high code rates; in the multi-point cooperative communication system, a plurality of base stations encode the same content, if a receiving end receives a signal of any one of the base stations, the decoding can be carried out, if the receiving end receives signals sent by the plurality of base stations, information carried in the signals is fully utilized to carry out combined decoding, and the combined decoding performance is greatly improved compared with that of single decoding.
According to a second aspect of the present invention, there is provided a method for encoding a medium/high code rate LDPC codeword suitable for a coordinated multi-point communication system, including:
step one, initializing a check bit;
step two, circularly accumulating the information bits to the check bits according to a coding code table, wherein the coding code table is determined by the position of the circulant and the offset of 1 in the circulant;
and step three, accumulating the check bits to obtain the encoded LDPC mother code words.
And step four, intercepting the mother code word according to the intercepted code table to obtain the final intercepted code word.
In the above four steps, the mother code codeword can be obtained after the third step is completed, and the intercepted codeword can be obtained after the fourth step is completed.
Compared with the prior art, the code word scheme in the invention can better meet the following requirements of a multipoint cooperative communication system:
1. LDPC code words sent by any base station can be decoded independently;
2. the LDPC codes sent by different base stations can be decoded together, information carried in signals sent by different base stations is fully utilized, and the performance of joint decoding is greatly improved compared with that of independent decoding.
In the multi-point cooperative communication system, a plurality of base stations can carry out coding transmission on the same content, and the transmission coverage rate in complex terrain is ensured, so that if a receiving end receives a signal of any one of the base stations, the code word can be directly decoded. When a receiving end receives signals sent by a plurality of base stations, the code words can fully utilize information carried in the signals to carry out combined decoding, and frequency spectrums are fully utilized.
However, most of the LDPC codeword schemes in the prior art are designed separately, and therefore joint decoding cannot be performed effectively, and when a receiving end receives signals transmitted by a plurality of base stations, information carried in the signals cannot be fully utilized for joint decoding, which causes a great amount of waste of frequency spectrum
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 is a diagram illustrating an exemplary method for encoding an intercepted code according to the present invention;
fig. 2 is a schematic structural diagram of a check matrix H of an LDPC codeword in an embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that variations and modifications can be made by persons skilled in the art without departing from the spirit of the invention. All falling within the scope of the present invention.
The invention provides a set of intercepting LDPC code word structure based on a multi-point cooperative communication system, a corresponding coding code table and an intercepting code table, and a detailed description of the corresponding code word structure and the coding method.
A middle and high code rate LDPC code word structure suitable for a multi-point cooperative communication system is disclosed, wherein the code word with the lowest code rate is a mother code which is an LDPC code word with a QC-IRA (Quasi-Cyclic Irregular Repeat Accumulate) structure, and an original code word is obtained by coding according to a mother code coding code table through a coding method of the structure. Other code words with a higher code rate than the mother code are called as intercepted code words and are obtained by intercepting the original code words after the mother code is encoded, wherein the intercepting mode is as shown in fig. 1, a part of bits (white parts in fig. 1) are intercepted from the original code words and are spliced together for transmission, the rest bits (gray parts) are not transmitted, and the specifically intercepted bits are given by an intercepted bit code table.
A specific LDPC codeword structure can be completely represented by its check matrix, and in a set of truncated LDPC codewords, because the final codeword of the truncated code is obtained by truncation after the mother code is encoded, although there are multiple code rates, there is only one specific codeword, i.e., the mother code, and the truncated code has no specific codeword, but its encoding method explains how to obtain the corresponding codeword.
The mother code structure is a QC-IRA structure. In a check matrix H of QC-IRA structure LDPC code word with information bit length K and code word length N, N-K rows represent check nodes, N columns represent variable nodes, and the H matrix is formed by H1And H2The left part and the right part are formed as shown in figure 2. Wherein H1There are N-K rows and K columns. It is composed of L x J submatrices P and is obtained after row-column transformation. Namely:
Figure BDA0001102224230000041
submatrix Pl,jThe matrix is a square matrix of Z and Z, the sub-matrixes are all zero matrixes or circulants, and the weight of the circulant is 1. l, j represents the position of the submatrix when Pl,jIn the case of non-zero matrices, by Pl,jI denotes the offset of the circulant, i.e.: (suppose Z is 4)
Figure BDA0001102224230000051
H2The array is a double diagonal array with N-K rows and N-K columns. Namely:
Figure BDA0001102224230000052
in a specific embodiment, the mother code has a code rate of 1/2, an information bit length of 34560, a code length of 69120, and a circulant size of 360 × 360. Therefore we use (i)0,i1,…i34559) Represents an information bit, (p)0,p1,…p34559) Representing the check bits, and thus obtaining the final codeword (i)0,i1,…i34559,p0,p1,…p34559) A. For the mother code of this particular embodiment, the encoding method is as follows:
step one, initializing the check bit. Instant p0=p1=p2=…=p34559=0。
And step two, circularly accumulating the information bits to the check bits according to an encoding code table of the LDPC code words with code rate of 1/2 and code length of 69120 in the appendix I. According to the code table, the bit value i of the first information bit is set0Accumulating to check bit with address as first row digit of code table, the following 359 information bit values imM 1, 2, 3 … 359 to an address of
(x+(mmod360)*96)mod34560
Wherein x represents the number of the first row of the code table. Circulating by taking 360 information bits as a circulating block, and then performing the operation once for each circulating block, wherein each circulating block corresponds to one row in a code table, namely 1 st to 360 th rows
The information bits correspond to the first row of the code table, the 361 st to 720 th information bits correspond to the second row of the code table, and so on.
And step three, accumulating the check bits to obtain the coded code word. I.e. p0And keeping the same, starting from i equal to 1,the following operations were sequentially performed
Figure BDA0001102224230000053
Obtaining the final mother code word (i)0,i1,…i34559,p0,p1,…p34559)。
In this embodiment, since the code rate of the mother code is 1/2, the code length is 69120, the information bit length is 34560, and the extracted code is obtained by extracting from the mother code, the decoded information bit lengths are the same, the code lengths of the extracted codes corresponding to code rates 3/5, 2/3, 3/4, and 6/7 are 57600, 51840, 46080, and 40320, respectively, and the information bit lengths of the above code rates are the same and are 34560.
When the truncated codeword in this embodiment is encoded, the following step four is also required to be completed in addition to the above steps one to three.
And step four, intercepting the mother code words according to an intercepting code table in an appendix II corresponding to the appendix I to obtain final intercepting code words. Namely, according to the interception code table in each interception code rate code table in the appendix II, intercepting the code word (i) of the mother code0,i1,…i34559,p0,p1,…p34559) The corresponding bits in the code are spliced together, and the encoding flow is shown in fig. 1.
Appendix I: code table of LDCP codeword with code rate of 1/2 and code length of 69120:
Figure BDA0001102224230000061
Figure BDA0001102224230000071
Figure BDA0001102224230000081
Figure BDA0001102224230000091
appendix II: and (3) corresponding to each interception code rate code table in appendix I:
assume the original code word of the mother code after being coded is (i)0,i1,…i34559,p0,p1,…p34559)
When the code word is intercepted as code word of code rate 3/5A, the reserved bit code table is: (i)0,i1,…i34559,p1,p2,p4,p5…,p34558,p34559) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod3 ≠ 0.
When the code word is intercepted as code word of code rate 3/5B, the reserved bit code table is: (i)0,i1,…i34559,p0,p2,p3,p5…,p34557,p34559) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod3 ≠ 1.
When the code word is intercepted as code word of code rate 3/5C, the reserved bit code table is as follows: (i)0,i1,…i34559,p0,p1,p3,p4…,p34557,p34558) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod3 ≠ 2.
When the code word is intercepted as code word of code rate 2/3A, the reserved bit code table is: (i)0,i1,…i34559,p1,p3,p5,p7…,p34557,p34559) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod2 ≠ 0.
When the code word is intercepted as code word of code rate 2/3B, the reserved bit code table is: (i)0,i1,…i34559,p,p2,p4,p6…,p34556,p34558) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod2 ≠ 1.
When the code word is intercepted as code word of code rate 3/4A, the reserved bit code table is: (i)0,i1,…i34559,p0,p3,p6,p9…,p34554,p34557) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod3 is 0.
When the code word is intercepted as code word of code rate 3/4B, the reserved bit code table is: (i)0,i1,…i34559,p1,94,p7,p10…,p34555,p34558) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod3 is 1.
When the code word is intercepted as code word of code rate 3/4C, the reserved bit code table is as follows: (i)0,i1,…i34559,p2,p5,p8,p11…,p34556,p34559) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod3 ═ 2.
When the code word is intercepted as code word of code rate 6/7A, the reserved bit code table is: (i)0,i1,…i34559,p0,p6,p12…,p34548,p34554) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod6 is 0.
When the code word is intercepted as code word of code rate 6/7B, the reserved bit code table is: (i)0,i1,…i34559,p1,p7,p13…,p34549,p34555) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod6 is 1.
When the code word is intercepted as code word of code rate 6/7C, the reserved bit code table is as follows: (i)0,i1,…i34559,p2,p8,p14…,p34550,p34556) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod6 ═ 2.
When the code word is intercepted as code word of 6/7D rate, the reserved bit code table is: (i)0,i1,…i34559,p3,p9,p15…,p34551,p34557) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod6 is 3.
When the code word is intercepted as code word of code rate 6/7E, the reserved bit code table is as follows: (i)0,i1,…i34559,p4,p10,p16…,p34552,p34558) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod6 is 4.
When the code word is intercepted as code word of code rate 6/7F, the reserved bit code table is: (i)0,i1,…i34559,p5,p11,p17…,p34553,p34559) Wherein im,m=0,1,2…34599;pm,m∈[0,34559]And m mod6 ═ 5.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes and modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention.

Claims (6)

1. A medium-high code rate LDPC codeword structure for a coordinated multi-point communication system, comprising:
mother code: the code word with the lowest code rate is an LDPC code word with a QC-IRA structure, and an original code word is obtained by encoding according to a mother code encoding code table through an encoding method of the QC-IRA structure;
intercepting a code word: other code rate code words except the mother code are obtained by intercepting the original code word after the mother code is coded;
the mother code comprises a check matrix H aiming at a QC-IRA structure LDPC code word with an information bit length of K and a code word length of N, wherein N-K rows represent check nodes, and N columns represent variable nodes;
the check matrix H is composed of1And H2Left and right parts, H1At left, H2Spliced together side by side on the right, wherein:
H1the matrix comprises N-K rows and K columns, which are composed of L rows and J columns, and L x J submatrices, and are obtained after row-column transformation, wherein each submatrix is a Z x Z square matrix of Z rows and Z columns, namely N-K = L x Z, K = J x Z; the sub-matrixes are all zero matrixes or circulant, and the weight of the circulant is 1;
H2the array is a double diagonal array with N-K rows and N-K columns.
2. The LDPC codeword structure of claim 1, wherein the LDPC codewords with medium and high code rates can be independently decoded and jointly decoded in a coordinated multi-point communication system, and a set of codewords comprises a plurality of medium and high code rates; in the multi-point cooperative communication system, a plurality of base stations encode the same content, if a receiving end receives a signal of any one of the base stations, the decoding can be carried out, if the receiving end receives signals sent by the plurality of base stations, information carried in the signals can be fully utilized for carrying out combined decoding, and the combined decoding performance is greatly improved compared with that of single decoding.
3. The LDPC codeword structure with medium and high code rates for use in a coordinated multi-point communication system as claimed in any one of claims 1-2, wherein the mother code has a codeword rate of 1/2, a code length of 69120, and a sub-matrix size of 360 × 360, and the code table thereof is:
692 1185 1735 5494 6481 9193 9459 11862 18926 20176 21874 22237 23132 24113 25136 33959
2587 6757 7440 8082 8815 10269 10728 12931 13887 19514 22276 23388 25453 26628 27896 29080
3054 3179 5627 8907 12424 13257 14607 17118 17881 18663 21177 22048 26715 26769 32717 33478
1173 4972 6176 8026 10944 17891 20759 21215 21418 23956 26255 26307 31557 32006 32062 33247
5189 8568 8669 9306 9834 16940 19574 20550 20612 24053 26681 27618 27998 29633 32770 33420
1544 6283 7573 7873 9453 9559 14227 14345 15122 18227 18324 20878 22634 23511 23932 33986
2991 4333 4794 9737 9970 9992 10845 12810 15072 18469 20770 24240 24869 25018 31671 32588
1039 1579 1694 6183 6758 13316 18987 19156 20519 22044 22174 23776 25545 28972 29874 33943
372 4291 5807 6210 8883 11531 14240 14786 19422 21382 21462 21945 25309 30376 30984 32673
4423 6293 7133 7154 7417 10276 10869 11409 11885 14998 15482 16924 16945 17783 22811 28590
159 1784 3158 3178 6913 7173 10404 13556 15103 19579 21496 23228 24294 29081 30227 31669
5065 5595 5825 6638 9331 10559 11600 18360 23565 24035 25649 27088 29134 31788 32835 33962
6621 7496 9176 11662 11830 12696 13152 16699 20650 21095 22068 27188 27832 29470 30194 31328
13615 19547 21942 23594 30542
2678 6743 19217 25719 30475
9059 11115 12850 17694 26639
14175 14799 16045 18714 34449
1257 2130 12813 26141 32333
15420 19307 20002 26572 28481
595 4669 4841 10946 18001
5840 11977 13477 25731 28560
533 5557 12250 15289 28948
11628 15263 20418 25864 29054
8040 14433 15077 19269 26497
332 10547 14416 18055 29607
9700 19193 24476 26427 26918
1111 4917 6948 7914 10899
10879 14374 23385 23396 33148
9102 19555 20128 27366 32954
683 7806 12205 20379 32960
3657 4111 7244 10531 11186
876 4310 11278 16441 20123
5835 13613 28151 29713 31093
6313 16431 17856 20316 33254
37 4001 10521 16616 17066
4049 7831 18531 19623 27215
3090 13194 17533 19412 31572
679 5508 10660 12502 29334
3220 14362 20104 25450 32518
5993 16410 16637 18124 26318
7664 11861 21310 27047 32454
707 3199 3326 25614 31160
4672 5928 10460 24861 30867
811 2433 2445 9237 13913
2497 6513 27384 30610 34367
3586 4196 14584 24563 24927
2128 9093 18722 20514 34459
5957 6266 24048 24595 24988
3009 5191 14775 17436 18416
2648 17150 21807 23753 26559
16895 24418 27645 28134 31305
3398 19445 19917 25266 29003
11908 13497 14517 27690 29701
5562 9979 15478 20579 31891
557 1201 8704 9092 24028
11993 12194 18660 28682 34489
3864 12616 27212
8999 10586 19443
4385 22177 28015
10094 16136 23636
937 10755 12250
12562 26443 33303
21100 26815 31114
7484 10991 11632
10381 19613 21056
119 3126 30123
9576 9639 31747
16466 21940 33600
14488 21875 28539
20142 22565 32997
4145 30238 33494
11485 19159 23782
23317 24450 29556
2142 5616 23579
2542 21324 24177
9616 18995 22245
162 9661 18764
6398 25883 29056
9578 22359 22985
18950 19801 28349
13192 18193 28038
3361 18531 31016
1516 12459 27996
14767 16423 19577
11153 17236 17252
3648 5352 32602
21944 27344 29134
13376 16749 16758
10675 14781 19212
223 777 6802
9939 15687 21574
20197 29155 33048
2051 22734 29151
2673 3503 31198
18520 23305 31716
6804 25244 30258。
4. the LDPC codeword structure of any one of claims 1-2, wherein the code rates of the extracted codes are 3/5, 2/3, 3/4 and 6/7, respectively, and meanwhile, the code length of 3/5 code rate codeword is 57600, the code length of 2/3 code rate codeword is 51840, the code length of 3/4 code rate codeword is 46080, and the code length of 6/7 code rate is 40320; the 3/5 code rate adopts three interception modes, namely 3/5A, 3/5B and 3/5C, the 2/3 code rate adopts two interception modes, namely 2/3A and 2/3B, the 3/4 code rate adopts three interception modes, namely 3/4A, 3/4B and 3/4C, and the 6/7 code rate adopts six interception modes, namely 6/7A, 6/7B, 6/7C, 6/7D, 6/7E and 6/7F; the corresponding intercepted code table is:
the original code word of the mother code after being coded is assumed to be
Figure DEST_PATH_IMAGE001
When the code word is intercepted as code word of code rate 3/5A, the reserved bit code table is:
Figure 224789DEST_PATH_IMAGE002
wherein
Figure DEST_PATH_IMAGE003
When the code word is intercepted as code word of code rate 3/5B, the reserved bit code table is:
Figure 735405DEST_PATH_IMAGE004
wherein
Figure DEST_PATH_IMAGE005
When the code word is intercepted as code word of code rate 3/5C, the reserved bit code table is as follows:
Figure 311879DEST_PATH_IMAGE006
wherein
Figure DEST_PATH_IMAGE007
When the code word is intercepted as code word of code rate 2/3A, the reserved bit code table is:
Figure 441509DEST_PATH_IMAGE008
wherein
Figure DEST_PATH_IMAGE009
When the code word is intercepted as code word of code rate 2/3B, the reserved bit code table is:
Figure 52619DEST_PATH_IMAGE010
wherein
Figure DEST_PATH_IMAGE011
When the code word is intercepted as code word of code rate 3/4A, the reserved bit code table is:
Figure 737066DEST_PATH_IMAGE012
wherein
Figure DEST_PATH_IMAGE013
When the code word is intercepted as code word of code rate 3/4B, the reserved bit code table is:
Figure 472941DEST_PATH_IMAGE014
wherein
Figure DEST_PATH_IMAGE015
When the code word is intercepted as code word of code rate 3/4C, the reserved bit code table is as follows:
Figure 468579DEST_PATH_IMAGE016
wherein
Figure DEST_PATH_IMAGE017
When the code word is intercepted as code word of code rate 6/7A, the reserved bit code table is:
Figure 730933DEST_PATH_IMAGE018
wherein
Figure DEST_PATH_IMAGE019
When the code word is intercepted as code word of code rate 6/7B, the reserved bit code table is:
Figure 458717DEST_PATH_IMAGE020
wherein
Figure DEST_PATH_IMAGE021
When the code word is intercepted as code word of code rate 6/7C, the reserved bit code table is as follows:
Figure 9785DEST_PATH_IMAGE022
wherein
Figure DEST_PATH_IMAGE023
When the code word is intercepted as code word of 6/7D rate, the reserved bit code table is:
Figure 605851DEST_PATH_IMAGE024
wherein
Figure DEST_PATH_IMAGE025
When the code word is intercepted as code word of code rate 6/7E, the reserved bit code table is as follows:
Figure 598078DEST_PATH_IMAGE026
wherein
Figure DEST_PATH_IMAGE027
When the code word is intercepted as code word of code rate 6/7F, the reserved bit code table is:
Figure 824660DEST_PATH_IMAGE028
wherein
Figure DEST_PATH_IMAGE029
5. A method for encoding a high and medium code rate LDPC mother code codeword for a coordinated multi-point communication system as claimed in any one of claims 1 to 4, wherein: the method comprises the following steps:
step one, initializing a check bit;
step two, circularly accumulating the information bits to the check bits according to a coding code table, wherein the coding code table is determined by the position of the circulant and the offset of 1 in the circulant;
and step three, accumulating the check bits to obtain the coded high-code-rate LDPC mother code words.
6. The method for encoding the LDPC intercepted code words with medium and high code rates according to claim 5, wherein the method comprises the following steps: the encoding method of the interception code is to intercept the mother code word obtained after the mother code is encoded, and specific intercepted bits are given by an intercepted bit code table, that is, after the three steps of claim 5 are completed, the following four steps are also required to be performed:
and step four, intercepting the mother code word according to the intercepted bit code table to obtain the final intercepted code word.
CN201610786198.XA 2016-08-30 2016-08-30 Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system Active CN107786210B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610786198.XA CN107786210B (en) 2016-08-30 2016-08-30 Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610786198.XA CN107786210B (en) 2016-08-30 2016-08-30 Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system

Publications (2)

Publication Number Publication Date
CN107786210A CN107786210A (en) 2018-03-09
CN107786210B true CN107786210B (en) 2021-03-09

Family

ID=61451386

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610786198.XA Active CN107786210B (en) 2016-08-30 2016-08-30 Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system

Country Status (1)

Country Link
CN (1) CN107786210B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109087683B (en) * 2018-07-26 2021-08-17 西京学院 NAND Flash solid state storage self-adaptive error control method
CN111371463B (en) * 2018-12-26 2022-01-28 上海交通大学 Code word encoding method, system and medium for LDPC code word structure
CN111294147B (en) * 2019-04-25 2023-01-31 北京紫光展锐通信技术有限公司 Encoding method and device of DMR system, storage medium and digital interphone
CN110266320B (en) * 2019-07-01 2021-03-12 京信通信系统(中国)有限公司 LDPC encoding and decoding method, device and encoding and decoding system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101753263A (en) * 2008-12-10 2010-06-23 国家广播电影电视总局广播科学研究院 QC-LDPC codes and system and method applied thereof

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101009785B1 (en) * 2003-12-10 2011-01-19 삼성전자주식회사 Apparatus and method for coding/decoding irregular repeat accumulate code

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101753263A (en) * 2008-12-10 2010-06-23 国家广播电影电视总局广播科学研究院 QC-LDPC codes and system and method applied thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"Rate-compatible LDPC-RS product codes based on raptor-like LDPC codes";Yaqi Li等;《2013 IEEE International Symposium on Broadband》;20131008;正文第4节 *

Also Published As

Publication number Publication date
CN107786210A (en) 2018-03-09

Similar Documents

Publication Publication Date Title
CN107786306B (en) Low-code-rate LDPC code word structure and coding method for multi-point cooperative communication system
EP2093887B1 (en) Apparatus and method for channel encoding and decoding in a communication system using low-density parity-check codes
JP5506878B2 (en) Parity check matrix generation method for low density parity check code
CN1866751B (en) Construction method and device for low density parity codes
EP2503698B1 (en) Error correction method and device, and communication system using the same
CN107786210B (en) Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system
US8423860B2 (en) Apparatus and method for generating a parity check matrix in a communication system using linear block codes, and a transmission/reception apparatus and method using the same
WO2011029362A1 (en) Configuration method of ldpc code check matrix and encoding method and encoding apparatus based on the configuration method
CN102006085B (en) Method for constructing eIRA-like quasi-cyclic low-density parity-check (LDPC) code check matrix
CN109802687B (en) High-speed code rate compatible LDPC encoder of QC-LDPC code based on FPGA
CN1933336B (en) Construction of LDPC (low density parity check) codes using GRS (generalized reed-solomon) code
US20200382134A1 (en) Error correction decoding device and optical transmission/reception device
KR20170075627A (en) Apparatus and method for encoding and decoding in communication or broadcasting system
CN104868926B (en) A kind of building method and system of LDPC code type
CN106685432A (en) Large girth type-II QC-LDPC code construction method based on complete cyclic difference sets
CN109150192B (en) LDPC code word structure and code word coding method
CN104426553A (en) Encoding method for low-density parity check matrix
CN102811064B (en) Method for constructing multi-rate low density parity check (LDPC) code
CN104821830B (en) A kind of LDPC structure, code word and corresponding encoder, decoder and coding method
EP3771105B1 (en) Transmitter, receiver, communication system, and coding rate revision method
Huang et al. Girth 4 and low minimum weights' problems of LDPC codes in DVB-S2 and solutions
CN116054844B (en) Check matrix construction method, system, electronic equipment and computer storage medium
CN113037297B (en) LDPC codeword encoding method, encoding system and storage medium
TWI712269B (en) Data decoding method using ldpc code as error correction code and data transmitting method thereof
CN111371463B (en) Code word encoding method, system and medium for LDPC code word structure

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