CN105071818A - Low-complexity LDPC code coding method - Google Patents
Low-complexity LDPC code coding method Download PDFInfo
- Publication number
- CN105071818A CN105071818A CN201510546506.7A CN201510546506A CN105071818A CN 105071818 A CN105071818 A CN 105071818A CN 201510546506 A CN201510546506 A CN 201510546506A CN 105071818 A CN105071818 A CN 105071818A
- Authority
- CN
- China
- Prior art keywords
- length
- matrix
- entity
- ring
- basis matrix
- 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.)
- Pending
Links
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention provides a low-complexity LDPC (Low Density Parity Check) code coding method. The method comprises the following steps of: iteratively eliminating rings, of which length is less than a threshold value, in a basis matrix, and obtaining the needed basis matrix; then, extending the basis matrix by using a circulant permutation matrix, and obtaining a LDPC code with quasi-cyclic structure. The invention provides the LDPC code coding method, the LDPC code with quasi-cyclic structure is constructed by the method, moreover, the LDPC code is easy to code and decode with low complexity, easy to store with small capacity and easy to realize by hardware.
Description
Technical field
The present invention relates to information coding, particularly a kind of LDPC code coding method.
Background technology
Low density parity check code is proposed in 1963 by Gakkager the earliest, and in the later stage nineties 20th century, the discovery due to Turbo code makes scholar again be studied LDPC code.Present LDPC code has been proved to be the error correcting code of a class closely shannon limit theoretically.LDPC code with random configuration is compared, and class cyclic LDPC code has following advantage: can by simply, linearly the shift register of complexity realize; Can be represented by basis matrix, basis matrix has less size, and basis matrix utilizes cyclic permutation matrices to expand easily.So class cyclic LDPC code has the advantages such as encoding and decoding complexity is lower, hardware implementing is simpler, memory space is less.But inventor finds, the quantity of ring and the distribution of weight the same performance important to LDPC code of the distribution of size with code, when in Weighted T anner figure containing length less ring time, the error-correcting performance of this yard will decline, and this seriously inhibits the cataloged procedure of LDPC code.
Summary of the invention
For solving the problem existing for above-mentioned prior art, the present invention proposes the coding method of a kind of low complex degree LDPC code, comprising:
First the length in iteration elimination basis matrix is less than the ring of threshold value, obtains required basis matrix; Then use cyclic permutation matrices to expand basis matrix, obtain the LDPC code with class loop structure.
Preferably, before the length in described elimination basis matrix is less than the ring of threshold value, the method also comprises:
Basis matrix can be detected with following methods and whether there is becate:
For the basis matrix of a m × n, if Σ is s
2k-s
2k-1then there is becate wherein in=0modP, s
2kand s
2k-1based on two adjacent position elements on becate in matrix, P is the exponent number of cyclic permutation matrices.
Preferably, the length in described elimination basis matrix is less than the ring of threshold value, and comprising the length eliminated in basis matrix is further the ring of 4, obtains the basis matrix that length is 6:
(1) candidate's entity initialization, the N number of entity of random generation, each entity is candidate's entity matrix of a m × n, is expressed as s
i, composition initial population;
(2) in calculated candidate entity matrix, length is the number of the ring of 4, if in population there is not the ring that length is 4 in entity, then and finishing iteration; Otherwise, continue next step operation;
For some candidate's entity s, i.e. the matrix of m × n, its length be 4 loops detection algorithm as follows:
Step 1: in matrix s i-th
1oK, i
1=1,2 ..., m, for jth
1row, j
1=1,2 ..., n, if s is (i
1, j
1) ≠ 0, then skip to step 2; Otherwise, continue step 1, until j
1i-th is jumped to during >n
1terminate during >m;
Step 2: for jth
2row, j
2>j
1if s is (i
1, j
1) ≠ 0, then skip to step 3; Otherwise, continue step 2, until j
2step 1 is skipped to during >n;
Step 3: for i-th
2oK, i
2>i
1,if s is (i
2, j
2) ≠ 0 and s (i
2, j
1) ≠ 0, then skip to step 4; Otherwise, continue step 3, until i
2step 2 is skipped to during >m;
Step 4: if meet s (i
2, j
2)-s (i
2, j
1)+s (i
1, j
2)-s (i
1, j
1)=0 (modP), then length is the ring number increasing 1 of 4; Otherwise skip to step 3;
(3) selection one is the 4 minimum entity matrix directly heredity extremely next generations containing length, and copies this entity once, is that the entity maximum containing number of rings of 4 is directly eliminated, keeps population scale constant by length;
(4) to all the other entities, random selecting a pair entity s
aand s
b, carry out column vector single-point intersection, produce two new entity s
xand s
ythat is,
By basis matrix s
aand s
bbe expressed as
S
a＝[c
a(0)…c
a(k-1)c
a(k)…c
a(n-1)]，
S
b＝[c
b(0)…c
b(k-1)c
b(k)…c
b(n-1)]；
In formula, c
a(i) and c
bthe column vector of (i) to be length be m, matrix s
aand s
bthe novel entities produced after column vector single-point intersects is
S
x＝[c
a(0)…c
a(k-1)c
b(k)…c
b(n-1)]，
S
y＝[c
b(0)…c
b(k-1)c
a(k)…c
a(n-1)]；
(5) to all candidate's entities in population, in random variation matrix, a certain length is the arbitrary element on the ring of 4, and become certain number of stochastic generation by this element, mutation probability is set to 0.1.
Preferably, the length in described elimination basis matrix is the ring of 4, and obtain after length is the basis matrix of 6, the method also comprises:
The length eliminated in basis matrix is the ring of 6, obtains the basis matrix that length is 8.
The present invention compared to existing technology, has the following advantages:
The present invention proposes a kind of LDPC code coding method, construct the LDPC code with class loop structure, and it is lower to be easy to encoding and decoding complexity, low capacity stores and hardware implementing.
Accompanying drawing explanation
Fig. 1 is the flow chart of the low complex degree LDPC code coding method according to the embodiment of the present invention.
Embodiment
Detailed description to one or more embodiment of the present invention is hereafter provided together with the accompanying drawing of the diagram principle of the invention.Describe the present invention in conjunction with such embodiment, but the invention is not restricted to any embodiment.Scope of the present invention is only defined by the claims, and the present invention contain many substitute, amendment and equivalent.Set forth many details in the following description to provide thorough understanding of the present invention.These details are provided for exemplary purposes, and also can realize the present invention according to claims without some in these details or all details.
An aspect of of the present present invention provides the coding method of a kind of low complex degree LDPC code.Fig. 1 is the low complex degree LDPC code coding method flow chart according to the embodiment of the present invention.The length that the method first eliminates basis matrix be 4 ring obtain the matrix that length is the ring of 6, then on this matrix basis, eliminate length be 6 ring obtain the matrix that length is the ring of 8, this kind of method repeatedly utilizes, the basis matrix that the ring that can obtain meeting the requirements is long.Then by use cyclic permutation matrices basis matrix is expanded, obtain the LDPC code with class loop structure characteristic, its characteristic determine its use memory space less, encoding and decoding complexity is lower.
If there is becate in Weighted T anner figure, information during its iterative decoding will become relevant in exchange process, stops decoding convergence or restrains slack-off, causing the sharply decline of decoding performance.The minimum ring of Weighted T anner figure is also relevant with the minimum range of code, and length is larger, and minimum range also increases thereupon, and the minimum range that increase intersymbol can be reflected to and increase in length.So, the LDPC code that structural behavior is good, can embody a concentrated reflection of construct large length LDPC code on.A given basis matrix, whether the present invention can detect becate by method the following exists.
For the basis matrix of a m × n, the sufficient and necessary condition that there is becate is Σ s
2k-s
2k-1=0modP.In formula, s
2kand s
2k-1based on two adjacent position elements on becate in matrix, P is the exponent number of cyclic permutation matrices.
The present invention constantly increases the length in Weighted T anner figure, concrete grammar to be the length eliminated in basis matrix be 4 ring obtain the matrix that length is 6, on this basis, eliminate length be 6 ring obtain the matrix that length is 8.In a word, said method is repeatedly used can to improve length step by step.
Eliminate below length be 4 ring to obtain length be length is the basis matrix of the ring of 6, basis matrix is carried out expansion can obtain parity matrix.
(1) candidate's entity initialization, the N number of entity of random generation, each entity is candidate's entity matrix of a m × n, is expressed as s
i, composition initial population.
(2) basis matrix s
iin length large as much as possible, and in matrix si, the long ring for length of ring is few as much as possible.In calculated candidate entity matrix, length is the number of the ring of 4, and the entity adaptability that number of rings is fewer is better.If in population there is not the ring that length is 4 in entity, then finishing iteration; Otherwise, continue next step operation.
For some candidate's entity s, i.e. the matrix of m × n, its length be 4 loops detection algorithm as follows:
Step 1: in matrix s i-th
1(i
1=1,2 ..., m) row, for jth
1(j
1=1,2 ..., n) arrange, if s is (i
1, j
1) ≠ 0, then skip to step 2; Otherwise, continue step 1, until j
1i-th is jumped to during >n
1terminate during >m;
Step 2: for jth
2(j
2>j
1) row, if s is (i
1, j
1) ≠ 0, then skip to step 3; Otherwise, continue step 2, until j
2step 1 is skipped to during >n;
Step 3: for i-th
2(i
2>i
1) OK, if s is (i
2, j
2) ≠ 0 and s (i
2, j
1) ≠ 0, then skip to step 4; Otherwise, continue step 3, until i
2step 2 is skipped to during >m;
Step 4: if meet s (i
2, j
2)-s (i
2, j
1)+s (i
1, j
2)-s (i
1, j
1)=0 (modP), then length is the ring number increasing 1 of 4; Otherwise skip to step 3.
(3) selection one is the 4 minimum entity matrix directly heredity extremely next generations containing length, and copies this entity once.Be 4 directly eliminate containing the maximum entity of number of rings by length, keep population scale constant.
(4) to all the other entities, random selecting a pair entity s
aand s
b, carry out single-point intersection, produce two new entity s
xand s
y.Interleaved mode used is mainly divided into row vector single-point to intersect and column vector single-point intersects two kinds.
1) row vector single-point intersects
Basis matrix sa and sb is expressed as
S
a＝[r
a(0)r
a(1)…r
a(m-1)]
T，
S
b＝[r
b(0)r
b(1)…r
b(m-1)]
T
In formula, r
a(i) and r
bthe row vector of (i) to be length be n.Matrix s
aand s
brow vector representation be
A＝(r
a(0)，…，r
a(m-1))＝(a
0，…，a
k-1，a
k，…，a
mn-1)，
B＝(r
b(0)，…，r
b(m-1))＝(b
0，…，b
k-1，b
k，…，b
mn-1)。
The novel entities produced after matrix A and B single-point intersect is X=a
0..., a
k-1, b
k..., b
mn-1, Y=b
0..., b
k-1, a
k..., a
mn-1.
In formula, X, Y are matrix s
x, s
yrow vector representation.
2) column vector single-point intersects
Basis matrix sa and sb is expressed as
S
a＝[c
a(0)…c
a(k-1)c
a(k)…c
a(n-1)]，
S
b＝[c
b(0)…c
b(k-1)c
b(k)…c
b(n-1)]。
In formula, c
a(i) and c
bthe column vector of (i) to be length be m.Matrix s
aand s
bthe novel entities produced after column vector single-point intersects is
S
x＝[c
a(0)…c
a(k-1)c
b(k)…c
b(n-1)]，S
y＝[c
b(0)…c
b(k-1)c
a(k)…c
a(n-1)]。
Row vector intersection can produce the column vector that weight is 0 or 1, causes the increase of the error rate.Therefore, the present invention preferably adopts column vector single-point interleaved mode, and crossover probability is set to 0.9.
(5) to all candidate's entities in population, in random variation matrix, a certain length is the arbitrary element on the ring of 4, and become certain number of stochastic generation by this element, mutation probability is set to 0.1.
Be the method for the ring of 6 for eliminating length, using the population that finally the produces initial population as current candidate.To eliminate length be the method for the ring of 6 is that the method for the ring of 4 is substantially identical with elimination length, and difference is: one is the ring that interlace operation may produce that new length is 4, so interlace operation is prohibited; Two is that mutation operation changes to: to all candidate's entities, and in random erasure matrix, a certain length is the element on the ring of 6, becomes " 0 " by nonzero element.In order to reduce the impact of low weight code word on performance, the nonzero element of the larger row of weight is selected to carry out deletion action.
In sum, the present invention proposes a kind of LDPC code coding method, construct the LDPC code with class loop structure, and it is lower to be easy to encoding and decoding complexity, low capacity stores and hardware implementing.
Obviously, it should be appreciated by those skilled in the art, above-mentioned of the present invention each module or each step can realize with general computing system, they can concentrate on single computing system, or be distributed on network that multiple computing system forms, alternatively, they can realize with the executable program code of computing system, thus, they can be stored and be performed by computing system within the storage system.Like this, the present invention is not restricted to any specific hardware and software combination.
Should be understood that, above-mentioned embodiment of the present invention only for exemplary illustration or explain principle of the present invention, and is not construed as limiting the invention.Therefore, any amendment made when without departing from the spirit and scope of the present invention, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.In addition, claims of the present invention be intended to contain fall into claims scope and border or this scope and border equivalents in whole change and modification.
Claims (4)
1. the coding method of low complex degree LDPC code, is characterized in that, comprising:
First the length in iteration elimination basis matrix is less than the ring of threshold value, obtains required basis matrix; Then use cyclic permutation matrices to expand basis matrix, obtain the LDPC code with class loop structure.
2. method according to claim 1, is characterized in that, before the length in described elimination basis matrix is less than the ring of threshold value, the method also comprises:
Basis matrix can be detected with following methods and whether there is becate:
For the basis matrix of a m × n, if Σ is s
2k-s
2k-1then there is becate wherein in=0modP, s
2kand s
2k-1based on two adjacent position elements on becate in matrix, P is the exponent number of cyclic permutation matrices.
3. method according to claim 2, is characterized in that, the length in described elimination basis matrix is less than the ring of threshold value, and comprising the length eliminated in basis matrix is further the ring of 4, obtains the basis matrix that length is 6:
(1) candidate's entity initialization, the N number of entity of random generation, each entity is candidate's entity matrix of a m × n, is expressed as s
i, composition initial population;
(2) in calculated candidate entity matrix, length is the number of the ring of 4, if in population there is not the ring that length is 4 in entity, then and finishing iteration; Otherwise, continue next step operation;
For some candidate's entity s, i.e. the matrix of m × n, its length be 4 loops detection algorithm as follows:
Step 1: in matrix s i-th
1oK, i
1=1,2 ..., m, for jth
1row, j
1=1,2 ..., n, if s is (i
1, j
1) ≠ 0, then skip to step 2; Otherwise, continue step 1, until j
1i-th is jumped to during >n
1terminate during >m;
Step 2: for jth
2row, j
2>j
1if s is (i
1, j
1) ≠ 0, then skip to step 3; Otherwise, continue step 2, until j
2step 1 is skipped to during >n;
Step 3: for i-th
2oK, i
2>i
1,if s is (i
2, j
2) ≠ 0 and s (i
2, j
1) ≠ 0, then skip to step 4; Otherwise, continue step 3, until i
2step 2 is skipped to during >m;
Step 4: if meet s (i
2, j
2)-s (i
2, j
1)+s (i
1, j
2)-s (i
1, j
1)=0 (modP), then length is the ring number increasing 1 of 4; Otherwise skip to step 3;
(3) selection one is the 4 minimum entity matrix directly heredity extremely next generations containing length, and copies this entity once, is that the entity maximum containing number of rings of 4 is directly eliminated, keeps population scale constant by length;
(4) to all the other entities, random selecting a pair entity s
aand s
b, carry out column vector single-point intersection, produce two new entity s
xand s
ythat is,
By basis matrix s
aand s
bbe expressed as
S
a＝[c
a(0)…c
a(k-1)c
a(k)…c
a(n-1)]，
S
b＝[c
b(0)…c
b(k-1)c
b(k)…c
b(n-1)]；
In formula, c
a(i) and c
bthe column vector of (i) to be length be m, matrix s
aand s
bthe novel entities produced after column vector single-point intersects is
S
x＝[c
a(0)…c
a(k-1)c
b(k)…c
b(n-1)]，S
y＝[c
b(0)…c
b(k-1)c
a(k)…c
a(n-1)]；
(5) to all candidate's entities in population, in random variation matrix, a certain length is the arbitrary element on the ring of 4, and become certain number of stochastic generation by this element, mutation probability is set to 0.1.
4. method according to claim 3, is characterized in that, the length in described elimination basis matrix is the ring of 4, and obtain after length is the basis matrix of 6, the method also comprises:
The length eliminated in basis matrix is the ring of 6, obtains the basis matrix that length is 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510546506.7A CN105071818A (en) | 2015-08-31 | 2015-08-31 | Low-complexity LDPC code coding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510546506.7A CN105071818A (en) | 2015-08-31 | 2015-08-31 | Low-complexity LDPC code coding method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105071818A true CN105071818A (en) | 2015-11-18 |
Family
ID=54501122
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510546506.7A Pending CN105071818A (en) | 2015-08-31 | 2015-08-31 | Low-complexity LDPC code coding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105071818A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105375933A (en) * | 2015-12-11 | 2016-03-02 | 中国人民解放军理工大学 | Message passing-based LDPC circle search and circle enumeration algorithm |
| CN108063622A (en) * | 2016-11-07 | 2018-05-22 | 深圳超级数据链技术有限公司 | The generation method and device of check matrix |
| CN108233945A (en) * | 2017-11-30 | 2018-06-29 | 天津津航计算技术研究所 | The building method of extremely short code length quasi- cycle Ldpc code check matrixes |
| CN108347299A (en) * | 2017-01-25 | 2018-07-31 | 华为技术有限公司 | The transmission method and device of data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101662290A (en) * | 2008-08-26 | 2010-03-03 | 华为技术有限公司 | Method and device for generating and coding quasi-cyclic LDPC code |
| CN101826878A (en) * | 2010-04-26 | 2010-09-08 | 杨磊 | QC-LDPC (Quasi-Cyclic Low Density Parity Check) code constructing method |
| US8103931B2 (en) * | 2008-08-27 | 2012-01-24 | Mitsubishi Electric Research Laboratories, Inc. | Method for constructing large-girth quasi-cyclic low-density parity-check codes |
| CN102457286A (en) * | 2010-10-21 | 2012-05-16 | 航天信息股份有限公司 | Encoding method and device for quasi-cyclic LDPC (Low Density Parity Check) code and generating method for check matrix |
| US8291283B1 (en) * | 2008-06-06 | 2012-10-16 | Marvell International Ltd. | Layered quasi-cyclic LDPC decoder with reduced-complexity circular shifter |
| CN104639177A (en) * | 2015-01-30 | 2015-05-20 | 华南理工大学 | Short cycle-optimizing QC-LDPC (Quasi-Cyclic-Low Density Parity Check) code construction method |
-
2015
- 2015-08-31 CN CN201510546506.7A patent/CN105071818A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8291283B1 (en) * | 2008-06-06 | 2012-10-16 | Marvell International Ltd. | Layered quasi-cyclic LDPC decoder with reduced-complexity circular shifter |
| CN101662290A (en) * | 2008-08-26 | 2010-03-03 | 华为技术有限公司 | Method and device for generating and coding quasi-cyclic LDPC code |
| US8103931B2 (en) * | 2008-08-27 | 2012-01-24 | Mitsubishi Electric Research Laboratories, Inc. | Method for constructing large-girth quasi-cyclic low-density parity-check codes |
| CN101826878A (en) * | 2010-04-26 | 2010-09-08 | 杨磊 | QC-LDPC (Quasi-Cyclic Low Density Parity Check) code constructing method |
| CN102457286A (en) * | 2010-10-21 | 2012-05-16 | 航天信息股份有限公司 | Encoding method and device for quasi-cyclic LDPC (Low Density Parity Check) code and generating method for check matrix |
| CN104639177A (en) * | 2015-01-30 | 2015-05-20 | 华南理工大学 | Short cycle-optimizing QC-LDPC (Quasi-Cyclic-Low Density Parity Check) code construction method |
Non-Patent Citations (1)
| Title |
|---|
| 郑丹玲 等: "利用遗传算法构造QC-LDPC码", 《电讯技术》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105375933A (en) * | 2015-12-11 | 2016-03-02 | 中国人民解放军理工大学 | Message passing-based LDPC circle search and circle enumeration algorithm |
| CN105375933B (en) * | 2015-12-11 | 2019-01-04 | 中国人民解放军理工大学 | A kind of LDPC loops detection based on message transmission and ring enumeration |
| CN108063622A (en) * | 2016-11-07 | 2018-05-22 | 深圳超级数据链技术有限公司 | The generation method and device of check matrix |
| CN108063622B (en) * | 2016-11-07 | 2022-01-04 | 江苏环雅丽书智能科技有限公司 | Method and device for generating check matrix |
| CN108347299A (en) * | 2017-01-25 | 2018-07-31 | 华为技术有限公司 | The transmission method and device of data |
| CN108347299B (en) * | 2017-01-25 | 2021-02-05 | 华为技术有限公司 | Data transmission method and device |
| CN108233945A (en) * | 2017-11-30 | 2018-06-29 | 天津津航计算技术研究所 | The building method of extremely short code length quasi- cycle Ldpc code check matrixes |
| CN108233945B (en) * | 2017-11-30 | 2021-05-11 | 天津津航计算技术研究所 | Construction method of extremely-short code long quasi-cyclic Ldpc code check matrix |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5752317B2 (en) | Method for obtaining quasi-cyclic low density parity check code and system for encoding data based on quasi-cyclic low density parity check code | |
| JP5116735B2 (en) | How to construct a code | |
| US8918696B2 (en) | Implementation of LDPC selective decoding scheduling | |
| JP6555759B2 (en) | Structured LDPC coding method, decoding method, coding device, and decoding device | |
| US8219873B1 (en) | LDPC selective decoding scheduling using a cost function | |
| CN104333390B (en) | A kind of building method of the check matrix of LDPC code and coding method | |
| US20190273511A1 (en) | Generation of spatially-coupled quasi-cyclic ldpc codes | |
| KR102274328B1 (en) | Method for managing a check node calculating unit, equipment and software for implementing the method | |
| CN102394659B (en) | Low density parity check (LDPC) code check matrix construction method and corresponding matrix multiply operation device | |
| JP5631846B2 (en) | Semiconductor memory device and decoding method | |
| CN107370490A (en) | Coding, interpretation method and the device of structured LDPC | |
| WO2010022602A1 (en) | Method and apparatus for generating quasi-cyclic low-density parity-check codes and encoding | |
| JP2012500512A (en) | Near codeword RAM list decoding | |
| CN105071818A (en) | Low-complexity LDPC code coding method | |
| WO2011109084A1 (en) | Quasi-cyclic ldpc encoding and decoding for non-integer multiples of circulant size | |
| Esfahanizadeh et al. | A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning | |
| CN101453220B (en) | Weaving and coding method for duplicate accumulation code encoding, corresponding equipment | |
| Lee et al. | An effective low-complexity error-floor lowering technique for high-rate QC-LDPC codes | |
| CN107947802B (en) | Method for coding and decoding rate compatible low density parity check code and coder | |
| CN108199722B (en) | BIBD-LDPC code construction method based on matrix lattice | |
| CN103427848B (en) | Method for constructing LDPC codes and codes | |
| TWI583141B (en) | Decoding method and decoder for low density parity check code | |
| RU2365034C2 (en) | Method and device for data coding and decoding | |
| Esfahanizadeh et al. | Coding for channels with SNR variation: Spatial coupling and efficient interleaving | |
| Nguyen et al. | Short column-weight-three LDPC codes without small trapping sets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151118 |
|
| RJ01 | Rejection of invention patent application after publication |