CN104779961B - A kind of LDPC structure, code word and corresponding encoder, decoder and coding method - Google Patents
A kind of LDPC structure, code word and corresponding encoder, decoder and coding method Download PDFInfo
- Publication number
- CN104779961B CN104779961B CN201410011008.8A CN201410011008A CN104779961B CN 104779961 B CN104779961 B CN 104779961B CN 201410011008 A CN201410011008 A CN 201410011008A CN 104779961 B CN104779961 B CN 104779961B
- Authority
- CN
- China
- Prior art keywords
- matrix
- information bit
- check
- bit
- ldpc
- 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
Landscapes
- Error Detection And Correction (AREA)
Abstract
Present invention discloses LDPC code word, corresponding encoder, decoder and the coding method of a kind of repetition accumulation type (S-IRA) of novel structuring, the structure of code word is H=[H '1∏ P '], H '1For information bit matrix, P ' is check bit matrix, and ∏ P ' is to do capable transformation to the check bit matrix, wherein information bit matrix H '1Including multiple circulation submatrix pi,j, each circulation submatrix can only be unit circle excursion matrix or full null matrix.Using technical solution of the present invention, pass through a large amount of analogue simulations, have found the information bit matrix structure that a kind of LDPC code word of HSS decoding algorithm is more suitable for than the prior art, and encoder, decoder using this LDPC code, and further cooperation improves check bit matrix, to improve the performance of LDPC code word.In addition, the present invention, which opens, discloses a kind of coding method for corresponding to above-mentioned S-IRA structure, encoder.
Description
Technical field
The present invention relates to a kind of LDPC code word and using encoder, the decoder, corresponding coding method of the code word, more
It says to body, is related to a kind of S-IRALDPC code word and corresponding encoder, decoder and coding method.
Background technique
Low density parity check codewords (Low density Parity Check, LDPC) can mainly divide according to its structure
For two classes, one kind is random code word, most classic to surely belong to MacKay code, and there are also the various code words that special webpage provides him for he
(MacKay 1999)(Richardson 2001)(Luby 2001)(Richardson and Urbanke 2001);Other one
Class is the code word designed based on algebraic combination structure (Combinatorial).Random code word can have very good approximation to Shannon
The limit, but due to the randomness of ' 1 ' distribution, lead to the design of encoder and the design of decoder and do not have parallel or rule
Rule property is feasible, so being not suitable for needing to have certain throughput systems, therefore is not also just widely used.
And the problem of appearance very good solution of the code word based on algebraic combination structure this respect, among these, there is one kind
Code word based on finite field (Finite Geometry) design has good performance (Y.Kou and S.Lin 2001), but
The shortcomings that being this kind of code word is since its H-matrix density is relatively high (big row rearranges weight), so being based on belief propagation when using
A kind of algorithm when, complexity is very high.And another kind of quasi-cyclic code word (Quasi-cyclic LDPC, QC-LDPC) is a kind of
The very important code word based on algebraic combination construction.The main construction of QC-LDPC code word is based on the sub- square of quasi-cyclic unit
Battle array.(J.L.Fan 2000)(R.M.Tanner 2001)(R.M.Tanner 2001)(T.Okamura 2003)
(R.M.Tanner 2004) this quasi-cyclic unit submatrix structure is very suitable to realize the hardware of parallel work-flow, than strictly according to the facts
Existing degree of parallelism is big and then the decoder of high-throughput.Traditional this QC-LDPC code word is although the decoder for being suitble to degree of parallelism high
It realizes, improves throughput, but may be not sparse by the generator matrix that reverse method has obtained QC structure, even if
It is sparse, encoded to obtain with generator matrix check bit be not it is obvious, to be obtained by seeking system of linear equations, therefore
The encoder of traditional QC-LDPC code word or relative complex.In order to solve this problem, scholar Zhang and Ryan be first
The repeat accumulated code (Structured Irregular Repeat Accumulator code, S-IRA) of the structuring of proposition
LDPC code word (Zhang and Ryan 2006), which, can be with very while being suitble to the realization of high parallel decoder
The method of simple and effective is completed to encode.This kind of codeword structure has following features, and matrix part corresponding to information bit is by standard
Submatrix is recycled to form, and what matrix part corresponding to check bit was made of bidiagonal matrix.
S-IRA code word has been widely used in major communication standard at present, mainly includes, and European second generation number is wide
It is serial (ETSI, 2006, DVBT2 2009, DVB-C22009, DVB-NGH 2012) to broadcast TV transmission standards DVB;IEEE
802.11n WLAN standard (IEEE 802.11n 2009);IEEE802.11e wireless wide area network standard (IEEE
802.16e 2006);China Digital TV ground transmission standard (DTTB) (GB20600-2006);Mobile multimedia broadcasting
(CMMB 2006);The near-earth deep space communication system (CCSDS 2007) of North America CCSDS;And the mark of some disk storage equipments
Standard etc..From the point of view of the developing state of entire international coverage digital communicating field, more standards are also had or in the future
Use LDPC code word.
From standard submitted at present, especially commercial extremely successful DVBT2, DVBS2 standard, and recently
From the point of view of just fixing standard and commercially having the DVB-NGH standard (end of the year 2012 final version) of bright prospects, the S-IRA code that uses
Check matrix master structure to be used corresponding to word is as follows:
H=[∏ H1 P]
Wherein H1It is the corresponding matrix part of information bit, ∏ is to H1A some form of row transformation, and P is school
Test the corresponding matrix part of bit.
And:
Be byThe circulation submatrix of size or 0 matrix composition.
For example, Pi,jThe first structure it is as follows:
At this point, Pi,jIt is made of two unit offset battle arrays.Further
Ground, Pi,jIt can also be and be made of N number of unit circle matrix, the integer of N > 2.
Pi,jSecond of structure it is as follows:
At this time Pi,jIt is made of full null matrix.
Due to Pi,jIt can be made of more than one unit circle battle array, it is caused to be not appropriate for HSS (Horizontal
Shuffle scheduling) decoding algorithm hardware implement.Have in the document of the implementation method of DVBT2 and S2 in this regard
It is much mentioned to, and proposes the relevant solution for sacrificing complexity.
And P is the corresponding matrix part of check bit, is following bidiagonal matrix:
Double diagonal arrangements due to last column degree of being ' 1 ' structure, i.e., last arrange only one 1, so will affect
The performance of entire LDPC code word.
Summary of the invention
The purpose of the present invention is intended to provide a kind of S-IRA LDPC code word and corresponding encoder, decoder and coding staff
Method, to solve to be not suitable for HSS brought by the structure of the check matrix of S-IRA LDPC code common in the art
(Horizontal shuffle scheduling) decoding algorithm influences the problem of entire LDPC code word performance.
According to above-mentioned purpose, implement a kind of S-IRA LDPC code word for codec of the invention, the knot of code word
Structure are as follows: H=[H '1∏ P '], H '1For information bit matrix, P ' is check bit matrix, and ∏ P ' is to do row to check bit matrix
Transformation.Wherein, information bit matrix H '1Including multiple circulation submatrix pi,j, each circulation submatrix can only be unit circle
Excursion matrix or full null matrix.
According to above-mentioned purpose, implements a kind of LDPC encoder of the invention, use a kind of LDPC code of S-IRA structure
Word, the structure of S-IRA LDPC code word are as follows: H=[H '1∏ P '], H '1For information bit matrix, P ' is check bit matrix, ∏ P '
It is that capable transformation is done to check bit matrix.Wherein, information bit matrix H '1Including multiple circulation submatrix pi,j, each circulation
Submatrix can only be unit circle excursion matrix or full null matrix.
According to above-mentioned purpose, implements a kind of LDPC decoder of the invention, use a kind of LDPC code of S-IRA structure
Word, the structure of S-IRA LDPC code word are as follows: H=[H '1∏ P '], H '1For information bit matrix, P ' is check bit matrix, ∏ P '
It is that capable transformation is done to check bit matrix.Wherein, information bit matrix H '1Including multiple circulation submatrix pi,j, each circulation
Submatrix can only be unit circle excursion matrix or full null matrix.
According to above-mentioned main feature, the information bit of inventive encoder, decoder and S-IRA LDPC code word therein
Matrix is m row × n-m column matrix:
Wherein each circulation submatrix
pi,jSize be
According to above-mentioned main feature, the check bit of inventive encoder, decoder and S-IRA LDPC code word therein
Matrix P ' is m row × m column matrix:It is on its leading diagonal and minor diagonal
1, and the first row of last column and row k are 1, remaining position is 0.
According to above-mentioned purpose, implement the coding method of S-IRA LDPC code word of the invention the following steps are included:
Obtain information bit { i1,i2,i3,i4,i5,...,in-m-1,in-m};
Initiation verification bit p1=0, p2=0, p3=0, p4=0 ..., pm=0;
By each check bit piAnd coupled information bit is 2 He of mould, i=0,1,2 ... m, and does again
Arrangement, the check bit sequence after being reset
By the check bit sequence after rearrangementIt does following cumulative:
According to above-mentioned purpose, implement LDPC coding method and encoder of the invention, wherein the coding fortune built in encoder
Calculate the coding method that module uses the LDPC comprising:
Computation of parity bitsWherein, m=0,1,2,3 ..., M-1;It indicates in low-density surprise
In even parity check matrix with pmAssociated information bit;ymIt is information bitSerial number, obtain according to the following formula:
Wherein, q=360, x indicate to participate in the address of the cumulative information bit of Parity Check Bits, the table of x are as follows:
9/15 code rate
12/15 code rate
It has found by a large amount of analogue simulations using technical solution of the present invention and is more suitable for HSS than the prior art
A kind of information bit matrix knot of the S-IRA LDPC code word of (Horizontal shuffle scheduling) decoding algorithm
Structure, and cooperation improves check bit matrix using encoder, the decoder of this S-IRA LDPC code, and further,
To produce the promotion in unexpected S-IRALDPC codeword performance.
Specific embodiment
Difference of HSS (the Horizontal Shuffle Scheduling) algorithm compared to flood (Flooding) algorithm
It is, Flooding algorithm is must be after all rows have operated, and obtained data are disposably updated, then
It uses in next iteration, and in HSS algorithm in certain an iteration, it can be immediately per the result obtained after operating line by line
It updates, uses still in the operation of row next time of current iteration, the convergence rate of decoding algorithm can be greatly improved in this way.
On the other hand, (m is check matrix for HSS algorithm only needs to save n (n is code length) Soft Inform ation sums data and m × 2
Line number) the result soft value information of row operation saves chip areas much more very compared to Flooding algorithm.
But existing HSS algorithm, when selection recycles sub-block, circulation sub-block is not usually unit sub-block, but two
Or more than two unit sub-blocks, this certainly will lead to the conflict of internal storage access during parallel work-flow.This is because such as
Fruit circulation sub-block is made of more than two unit sub-blocks, then there are two meetings when recycling sub-block when parallel-by-bit operates
Capable row operation input requires to read same memory simultaneously, and after having operated while writing same memory.This did not both have
There is the original intention for reaching HSS algorithm, also results in internal storage conflict.
Therefore, the shortcomings that being based on LDPC code word structure in existing standard, is the circulation in information bit matrix specifically
Submatrix may cause to be not suitable for the problem of HSS decoding algorithm is realized and check bit by being made of multiple circulating unit battle arrays
The structure of presence 1 in the double diagonal arrangements of corresponding matrix part and influence performance, the present invention proposes a kind of new S-IRA
The structure of the structure of LDPC code word, check matrix is as follows:
H=[H '1∏P′]
Wherein, H '1It is information bit matrix, P ' is check bit matrix, and ∏ P ' is one done to check bit matrix P '
A some form of row transformation.
Information bit matrix H '1It is a m row × n-m column matrix, specific structure is as follows:
In the present invention, information bit matrix H '1Including multiple circulation submatrix pi,j, H '1Each of the sub- square of circulation
Battle array pi,jSize beEach circulation submatrix can only be unit circle excursion matrix or full null matrix, i.e., here
H '1Be byThe unit circle excursion matrix of size or 0 matrix are constituted.Here unit circle is inclined
Shifting matrix, which refers to, recycles what offset to the right obtained by an equal amount of unit matrix.
According to above-mentioned pi,jThe restriction of structure is available, circulation submatrix p of the inventioni,jIt is only possible to be the following two kinds
Specific structure type:
P at this timei,jIt is made of unit circle excursion matrix.
2)P at this timei,jIt is to be made of full null matrix.
On the other hand, in order to cooperate information bit matrix H '1Structure, check bit matrix P ' of the invention is a m
The matrix of row × m column, specific structure are as follows:
Check bit matrix P ' is a kind of special dual-diagonal matrix it can be seen from above structure, is led on diagonal all
It is ' 1 ', is also ' 1 ' on minor diagonal, the first row and line k of last column of P ' is also ' 1 ', the rest part of each row, column
It is ' 0 ' on position.
In addition a kind of LDPC encoder is also disclosed in the present invention, what is used is exactly above-mentioned S-IRALDPC code word, specific next
It says, the specific structure of check matrix is:
H=[H '1∏ P '], wherein H '1For information bit matrix, P ' is check bit matrix, and ∏ P ' is to check bit
Matrix does capable transformation.Particularly, information bit matrix H '1Including multiple circulation submatrix pi,j, each circulation submatrix can only
It is unit circle excursion matrix or full null matrix.
In addition a kind of LDPC decoder is also disclosed in the present invention, what is used is exactly above-mentioned S-IRA LDPC code word, specifically
For, the specific structure of check matrix is:
H=[H '1∏ P '], wherein H '1For information bit matrix, P ' is check bit matrix, and ∏ P ' is to check bit
Matrix does capable transformation.Particularly, information bit matrix H '1Including multiple circulation submatrix pi,j, each circulation submatrix can only
It is unit circle excursion matrix or full null matrix.
Since encoder and decoder of the invention are all made of LDPC code word disclosed above, LDPC code word its
He discloses details characteristic in the above specification, and explanation is not repeated herein.
In addition, key step is as follows the invention also discloses the coding method of above-mentioned LDPC code word:
Step S1: obtaining information bit, and it is { i that known information bit, which is arranged,1,i2,i3,i4,i5,...,in-m-1,in-m,
So-called coding finds out check bit using check matrix H:
Step S2: initiation verification bit p1=0, p2=0, p3=0, p4=0 ..., pm=0;
Step S3: by each check bit piAnd coupled information bit does 2 He of mould, it may be assumed thatWith pi2 He of mould of connected information bit, wherein i=0,1,2 ... m.Later, by above-mentioned mould 2 and later
Check bit piIt rearranges:Thus the check bit sequence after being reset
Step S4: by the check bit sequence after rearrangementIt does following cumulative:
Finally obtain check bit sequence:
Technical solution disclosed in specification through the invention as it can be seen that the characteristics of S-IRA LDPC code word of the invention be
Circulation submatrix in its information bit matrix is only possible to be made of unit circle excursion matrix other than the structure of 0 matrix,
It is the technical characteristic based on circulation sub-block that the selection of this circulation submatrix, which has adapted to HSS algorithm parallel computation, therefore when circulation
Sub-block is required to read same memory simultaneously there is no the row operation input of two rows, also not deposited when parallel-by-bit operates
After having operated while same content is write, can be avoided internal storage conflict in this way.
On the other hand, the letter of S-IRA LDPC code of the present invention is constituted having selected 0 matrix or unit circle excursion matrix
It ceases except bit matrix, the present invention has also done check bit matrix and targetedly designed, and it is last to change check bit matrix
The column degree of one column.S-IRA LDPC code that information bit matrix and check bit matrix according to the present invention are constituted, using this
Encoder, the decoder of invention LDPC code can have preferable codeword performance in HSS algorithm.
In addition, invention additionally discloses a kind of coding method corresponding with above-mentioned S-IRA LDPC code word and encoders, and
And above structure can be corresponded to.Encoder is built-in with encoding operation module, and encoding operation module uses following LDPC
Coding method:
In encoding operation module, computation of parity bitsWherein, m=0,1,2,3 ..., M-1;
iymIndicate in low-density parity check (LDPC) matrix with pmAssociated information bit;ymIt is information bit iymSerial number, according to such as
Lower formula obtains:
Wherein, q=360, x indicate to participate in the address of the cumulative information bit of Parity Check Bits, the value of x such as 1 He of table
Shown in table 2:
Table 1, code rate 9/15
Table 2, code rate 12/15
Specifically, the code word of LDPC is enabled are as follows:
C=(i0,i1,...,ij,...,iK-1,p0,p1,...,pm,...,pM-1);Wherein, (i0,i1,...,im,...,
iK-1) it is information bit bit, it is known { 1,0 } sequence.(p0,p1,p2,...,pM-1) it is check bit, it is ratio to be calculated
It is special.
Each check bit corresponding to the check part is initialized first,
That is p0=0, p1=0, p2=0, p3=0, p4=0, p5=0 ..., pM-1=0, wherein each piRepresent check matrix
In a line, such as pmRepresent the m row in check matrix.
It is one group according to q bit for check bit to be grouped to obtain multiple check bit groups.
Specifically, firstly, it is { p that the check bit, which is arranged,0,p1,p2,p3,p4,p5,...,pM-1}.Then, by the school
It tests bit and is grouped in order with q bit for one group to obtain multiple check bit groups.
For example, check bit group are as follows:
{pjq+0,pjq+1,...,pjq+(q-1), wherein j value be (0,1,2 ..., Q-1), wherein
Secondly, by check bit and its associated information in low-density parity check (LDPC) matrix in each check bit group
Bit carries out accumulation process.
Specifically, to q bit p in each check bit groupmMake following XOR operation:
Wherein, m=0,1,2,3 ..., M-1;
Indicate in the low-density parity check (LDPC) matrix with pmAssociated information bit,
ymIt obtains according to the following formula:
Wherein, x indicates in each check bit group that first check bit (such as can be p0, pq+0, p2q+0...,
pjq+0...) and representated by the low-density parity check (LDPC) matrix in row (corresponding 0th, q, 2q, 3q ..., jq ... row) it is inner
The position of " 1 " column, but do not include the position of the column of " 1 " in the low-density parity check (LDPC) matrix in check part.
By taking the code word of table 1 as an example, q=360, check bit number M=25920, information bit K=38880, last column
The position of centre 1
The first row number in table 1:
67 544 1877 2470 7041 11989 15092 15986 20782 29954
Each number represents the first row (corresponding first check bit p in low-density parity check (LDPC) matrix0) in " 1 "
Position (position arranged), but this position does not include the column of " 1 " of the check part of low-density parity check (LDPC) matrix
Position.
In addition the number of the row is x, represents first bit p in first check bit block0Representative verification
The position (position arranged, column are equally started counting with 0) of " 1 " of the 0th row in matrix.
So have:
After finishing this, then had according to formula (1):
(1) for other rows according to above-mentioned formula and so on, it is numerous to list herein.
Interleaving treatment is made to each check bit after adding up later.
Specifically, comprising: interleaving treatment is made according to permutation format to each check bit after cumulative, wherein the displacement lattice
Formula is realized by following formula:
piQ'=pi;piQ+1'=pi+q;piQ+2'=pi+2q;piQ+3'=pi+3q;
piQ+4'=pi+4q,...,piQ+Q-1'=pi+(Q-1)q;
Wherein, i=0,1,2,3 ..., q-1.
For example,
p0'=p0;p1'=p0+q;p2'=p0+2q;p3'=p0+3q;
p4'=p0+4q,...,pQ-1'=p0+(Q-1)q;
pQ'=p1;pQ+1'=p1+q;pQ+2'=p1+2q;pQ+3'=p1+3q;
pQ+4'=p1+4q,...,p2Q-1'=p1+(Q-1)q;
p(q-1)Q'=pq-1;p(q-1)Q+1'=p(q-1)+q;p(q-1)Q+2'=p(q-1)+2q;
p(q-1)Q+3'=p(q-1)+3q;
p(q-1)Q+4'=p(q-1)+4q,...,p(q-1)Q+Q-1'=p(q-1)+(Q-1)q;
Wherein,
In the present embodiment, { p0,p1,p2,p3,p4,p5,...,pM-1Indicate the check bit before interweaving;
{p0',p1',p2',p3',p4',p5',...,pM-1' indicate the check bit after interweaving.
Each check bit after interleaving treatment is finally subjected to mould 2 plus operation to obtain final check bit.
Specifically, this step is realized by following formula:
Wherein,M is the number of check bit.
Obtained (p0',p1',...,pm',...,pM-1') it is check bit after final coding, it is finally obtained
LDPC code c=(i0,i1,...,ij,...,iK-1,p0',p1',...,pm',...,pM-1')。
Internal storage conflict when for solving the problems, such as LDPC code for HSS algorithm by sacrifice complexity in the prior art,
S-IRA LDPC code of the invention is set using the selection of the information bit matrix in the encoder of S-IRA LDPC code, decoder
Meter can generate unexpected technical effect, from codeword structure sheet, significantly reduce the complexity of HSS algorithm, solve
It has determined above-mentioned technical problem existing in the prior art.
It will be understood to one skilled in the art that above specification is only one of numerous embodiments of the present invention
Or several embodiments, and not use limitation of the invention.Any equivalent change for embodiment described above, modification with
And the technical solutions such as equivalent substitute will all fall in claims of the present invention as long as meeting spirit of the invention
In the range of protecting.
Claims (2)
1. a kind of coding method of LDPC code, which comprises the following steps:
Computation of parity bitsWherein, m=0,1,2,3 ..., M-1;It indicates in low-density checksum
In matrix with pmAssociated information bit;ymIt is information bitSerial number, obtain according to the following formula:
Wherein, m is the line number of check bit matrix, and q indicates LDPC coded sub-blocks size, and q=360, M are check bit number, x table
Show the address for participating in the cumulative information bit of Parity Check Bits, the table of x are as follows:
9/15 code rate, M=25920, code length 64800
12/15 code rate
The structure of the code word of the LDPC code are as follows:
H=[H '1∏ P '], wherein H '1For information bit matrix, P ' is check bit matrix, and ∏ P ' is to the check bit square
Battle array does capable transformation, in which:
The information bit matrix H '1Including multiple circulation submatrix Pi,j, each described circulation submatrix can only be that unit is followed
Ring excursion matrix or full null matrix;
The information bit matrix is m row × n-m column matrix:
Wherein each circulation submatrix Pi,j's
Size is
2. a kind of LDPC encoder, which is characterized in that the encoder includes:
Encoding operation module, to computation of parity bitsWherein, m=0,1,2,3 ..., M-1;Table
Show in low-density parity check (LDPC) matrix with pmAssociated information bit;ymIt is information bitSerial number, according to following public affairs
Formula obtains:
Wherein, m is the line number of check bit matrix, and q indicates LDPC coded sub-blocks size, and q=360, M are check bit number, x table
Show the address for participating in the cumulative information bit of Parity Check Bits, the table of x are as follows:
9/15 code rate, M=25920, code length 64800
12/15 code rate
The structure of LDPC code word corresponding with the LDPC encoder are as follows:
H=[H '1∏ P '], wherein H '1For information bit matrix, P ' is check bit matrix, and ∏ P ' is to the check bit square
Battle array does capable transformation, in which:
The information bit matrix H '1Including multiple circulation submatrix Pi,j, each described circulation submatrix can only be that unit is followed
Ring excursion matrix or full null matrix;
The information bit matrix is m row × n-m column matrix:
Wherein each circulation submatrix Pi,j's
Size is
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410011008.8A CN104779961B (en) | 2014-01-09 | 2014-01-09 | A kind of LDPC structure, code word and corresponding encoder, decoder and coding method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410011008.8A CN104779961B (en) | 2014-01-09 | 2014-01-09 | A kind of LDPC structure, code word and corresponding encoder, decoder and coding method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104779961A CN104779961A (en) | 2015-07-15 |
CN104779961B true CN104779961B (en) | 2019-02-26 |
Family
ID=53621236
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410011008.8A Active CN104779961B (en) | 2014-01-09 | 2014-01-09 | A kind of LDPC structure, code word and corresponding encoder, decoder and coding method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104779961B (en) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104821830B (en) * | 2014-02-05 | 2019-02-26 | 上海数字电视国家工程研究中心有限公司 | A kind of LDPC structure, code word and corresponding encoder, decoder and coding method |
CN107204777A (en) * | 2014-06-11 | 2017-09-26 | 上海数字电视国家工程研究中心有限公司 | The coding method of LDPC code and encoder |
KR20170060562A (en) | 2015-11-24 | 2017-06-01 | 삼성전자주식회사 | Apparatus and method for channel encoding/decoding in communication or broadcasting system |
WO2017091018A1 (en) | 2015-11-24 | 2017-06-01 | Samsung Electronics Co., Ltd. | Method and apparatus for channel encoding/decoding in a communication or broadcasting system |
CN109417392B (en) * | 2016-07-20 | 2021-10-15 | 华为技术有限公司 | Coding and decoding method and system of LDPC code |
CN108234066B (en) * | 2016-12-15 | 2020-12-15 | 华为技术有限公司 | Communication method and communication device based on LDPC |
CN109150192B (en) * | 2017-06-16 | 2023-02-28 | 上海交通大学 | LDPC code word structure and code word coding method |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1841073A1 (en) * | 2006-03-29 | 2007-10-03 | STMicroelectronics N.V. | Fast convergence LDPC decoding using BCJR algorithm at the check nodes |
CN102006085A (en) * | 2010-11-04 | 2011-04-06 | 北京理工大学 | Method for constructing eIRA-like quasi-cyclic low-density parity-check (LDPC) code check matrix |
CN102315899A (en) * | 2010-06-30 | 2012-01-11 | 中国科学院微电子研究所 | Quasi-cyclic decoding method for low-density parity check code |
CN102394660A (en) * | 2011-08-24 | 2012-03-28 | 中兴通讯股份有限公司 | Coding method of block interleaving quasi-cyclic extension parallel coded LDPC (Low Density Parity Check) codes and coder |
CN102437857A (en) * | 2011-12-12 | 2012-05-02 | 华中科技大学 | IRA-LDPC (irregular repeat-accumulate-low-density parity check) code construction method and encoder thereof |
CN102843145A (en) * | 2012-10-09 | 2012-12-26 | 浙江大学 | Construction method of low bit-rate quasi-cyclic accumulative repeat accumulate codes |
Family Cites Families (1)
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 |
-
2014
- 2014-01-09 CN CN201410011008.8A patent/CN104779961B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1841073A1 (en) * | 2006-03-29 | 2007-10-03 | STMicroelectronics N.V. | Fast convergence LDPC decoding using BCJR algorithm at the check nodes |
CN102315899A (en) * | 2010-06-30 | 2012-01-11 | 中国科学院微电子研究所 | Quasi-cyclic decoding method for low-density parity check code |
CN102006085A (en) * | 2010-11-04 | 2011-04-06 | 北京理工大学 | Method for constructing eIRA-like quasi-cyclic low-density parity-check (LDPC) code check matrix |
CN102394660A (en) * | 2011-08-24 | 2012-03-28 | 中兴通讯股份有限公司 | Coding method of block interleaving quasi-cyclic extension parallel coded LDPC (Low Density Parity Check) codes and coder |
CN102437857A (en) * | 2011-12-12 | 2012-05-02 | 华中科技大学 | IRA-LDPC (irregular repeat-accumulate-low-density parity check) code construction method and encoder thereof |
CN102843145A (en) * | 2012-10-09 | 2012-12-26 | 浙江大学 | Construction method of low bit-rate quasi-cyclic accumulative repeat accumulate codes |
Non-Patent Citations (1)
Title |
---|
"基于DVB-S2标准IRA-LDPC编译码算法的研究";陈兵;《万方数据库》;20100429;第15-19页 |
Also Published As
Publication number | Publication date |
---|---|
CN104779961A (en) | 2015-07-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104779961B (en) | A kind of LDPC structure, code word and corresponding encoder, decoder and coding method | |
CN107404322B (en) | Check matrix for low-code-rate LDPC code and LDPC codeword | |
CN105024703B (en) | Based on the long LDPC of quasi-cyclic middle short code and codec and coding method | |
AU2018295221A1 (en) | Design method and apparatus for quasi-cyclic low-density parity-check | |
CN107786210B (en) | Middle and high code rate LDPC code word structure and coding method for multi-point cooperative communication system | |
CN104821830B (en) | A kind of LDPC structure, code word and corresponding encoder, decoder and coding method | |
CN105871385B (en) | A kind of LDPC convolutional-code building method | |
CN106685432A (en) | Large girth type-II QC-LDPC code construction method based on complete cyclic difference sets | |
CN105322970B (en) | For the LDPC code word of next-generation radio broadcasting and coding method and codec | |
CN107204777A (en) | The coding method of LDPC code and encoder | |
Xiao et al. | Construction of good quasi-cyclic LDPC codes | |
CN105281784B (en) | For the LDPC code word of next-generation radio broadcasting and coding method and codec | |
CN105322971B (en) | For the LDPC code word of next-generation radio broadcasting and coding method and codec | |
CN108494411A (en) | A kind of building method of m-ary LDPC code check matrix | |
CN104426553A (en) | Encoding method for low-density parity check matrix | |
CN109150192B (en) | LDPC code word structure and code word coding method | |
CN105471440A (en) | LDPC codes for next generation of wireless broadcast and coding method and coder and decoder thereof | |
CN107465414A (en) | The coding method of LDPC code | |
CN105471442A (en) | Coding method for LDPC codes | |
CN113037297B (en) | LDPC codeword encoding method, encoding system and storage medium | |
CN107453760A (en) | The coding method of LDPC code | |
CN111371463B (en) | Code word encoding method, system and medium for LDPC code word structure | |
CN108400836A (en) | A kind of construction of long QC-LDPC codes of multi code Rate of Chinese character multi-code and coding method | |
Kumar et al. | Performance evaluation and complexity analysis of re-jagged AR4JA code over AWGN channel | |
Abu-Hudrouss | LDPC code construction using randomly permutated copies of parity check matrix |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
EXSB | Decision made by sipo to initiate substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
CB02 | Change of applicant information |
Address after: Room 1018, block B, No. three East Bridge Road, Pudong New Area, Shanghai, 200125, China Applicant after: Shanghai NERC-DTV National Engineering Research Center Co., Ltd. Address before: 200125 Shanghai East Road, Pudong New Area, No. three, No. 1018 Applicant before: Shanghai NERC-DTV National Engineering Research Center Co., Ltd. |
|
COR | Change of bibliographic data | ||
GR01 | Patent grant | ||
GR01 | Patent grant |