CN102412842B  The coded method of a kind of low density parity check code and device  Google Patents
The coded method of a kind of low density parity check code and device Download PDFInfo
 Publication number
 CN102412842B CN102412842B CN201010293323.6A CN201010293323A CN102412842B CN 102412842 B CN102412842 B CN 102412842B CN 201010293323 A CN201010293323 A CN 201010293323A CN 102412842 B CN102412842 B CN 102412842B
 Authority
 CN
 China
 Prior art keywords
 code
 matrix
 tx
 code word
 bit
 Prior art date
Links
 239000011159 matrix materials Substances 0.000 claims abstract description 298
 230000005540 biological transmission Effects 0.000 claims abstract description 84
 108010003272 hyaluronate lyase Proteins 0.000 claims abstract description 68
 230000000052 comparative effects Effects 0.000 claims abstract description 50
 238000000034 methods Methods 0.000 claims abstract description 22
Classifications

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
 H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
 H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
 H03M13/1102—Codes on graphs and decoding on graphs, e.g. lowdensity parity check [LDPC] codes
 H03M13/1148—Structural properties of the code paritycheck or generator matrix
 H03M13/116—Quasicyclic LDPC [QCLDPC] codes, i.e. the paritycheck matrix being composed of permutation or circulant submatrices

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/63—Joint error correction and other techniques
 H03M13/635—Error control coding in combination with rate matching

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/65—Purpose and implementation aspects
 H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
 H03M13/6516—Support of multiple code parameters, e.g. generalized ReedSolomon decoder for a variety of generator polynomials or Galois fields

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/65—Purpose and implementation aspects
 H03M13/6522—Intended application, e.g. transmission or communication standard
 H03M13/6527—IEEE 802.11 [WLAN]

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/65—Purpose and implementation aspects
 H03M13/6577—Representation or format of variables, register sizes or wordlengths and quantization
 H03M13/658—Scaling by multiplication or division

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/65—Purpose and implementation aspects
 H03M13/6577—Representation or format of variables, register sizes or wordlengths and quantization
 H03M13/6591—Truncation, saturation and clamping
Abstract
Description
Technical field
The present invention relates to digital communicating field, particularly relate to coded method and the device of a kind of low density parity check code.
Background technology
At present, digital communication system is conventional communication system. As it is shown in figure 1, digital communication system is made up of transmitting terminal, channel and receiving terminal, wherein, transmitting terminal generally includes the parts such as information source, source encoder, channel encoder and manipulator (or writing unit); Receiving terminal generally includes demodulator (or sensing element), channel decoder, source decoder and the stay of two nights; Channel (or storage medium) is there is between transmitting terminal and receiving terminal, and channel exists noise source in digital communication systems, and channel code chain (including channel decoding, modulation /demodulation etc.) is the most critical technology of whole digital communication physical layer, which determine the validity and reliability of digital communication system bottom transmission.
Channel encoder is to resist various noises and interference in transmitting procedure, by increasing redundancy artificially so that system has the ability automatically correcting mistake, thus the reliability of guarantee information transmission. Lowdensity checksum (LowDensityParityCheck, LDPC) code is that a class can use very sparse parity matrix or the linear block codes of bipartite graph definition, utilize its check matrix openness just, the coding and decoding of low complex degree could be realized, so that LDPC moves towards practical.
The parity check matrix H of one M × N defines each code word with Nbit and meets the constraint of M evenodd check collection, namely encodes in the Nbit code word obtained, and has the check bit of Mbit, the information bit of NM bit.If the parity check matrix H of LDPC code is (m_{b}×z)×(n_{b}× z) matrix, it is by m_{b}×n_{b}Individual matrix in block form is constituted, and each matrix in block form is the different powers of the basic permutation matrix of z × z, and when basic permutation matrix is unit matrix, they are all the cyclic shift matrices of unit matrix, as moved to right, have following form:
By such powerJust can uniquely identifying each matrix in block form, the power of unit matrix can represent with 0, and the power of null matrix represents with1. So, if replaced by its power by each matrix in block form of H, a m is just obtained_{b}×n_{b}Power matrix H_{b}. Here H is defined_{b}Being the basis matrix of H, H is called H_{b}Extended matrix. When actual coding, the columns=N/n of z=code length/basis matrix_{b}, it is called spreading factor. Such as, matrix
Can with the basis matrix H of following parameter z, 2 × 4_{b}Extend with the unit matrix of a basic permutation matrix that is z × z and obtain,
Z=3 and
Accordingly it is also possible to say that the encoder of LDPC code is by basis matrix H_{b}, spreading factor z and basic permutation matrix uniquely generated.
If for each different spreading factor, LDPC adopts a basis matrix, then for each different code length, the coder of LDPC code is required for one basis matrix of storage, when code length is a variety of, it is necessary to store a lot of basis matrix, it is necessary to consider the problems such as storage. Accordingly, it would be desirable to when realizing timevarying code length, in the certain limit of same code check, the LDPC code of multiple code length can use the basis matrix of same form, we call uniform based matrix this matrixDuring different code length, rightIt is modified and extends, it is possible to obtaining parity check matrix H so that the coder of generation goes for the occasion that code length is variable.
Wherein, correction is that the spreading factor utilizing different code length is to basis matrix H_{b}Or uniform based matrixIn nonnegative value be modified so that after correction, element value is less than the spreading factor value under this code length. This is because H_{b}OrIn element represent the power of basic permutation matrix, and basic permutation matrix, the i.e. unit matrix of z × z, every circulation primary, be equivalent to unit matrix ring shift right one, i.e. unit matrix ring shift right string, therefore foundation circulant matrix maximum cyclic shift z1 time; If circulated z time, obtain or unit matrix, it is equal to nothing and is circulated displacement. Correction algorithm has a variety of, for instance, it is possible to adopt delivery (mod), round (scale+floor) or round off (scale+round) etc., if P_{ij}Based on matrix H_{b}In ith row jth row nonnegative element, P_{ij}' for revised basis matrixIn ith row jth row nonnegative element, have:
For delivery (mod) algorithm:
For rounding (scale+floor) algorithm:
For (scale+round) algorithm that rounds off:
Wherein, z is the spreading factor that current code length is corresponding, i.e. the line number of block matrice of square or columns, z_{max}For maximum support code length N_{max}Corresponding spreading factor. Mod is modulo operation,For lower floor operation, Round is the operation that rounds up.
Such as, for the LDPC code of code length 1152 bit, if its basis matrix H_{b}Certain nonnegative element be 93, if the maximum code length of its support is 2304, basis matrix be sized to 12 × 24, to its result being modified be:
For delivery (mod) algorithm:
For rounding (scale+floor) algorithm:
For (scale+round) algorithm that rounds off:
The LDPC code of this specific code check variable code length is owing to having the basis matrix of same form, so completely can with an encoder/decoder, wherein the basis matrix of its same form can also be called uniform based matrix
Assume a LDPC code parity check matrix H be sized to (m_{b}×z)×(n_{b}× z), uniform based matrixBe sized to m_{b}×n_{b}, then female code code check R of this LDPC code support_{m}=(n_{b}m_{b})/n_{b};If the information block length of input is K ', after a series of process, obtain the code word bits to be transmitted that length is N ', then claim transmission code rate R_{tx}=K'/N'.
In IEEE802.16e, the code check of LDPC code support is 1/2,2/3,3/4,5/6, in the encoding scheme of existing LDPC code, generally adopt the LDPC encoder matrix H of different female code code check, to ensure that LDPC code has to a certain degree code check and performance flexibly, now, arise that four basis matrix H_{b}, hardware needs multiple LDPC coder, what can roll up hardware realizes cost; Or realize the coding and decoding of different code check with an encoder/decoder being suitable for multiple female code code check, but hardware designs can be extremely complex, can roll up hardwired cost equally.
Summary of the invention
In view of this, present invention is primarily targeted at the coded method that a kind of LDPC code is provided and device, it is achieved that the arbitrarily coding of the LDPC code of variable bit rate.
For reaching abovementioned purpose, the technical scheme is that and be achieved in that:
The coded method of a kind of lowdensity checksum LDPC code, described method comprises the steps:
Compare female code code check of uniform based matrix support and the size of transmission code rate, according to comparative result, it is determined that the length K ' of input information block bit;
The encoder matrix of LDPC code is determined according to uniform based matrix and spreading factor;
By the information block bit that the length received is K ', it is determined that information bit to be encoded;
Utilize described encoder matrix that information bit to be encoded carries out LDPC coding, and female code code word bits that coding is obtained processes, and obtains code word bits waiting for transmission.
Described method also includes: arrange uniform based matrix and the spreading factor of LDPC code.
Also include before the size of the described female code code check comparing uniform based matrix support and transmission code rate: receive current transmission code rate;
Described according to comparative result, it is determined that the length K ' of input information block bit is:
Work as R_{tx}≥R_{m}Time, it is determined that the length K ' of information block bit is (n_{b}m_{b}) × z; Work as R_{tx}< R_{m}Time, it is determined that the length of information block bit is K'=func (m_{b}×z×R_{tx}/(1R_{tx})) or K'=func (m_{b}×z/(1R_{tx}))m_{b}× z or K'=func (func (m_{b}×z/(1R_{tx}))×R_{tx});
Wherein, R_{tx}For transmission code rate, R_{m}For female code code check, m_{b}、n_{b}The respectively line number of uniform based matrix and columns, z is spreading factor, and func (x) is the one of number, downward round numbers or round numbers of rounding off that x is rounded up.
Described according to uniform based matrix and spreading factor, it is determined that the encoder matrix of LDPC code is:
Uniform based matrix is modified, according to spreading factor z, utilizes the unit matrix of z × z to be extended revising the basis matrix obtained, obtain the encoder matrix of LDPC code.
Described by the information block bit that the length received is K ', it is determined that information bit to be encoded is:
Work as R_{tx}≥R_{m}Time, by the information block bit that length is K ' that receives directly as information bit to be encoded; Work as R_{tx}< R_{m}Time, in the information block bit that length is K ', add filling bit, forming length is k_{b}The information bit to be encoded of × z.
Described female code code word bits that coding is obtained carries out process and is:
Female code code word that coding is obtained is reset, and the female code code word bits before wherein resetting is A_{0},A_{1},…,A_{nb×z1}, the female code code word bits after rearrangement is B_{0},B_{1},…,B_{nb×z1}, rearrangement formulae is:
Wherein, k_{b}=n_{b}m_{b}, PV represents that code word resets vector, and its element set is { n_{b}m_{b},n_{b}m_{b}+1,n_{b}m_{b}+2,…,n_{b}1}, PV (x) represent that in PV vector, index is the element of x, and x is nonnegative integer;
Work as R_{tx}≥R_{m}Time, the female code code word bits B after rearrangement_{0},B_{1},…,B_{nb×z1}Func (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission;
Work as R_{tx}< R_{m}Time, the described k that will add_{b}× zK' filling bit is from the female code code word bits B after resetting_{0},B_{1},…,B_{nb×z1}In systematic bits in delete, remaining female code code word bits is as code word bits waiting for transmission.
Described determine LDPC code encoder matrix be:
Uniform based matrix is modified, according to spreading factor z, utilizes the unit matrix of z × z to be extended revising the basis matrix obtained, obtain the extended matrix of LDPC code;
Work as R_{tx}≥R_{m}Time, using the extended matrix encoder matrix as LDPC code; Work as R_{tx}< R_{m}Time, intercept the func (m on the right of extended matrix_{b}×z/(1R_{tx})) row, the matrix that the obtains encoder matrix as LDPC code will be intercepted; Or,
WhenDuring for positive integer, uniform based matrix is modified, obtains revised basis matrix;
Work as R_{tx}≥R_{m}Time, according to spreading factor z, utilize the unit matrix of z × z to be extended revising the basis matrix obtained, obtain the encoder matrix of LDPC code; Work as R_{tx}< R_{m}Time, intercept the k ' on the right of revised basis matrix_{b}+m_{b}Row, according to spreading factor z, utilize the unit matrix of z × z to be extended intercepting the matrix obtained, obtain the encoder matrix of LDPC code.
Described by the information block bit that the length received is K ', it is determined that information bit to be encoded is: by information block bit that length is K ' directly as information bit to be encoded.
Described female code code word bits that coding is obtained carries out process and is:
Female code code word that coding is obtained is reset, and the female code code word bits before wherein resetting isFemale code code word bits after rearrangement isRearrangement formulae is:
Wherein,PV represents that code word resets vector, and its element set isPV (x) represents that in PV vector, index is the element of x, and x is nonnegative integer, whereinRepresent number that x is rounded up;
Work as R_{tx}≥R_{m}Time, the female code code word bits after rearrangementFunc (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission;
Work as R_{tx}< R_{m}Time, directly by from reset after female code code word bitsAs code word bits waiting for transmission.
A kind of code device of LDPC code, including coding unit, described device also includes: comparing unit, packet bit determine that unit, encoder matrix determine that unit, information bit determine unit and code word processing unit; Wherein,
Comparing unit, the size of female code code check with transmission code rate for comparing the support of uniform based matrix;
Packet bit determines unit, for the comparative result according to comparing unit, it is determined that the length K ' of input information block bit;
Encoder matrix determines unit, for determining the encoder matrix of LDPC code according to uniform based matrix and spreading factor;
Information bit determines unit, obtains, for reception, the information block bit that length is K ', and determines information bit to be encoded, is transmitted to coding unit;
Code word processing unit, the female code code word obtained for coding unit carries out LDPC coding processes, and obtains code word bits waiting for transmission.
Described device also includes: arrange unit, for arranging uniform based matrix and the spreading factor of LDPC code.
Described device also includes input block, for receiving current transmission code rate;
Described packet bit determines that unit is specifically for being R when the comparative result of comparing unit_{tx}≥R_{m}Time, it is determined that the length K ' of information block bit is (n_{b}m_{b}) × z;When the comparative result of comparing unit is R_{tx}< R_{m}Time, it is determined that the length of information block bit is K'=func (m_{b}×z×R_{tx}/(1R_{tx})) or K'=func (m_{b}×z/(1R_{tx}))m_{b}× z or K'=func (func (m_{b}×z/(1R_{tx}))×R_{tx}); Wherein, R_{tx}For transmission code rate, R_{m}For female code code check, m_{b}、n_{b}The respectively line number of uniform based matrix and columns, z is spreading factor, and func (x) is the one of number, downward round numbers or round numbers of rounding off that x is rounded up.
Described encoder matrix determines that unit is specifically for being modified described uniform based matrix, according to spreading factor z, utilizes the unit matrix of z × z to be extended revising the basis matrix obtained, obtains the encoder matrix of LDPC code.
Described information bit determines that unit is specifically for being R when the comparative result of comparing unit_{tx}≥R_{m}Time, by the information block bit that length is K ' that receives directly as information bit to be encoded; When the comparative result of comparing unit is R_{tx}< R_{m}Time, in the information block bit that length is K ', add filling bit, forming length is k_{b}The information bit to be encoded of × z.
Described code word processing unit is reset specifically for female code code word that coding unit coding is obtained, and the female code code word bits before wherein resetting is A_{0},A_{1},…,A_{nb×z1}, the female code code word bits after rearrangement is B_{0},B_{1},…,B_{nb×z1}, rearrangement formulae is:
Wherein, k_{b}=n_{b}m_{b}, PV represents that code word resets vector, and its element set is { n_{b}m_{b},n_{b}m_{b}+1,n_{b}m_{b}+2,…,n_{b}1}, PV (x) represent that in PV vector, index is the element of x, and x is nonnegative integer;
When the comparative result of comparing unit is R_{tx}≥R_{m}Time, the female code code word bits B after rearrangement_{0},B_{1},…,B_{nb×z1}Func (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission;
When the comparative result of comparing unit is R_{tx}< R_{m}Time, the described k that will add_{b}× zK' filling bit is from the female code code word bits B after resetting_{0},B_{1},…,B_{nb×z1}In systematic bits in delete, remaining female code code word bits is as code word bits waiting for transmission.
Described encoder matrix determines that unit is specifically for being modified uniform based matrix, according to spreading factor z, utilizes the unit matrix of z × z to be extended revising the basis matrix obtained, obtains the extended matrix of LDPC code; When the comparative result of comparing unit is R_{tx}≥R_{m}Time, using the extended matrix encoder matrix as LDPC code; When the comparative result of comparing unit is R_{tx}< R_{m}Time, intercept the func (m on the right of extended matrix_{b}×z/(1R_{tx})) row, the matrix that the obtains encoder matrix as LDPC code will be intercepted; OrDuring for positive integer, uniform based matrix is modified, obtains revised basis matrix; When the comparative result of comparing unit is R_{tx}≥R_{m}Time, according to spreading factor z, utilize the unit matrix of z × z to be extended revising the basis matrix obtained, obtain the encoder matrix of LDPC code; When the comparative result of comparing unit is R_{tx}< R_{m}Time, intercept the k ' on the right of revised basis matrix_{b}+m_{b}Row, according to spreading factor z, utilize the unit matrix of z × z to be extended intercepting the matrix obtained, obtain the encoder matrix of LDPC code.
Described information bit determine unit specifically for the information block bit that length is K ' that will receive directly as information bit to be encoded.
Described code word processing unit is reset specifically for female code code word that coding unit is obtained, and the female code code word bits before wherein resetting isFemale code code word bits after rearrangement isRearrangement formulae is:
Wherein,PV represents that code word resets vector, and its element set isPV (x) represents that in PV vector, index is the element of x, and x is nonnegative integer;
When the comparative result of comparing unit is R_{tx}≥R_{m}Time, the female code code word bits after rearrangementFunc (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission;
When the comparative result of comparing unit is R_{tx}< R_{m}Time, directly by from reset after female code code word bitsAs code word bits waiting for transmission.
The coded method of LDPC code provided by the invention and device, determine a basis matrix and spreading factor, the determination of input information block length or the process of encoder matrix is carried out according to the transmission code rate received, it is met the code word of aforementioned transmission code check, the basis of best performance achieves the transmutability of code check, reduce the complexity of hardware designs during for realizing different code check, and realize less costly.
Accompanying drawing explanation
Fig. 1 is the structured flowchart of digital communication system;
Fig. 2 be the coded method of LDPC code provided by the invention realize schematic flow sheet;
Fig. 3 is the schematic flow sheet of the embodiment one of the coded method of LDPC code provided by the invention;
Fig. 4 is the schematic flow sheet of the embodiment two of the coded method of LDPC code provided by the invention;
Fig. 5 is the structured flowchart of the code device of LDPC code provided by the invention.
Detailed description of the invention
The basic thought of the present invention is: compare female code code check of uniform based matrix support and the size of transmission code rate, according to comparative result, it is determined that the length K ' of input information block bit; The encoder matrix of LDPC code is determined according to uniform based matrix and spreading factor; By the information block bit that the length received is K ', it is determined that information bit to be encoded; Utilize described encoder matrix that information bit to be encoded carries out LDPC coding, and female code code word bits that coding is obtained processes, and obtains code word bits waiting for transmission.
For making the object, technical solutions and advantages of the present invention clearly understand, by the following examples also with reference to accompanying drawing, the present invention is described in more detail.
Fig. 2 illustrates the flow process of the coded method of LDPC code provided by the invention, as in figure 2 it is shown, described method comprises the steps:
S201, receives the uniform based matrix of the LDPC code of the fixed size that user determinesWith spreading factor z;
In this step, user can determine one according to the actual requirements and be sized to m_{b}×n_{b}Uniform based matrixWith largest extension factor z_{max}, wherein m_{b}、n_{b}、z_{max}For positive integer, make k_{b}=n_{b}m_{b}, then obtainThe female code code check supported is R_{m}=(n_{b}m_{b})/n_{b}=k_{b}/n_{b}; And determine spreading factor z according to digital communication system coding code length in the transmission, and usually, realizing for the ease of hardware, spreading factor z is generally the positive integer times of the power of 2 or the power of 2.
S202, receives current transmission code check R_{tx}, compare R_{tx}And R_{m}Size, according to comparative result, it is determined that input information block bit length K ';
In this step, work as R_{tx}≥R_{m}Time, then the length K'=k of information block bit_{b}× z=(n_{b}m_{b}) × z; Work as R_{tx}< R_{m}Time, then encode the m of generation_{b}The check bit of × z all can be transmitted, and therefore the length K ' of information block bit can by check bit length m_{b}× z and transmission code rate R_{tx}Determine, therefore K ', m_{b}× z and R_{tx}Relation can be, but not limited to represent by below equation:
S203, according to spreading factor z andDetermine the encoder matrix H of LDPC code_{bz};
In this step, first with abovementioned correction algorithm and z pairIt is modified, obtains revised basis matrixAccording toExtend with the unit matrix of z and z × z and obtain (m_{b}×z)×(n_{b}× z) LDPC matrixBoth can be by the present inventionEncoder matrix H as LDPC code_{bz}, it is also possible to according to R_{tx}And R_{m}Comparative result, rightIntercept, obtain the encoder matrix H of LDPC code_{bz}。
S204, by the information block bit that the length received is K ', it is determined that information bit to be encoded;
Specifically, according to encoder matrix H_{bz}Size and R_{tx}And R_{m}Comparative result, information block bit is processed, obtains information bit to be encoded.
S205, by encoder matrix H_{bz}Information bit to be encoded is carried out LDPC coding, obtains female code code word bits, female code code word bits is processed, obtains code word bits waiting for transmission.
Specifically, according to transmission code rate R_{tx}May determine that the length of code word bits waiting for transmission, the length according to the code word bits waiting for transmission determined, female code code word is reset, shortens or punctured obtain code word bits waiting for transmission.
What Fig. 3 illustrated the embodiment one of the coded method of LDPC code provided by the invention realizes flow process, as it is shown on figure 3, described method comprises the steps:
S301～S302, receives the uniform based matrix of the LDPC code of the fixed size that user determinesWith largest extension factor z_{max}, and determine spreading factor z according to required coding code length, then perform S305;
In this step, user can determine one according to the actual requirements and be sized to m_{b}×n_{b}Uniform based matrixWith largest extension factor z_{max}, wherein m_{b}、n_{b}、z_{max}For positive integer, make k_{b}=n_{b}m_{b}, then obtainThe female code code check supported is R_{m}=(n_{b}m_{b})/n_{b}=k_{b}/n_{b}; And determine spreading factor z according to the coding code length that digital communication system is required in the transmission, and usually, realizing for the ease of hardware, spreading factor z is generally the positive integer times of the power of 2 or the power of 2.
S303～S304, receives current transmission code check R_{tx}, compare R_{tx}And R_{m}Size, according to comparative result, it is determined that input information block bit length K ';
In this step, work as R_{tx}≥R_{m}Time, then the length K'=k of information block bit_{b}× z=(n_{b}m_{b}) × z; Work as R_{tx}< R_{m}Time, then encode the m of generation_{b}The check bit of × z all can be transmitted, and therefore the length K ' of information block bit can by check bit length m_{b}× z and transmission code rate R_{tx}Determine, therefore K ', m_{b}× z and R_{tx}Relation can be, but not limited to represent by below equation:
S305, to uniform based matrixIt is modified, utilizes z extension to obtain the encoder matrix H of LDPC code_{bz}, then perform S308;
In this step, first with abovementioned correction algorithm and z pairIt is modified, obtains revised basis matrixAccording toExtend with the unit matrix of z and z × z and obtain (m_{b}×z)×(n_{b}× z) LDPC matrixAnd by matrixEncoder matrix H as LDPC code_{bz}。
S306～S307, by the information block bit that the length received is K ', it is determined that information bit to be encoded;
Specifically, R is worked as_{tx}≥R_{m}Time, by information block bit that the length of reception is K ' directly as information bit to be encoded; Work as R_{tx}< R_{m}Time, in the information block bit that length is K ', add filling bit, forming length is k_{b}The information bit to be encoded of × z, wherein add the method for filling bit can be before information block bit, below or the mode such as alternate, the length of filling bit is k_{b}× zK', it addition, in order to subsequent treatment is convenient, the k of filling_{b}× zK' bit is preferably full 0 bit, it is also possible to for complete 1 bit.
S308～S309, by (m_{b}×z)×(n_{b}× z) encoder matrix H_{bz}Information bit to be encoded is carried out LDPC coding, obtains female code code word bits, female code code word bits is processed, obtains code word bits waiting for transmission.
Specifically, by encoder matrix H_{bz}LDPC coding, obtaining female code bit lengths is N=n_{b}× z, the wherein front k of female code code word bits_{b}× z bit is systematic bits, rear m_{b}× z bit is check bit.
In order to improve the reliability of codeword transmission, it is possible to first the female code code word bits obtained is carried out code word rearrangement, it is assumed that the female code code word bits before rearrangement is A_{0},A_{1},…,A_{nb×z1}, the female code code word bits after code word rearrangement is B_{0},B_{1},…,B_{nb×z1}, then code word is reset and is represented by equation below:
Wherein, PV represents that code word resets vector, and PV includes m_{b}Individual different element, its element set is { n_{b}m_{b},n_{b}m_{b}+1,n_{b}m_{b}+2,…,n_{b}1}, and each element is different, and PV (x) represents that in PV vector, index is the element of x, and wherein x is nonnegative integer.
Work as R_{tx}≥R_{m}Time, carry out punctured operation, namely the female code code word bits B obtained after rearrangement_{0},B_{1},…,B_{nb×z1}Func (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission, wherein func (x) can represent the one of x is rounded up number, downward round numbers or round numbers of rounding off, and specifically according to actual applicable cases, func (x) can select suitable operation.
Work as R_{tx}< R_{m}Time, carry out shortening operation, the k that will add in S304_{b}Female code code word bits B that × zK' filling bit obtains after rearrangement_{0},B_{1},…,B_{nb×z1}In systematic bits in delete (for the carrying out of deletion action herein, being therefore preferably filled with bit in S304 is full 0 or complete 1 bit), remaining female code code word bits is as code word bits waiting for transmission.
Below in conjunction with example, the embodiment one of the coded method of LDPC code is specifically described:
Example one:
1, the uniform based matrix of the LDPC code of 4 × 24 that user determines is receivedWith largest extension factor z_{max}, wherein z_{max}=96,As follows:
M can be drawn_{b}=4, n_{b}=24, k_{b}=n_{b}m_{b}=244=20,The female code code check supported is R_{m}=(n_{b}m_{b})/n_{b}=k_{b}/n_{b}=20/24=5/6=0.833, separately for the ease of the coding code length of realization and actual demand, it is determined that spreading factor z=3 × 2^{5}=96.
2, current transmission code rate R is received_{tx}=0.78, compare R_{tx}And R_{m}Size, due to 0.78 < 0.833, therefore can pass through K'=ceil (m_{b}×z/(1R_{tx}))m_{b}× z, trying to achieve K ' is 1362, and wherein ceil (x) represents number that x is rounded up.
3, unified basis matrix is revised by rounding (scale+floor) algorithm and spreading factor zObtain revised basis matrixAs follows:
According toThe LDPC matrix obtaining (4 × 96) × (24 × 96) is extended with the unit matrix of z=96 and z × zAnd by matrixEncoder matrix H as LDPC code_{bz}。
4, the information block bit that length is K ' is received, due to 0.78 < 0.833, i.e. R_{tx}< R_{m}, it is k by length_{b}× zK'=558 full 0 bit padding is before the information block bit that length is K ', and obtaining length is k_{b}The information bit to be encoded of × z=1920.
5, by the H of (4 × 96) × (24 × 96)_{bz}It is k to length_{b}The information bit to be encoded of × z=1920 carries out LDPC coding, and obtaining length is N=n_{b}Female code code word bits of × z=2304, wherein front 1920 bits are systematic bits, and rear 384 bits are check bit.
Female code code word bits is carried out code word rearrangement, it is assumed that the female code code word bits before rearrangement is A_{0},A_{1},…,A_{2303}, the female code code word bits after code word rearrangement is B_{0},B_{1},…,B_{2303}, then code word is reset and is represented by equation below:
Wherein, PV represents that code word resets vector, PV={20,21,22,23}.Again due to 0.78 < 0.833, i.e. R_{tx}< R_{m}, by 558 the full 0 bits being filled in 4 before information block bit from female code code word bits B of obtaining after resetting_{0},B_{1},…,B_{2303}In systematic bits in delete, remaining female code code word bits B_{558},B_{559}..., B_{2303}As code word bits waiting for transmission.
Example two:
1, the uniform based matrix of the LDPC code of 4 × 24 that user determines is receivedWith largest extension factor z_{max}, wherein z_{max}=96,As follows:
M can be obtained_{b}=4, n_{b}=24, k_{b}=n_{b}m_{b}=244=20,The female code code check supported is R_{m}=(n_{b}m_{b})/n_{b}=k_{b}/n_{b}=20/24=5/6=0.833, separately for the ease of realizing, it is determined that spreading factor z=2^{6}=64.
2, current transmission code rate R is received_{tx}=0.875, compare R_{tx}And R_{m}Size, due to 0.875 > 0.833, therefore information block length K'=k_{b}× z=1280.
3, unified basis matrix is revised by rounding (scale+floor) algorithm and spreading factor zObtain revised basis matrixAs follows:
According toThe LDPC matrix obtaining (4 × 64) × (24 × 64) is extended with the unit matrix of z=64 and z × zAnd by matrixEncoder matrix H as LDPC code_{bz}。
4, the information block bit that length is K '=1280 is received, due to 0.875 > 0.833, it is K'=k by length_{b}× z=1280 information block bit is directly as information bit to be encoded.
5, by the H of (4 × 64) × (24 × 64)_{bz}It is K'=k to length_{b}The information bit to be encoded of × z=1280 carries out LDPC coding, and obtaining length is N=n_{b}Female code code word bits of × z=1536, wherein front 1280 bits are systematic bits, and rear 256 bits are check bit.
Female code code word bits is carried out code word rearrangement, it is assumed that the female code code word bits before rearrangement is A_{0},A_{1},…,A_{1535}, the female code code word bits after code word rearrangement is B_{0},B_{1},…,B_{1535}, then code word is reset and is represented by equation below:
Wherein, PV represents that code word resets vector, PV={20,21,22,23}. Again due to 0.875 > 0.833, belong to R_{tx}≥R_{m}, the female code code word bits B obtained will be reset_{0},B_{1},…,B_{1535}Floor (K'/R is taken from small to large successively according to index_{tx})=1462 bit, namely B_{0},B_{1},…,B_{1461}As code word bits waiting for transmission, wherein, floor (x) represents the downward round numbers of x.
What Fig. 4 illustrated the embodiment two of the coded method of LDPC code provided by the invention realizes flow process, and as shown in Figure 4, described method comprises the steps:
S401～S402, receives the uniform based matrix of the LDPC code of the fixed size that user determinesWith largest extension factor z_{max}, and determine spreading factor z according to required coding code length;
In this step, user can determine one according to the actual requirements and be sized to m_{b}×n_{b}Uniform based matrixWith largest extension factor z_{max}, wherein m_{b}、n_{b}、z_{max}For positive integer, make k_{b}=n_{b}m_{b}, then obtainThe female code code check supported is R_{m}=(n_{b}m_{b})/n_{b}=k_{b}/n_{b}; And determine spreading factor z according to digital communication system coding code length in the transmission, and usually, realizing for the ease of hardware, spreading factor z is generally the positive integer times of the power of 2 or the power of 2.
S403, receives current transmission code check R_{tx}, then perform S404 and S405 respectively.
S404, compares R_{tx}And R_{m}Size, according to comparative result, it is determined that input information block bit length K ', then perform S406;
In this step, work as R_{tx}≥R_{m}Time, then the length K'=k of information block bit_{b}× z=(n_{b}m_{b}) × z; Work as R_{tx}< R_{m}Time, then encode the m of generation_{b}The check bit of × z all can be transmitted, and therefore information block length K ' can by check bit length m_{b}× z and transmission code rate R_{tx}Determine, therefore K ', m_{b}× z and R_{tx}Relation can be, but not limited to represent by below equation:
S405, to uniform based matrixIt is modified, it is determined that the encoder matrix H of LDPC code_{bz}, then perform S407;
In this step, first with abovementioned correction algorithm and z pairIt is modified, obtains revised basis matrixAccording toExtend with the unit matrix of z and z × z and obtain (m_{b}×z)×(n_{b}× z) LDPC extended matrix
Work as R_{tx}≥R_{m}Time, then by extended matrixEncoder matrix H as LDPC code_{bz}; Work as R_{tx}< R_{m}Time, by interceptingFunc (the m on the right_{b}×z/(1R_{tx})) row, it is sized to (m_{b}×z)×func(m_{b}×z/(1R_{tx})) encoder matrix H_{bz}. AgainTherefore, the encoder matrix H of now LDPC code_{bz}Be sized to (m_{b}×z)×(K'+m_{b}×z)。
It addition, work asDuring for positive integer, to uniform based matrix in this stepIt is modified obtainingAfter, it is also possible to according to R_{tx}And R_{m}Comparative result, to revised basis matrixAfter processing, utilize spreading factor z to be extended, obtain the encoder matrix H of LDPC code_{bz}。
Specifically, R is worked as_{tx}≥R_{m}Time, to revised basis matrixIt is extended, obtains encoder matrix H_{bz}, concrete and said method obtains encoder matrix H_{bz}Process identical, repeat no more;
Work as R_{tx}< R_{m}Time, by interceptingThe k ' on the right_{b}+m_{b}Row, obtain being sized to m_{b}×(k′_{b}+m_{b}) matrixAccording toWith spreading factor z, extension obtains (m_{b}×z)×((k′_{b}+m_{b}) × z) the encoder matrix H of LDPC code_{bz}. Again in S403, work as R_{tx}< R_{m}Time,AgainFor positive integer, therefore can obtain,
S406, receives the information block bit that length is K ', and by information block bit directly as information bit to be encoded;
S407～S408, by encoder matrix H_{bz}Information bit to be encoded is carried out LDPC coding, obtains female code code word bits, female code code word bits is processed, obtains code word bits waiting for transmission.
Specifically, R is worked as_{tx}≥R_{m}Time, by being sized to (m_{b}×z)×(n_{b}× z) the encoder matrix matrix H of LDPC code_{bz}Information bit to be encoded is carried out LDPC coding, and the length of the female code code word bits obtained is N=K'+m_{b}× z=n_{b}× z, wherein front K' the bit of female code code word bits is systematic bits, rear m_{b}× z bit is check bit, and wherein, information bit length to be encoded is K'=k_{b}× z=(n_{b}m_{b})×z。
In order to improve the reliability of codeword transmission, first the female code code word bits obtained is carried out code word rearrangement, it is assumed that the female code code word bits before rearrangement isFemale code code word bits after code word rearrangement isThen code word is reset and is represented by equation below:
Wherein,PV represents that code word resets vector, and PV comprises m_{b}Individual different element, its element set isAnd each element is different, PV (x) represents that in PV vector, index is the element of x, and wherein x is nonnegative integer.
Work as R_{tx}≥R_{m}Time, carry out punctured operation, namely the female code code word bits obtained after rearrangementFunc (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission, namelyFor code word bits waiting for transmission. Wherein func (x) can represent the one of x is rounded up number, downward round numbers or round numbers of rounding off, and specifically according to actual applicable cases, func (x) can select suitable operation.
Work as R_{tx}< R_{m}Time, owing to S403 obtaining encoder matrix H_{bz}Process has been carried out intercept operation, therefore the female code code word bits that can obtain after resettingAs code word bits waiting for transmission.
Below in conjunction with example, the embodiment two of the coded method of LDPC code is specifically described:
Example three:
1, the uniform based matrix of the LDPC code of 6 × 24 that user determines is receivedWith largest extension factor z_{max}, wherein z_{max}=96,As follows:
M can be drawn_{b}=6, n_{b}=24, k_{b}=n_{b}m_{b}=246=18,The female code code check supported is R_{m}=(n_{b}m_{b})/n_{b}=k_{b}/n_{b}=18/24=3/4=0.75, separately for the ease of the coding code length of realization and actual demand, it is determined that spreading factor z=3 × 2^{5}=96.
2, current transmission code rate R is received_{tx}=0.9, compare R_{tx}And R_{m}Size, due to 0.9 > 0.75, therefore information block length K'=k_{b}× z=1728.
3, unified basis matrix is revised by rounding (scale+floor) algorithm and spreading factor zObtain revised basis matrixAs follows:
According toThe LDPC matrix obtaining (6 × 96) × (24 × 96) is extended with the unit matrix of z=96 and z × zAgain 0.9 > 0.75, then by matrixEncoder matrix H as LDPC code_{bz}。
4, receive the information block bit that length is K '=1728, and be K'=k by length_{b}× z=1728 information block bit is directly as information bit to be encoded.
5, by the H of (6 × 96) × (24 × 96)_{bz}It is K'=k to length_{b}The information bit to be encoded of × z=1728 carries out LDPC coding, and obtaining length is N=K'+m_{b}× z=n_{b}Female code code word bits of × z=2304, wherein front 1728 bits are systematic bits, and rear 576 bits are check bit.
Female code code word bits is carried out code word rearrangement, it is assumed that the female code code word bits before rearrangement is A_{0},A_{1},…,A_{2303}, the female code code word bits after code word rearrangement is B_{0},B_{1},…,B_{2303}, then code word is reset and is represented by equation below:
Wherein,PV represents that code word resets vector, PV={18,19,20,21,22,23}. Again due to 0.9 > 0.75, belong to R_{tx}≥R_{m}, the female code code word bits B obtained will be reset_{0},B_{1},…,B_{2303}Ceil (K'/R is taken from small to large successively according to index_{tx})=1920 bit, namely B_{0},B_{1},…,B_{1919}As code word bits waiting for transmission, wherein, ceil (x) represents number that x is rounded up.
Example four:
1, the uniform based matrix of the LDPC code of 6 × 24 that user determines is receivedWith largest extension factor z_{max}, wherein z_{max}=96,As follows:
M can be drawn_{b}=6, n_{b}=24, k_{b}=n_{b}m_{b}=246=18,The female code code check supported is R_{m}=(n_{b}m_{b})/n_{b}=k_{b}/n_{b}=18/24=3/4=0.75, separately for the ease of the coding code length of realization and actual demand, it is determined that spreading factor z=2^{6}=64.
2, current transmission code rate R is received_{tx}=0.6, compare R_{tx}And R_{m}Size, due to 0.6 < 0.75, therefore can pass through K'=ceil (m_{b}×z/(1R_{tx}))m_{b}× z, trying to achieve K ' is 576, and wherein ceil (x) represents number that x is rounded up.
3, unified basis matrix is revised by rounding (scale+floor) algorithm and spreading factor zObtain revised basis matrixAs follows:
According toThe LDPC matrix obtaining (6 × 64) × (24 × 64) is extended with the unit matrix of z=64 and z × zAgain due to 0.6 < 0.75, therefore interceptCeil (the m on the right_{b}×z/(1R_{tx}))=960 row, it is sized to the encoder matrix H of (6 × 64) × 960_{bz}。
It addition, this step can also so process: obtain revised basis matrixAgain due to 0.6 < 0.75,InterceptThe k ' on the right_{b}+m_{b}=9+6=15 arranges, and obtains being sized to the matrix of 6 × (9+6)According toThe LDPC encoder matrix H obtaining (6 × 64) × (15 × 64) is extended with the unit matrix of z=64 and z × z_{bz}。
4, the information block bit that length is K ' is received, and by information block bit that length is K'=576 directly as information bit to be encoded.
5, by the H of (6 × 64) × (15 × 64)_{bz}Being that the information bit to be encoded of K'=576 carries out LDPC coding to length, obtaining length is N=K'+m_{b}× z=n_{b}Female code code word bits of × z=960, wherein front 576 bits are systematic bits, and rear 384 bits are check bit.
Female code code word bits is carried out code word rearrangement, it is assumed that the female code code word bits before rearrangement is A_{0},A_{1},…,A_{959}, the female code code word bits after code word rearrangement is B_{0},B_{1},…,B_{959}, then code word is reset and is represented by equation below:
Wherein,PV represents that code word resets vector, PV={9,10,11,12,13,14}.Again due to 0.6 < 0.75, i.e. R_{tx}< R_{m}, in 3, obtaining encoder matrix H_{bz}Process has been carried out intercept operation, therefore the female code code word bits B that can obtain after resetting_{0},B_{1},…,B_{959}As code word bits waiting for transmission.
Fig. 5 illustrates the structure of the code device of LDPC code provided by the invention, as it is shown in figure 5, described device includes: coding unit 10, comparing unit 20, packet bit determine that unit 30, encoder matrix determine that unit 40, information bit determine unit 50 and code word processing unit 60; Wherein, the size of the comparing unit 20 female code code check with transmission code rate for comparing the support of uniform based matrix; Packet bit determines that unit 30 is for the comparative result according to comparing unit, it is determined that the length K ' of input information block bit; Encoder matrix determines that unit 40 for determining the encoder matrix of LDPC code according to uniform based matrix and spreading factor; Information bit determines that unit 50 is for receiving the information bit of input, the information block bit length that unit 30 is determined is determined according to packet bit, obtain the information block bit that length is K ', and determine information bit to be encoded, and be transmitted to coding unit 10; Female code code word that code word processing unit 60 obtains for coding unit 10 carries out LDPC coding processes, and obtains code word bits waiting for transmission.
Further, described device also includes arranging unit 70, for arranging uniform based matrix and the spreading factor of LDPC code.
Further, described device also includes input block 80, for receiving current transmission code rate; Packet bit determines that unit 30 is specifically for being R when the comparative result of comparing unit 20_{tx}≥R_{m}Time, it is determined that the length K ' of information block bit is (n_{b}m_{b}) × z; When the comparative result of comparing unit 20 is R_{tx}< R_{m}Time, it is determined that the length of information block bit is K'=func (m_{b}×z×R_{tx}/(1R_{tx})) or K'=func (m_{b}×z/(1R_{tx}))m_{b}× z or K'=func (func (m_{b}×z/(1R_{tx}))×R_{tx}); Wherein, R_{tx}For transmission code rate, R_{m}For female code code check, m_{b}、n_{b}The respectively line number of uniform based matrix and columns, z is spreading factor, and func (x) is the one of number, downward round numbers or round numbers of rounding off that x is rounded up.
Further, encoder matrix determines that unit 40 is specifically for being modified described uniform based matrix, according to spreading factor z, utilizes the unit matrix of z × z to be extended revising the basis matrix obtained, obtains the encoder matrix of LDPC code.
Correspondingly, information bit determines that unit 50 is specifically for being R when the comparative result of comparing unit 20_{tx}≥R_{m}Time, by the information block bit that length is K ' that receives directly as information bit to be encoded; When the comparative result of comparing unit 20 is R_{tx}< R_{m}Time, in the information block bit that length is K ', add filling bit, forming length is k_{b}The information bit to be encoded of × z, wherein filling bit is full 0 bit or complete 1 bit.
Correspondingly, code word processing unit 60 is reset specifically for female code code word that coding unit 10 coding is obtained, and the female code code word bits before wherein resetting is A_{0},A_{1},…,A_{nb×z1}, the female code code word bits after rearrangement is B_{0},B_{1},…,B_{nb×z1}, rearrangement formulae is:Wherein, k_{b}=n_{b}m_{b}, PV represents that code word resets vector, and its element set is { n_{b}m_{b},n_{b}m_{b}+1,n_{b}m_{b}+ 2 ..., n_{b}1}, PV (x) represent that in PV vector, index is the element of x, and x is nonnegative integer; When the comparative result of comparing unit 20 is R_{tx}≥R_{m}Time, the female code code word bits B after rearrangement_{0},B_{1},…,B_{nb×z1}Func (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission;When the comparative result of comparing unit 20 is R_{tx}< R_{m}Time, the described k that will add_{b}× zK' filling bit is from the female code code word bits B after resetting_{0},B_{1},…,B_{nb×z1}In systematic bits in delete, remaining female code code word bits is as code word bits waiting for transmission.
Further, encoder matrix determines that unit 40 is specifically for being modified uniform based matrix, according to spreading factor z, utilizes the unit matrix of z × z to be extended revising the basis matrix obtained, obtains the extended matrix of LDPC code; When the comparative result of comparing unit 20 is R_{tx}≥R_{m}Time, using the extended matrix encoder matrix as LDPC code; When the comparative result of comparing unit is R_{tx}< R_{m}Time, intercept the func (m on the right of extended matrix_{b}×z/(1R_{tx})) row, the matrix that the obtains encoder matrix as LDPC code will be intercepted; OrDuring for positive integer, uniform based matrix is modified, obtains revised basis matrix; When the comparative result of comparing unit 20 is R_{tx}≥R_{m}Time, according to spreading factor z, utilize the unit matrix of z × z to be extended revising the basis matrix obtained, obtain the encoder matrix of LDPC code; When the comparative result of comparing unit 20 is R_{tx}< R_{m}Time, intercept the k ' on the right of revised basis matrix_{b}+m_{b}Row, according to spreading factor z, utilize the unit matrix of z × z to be extended intercepting the matrix obtained, obtain the encoder matrix of LDPC code.
Correspondingly, information bit determine unit 50 specifically for the information block bit that length is K ' that will receive directly as information bit to be encoded.
Correspondingly, code word processing unit 60 is reset specifically for female code code word that coding unit 10 is obtained, and the female code code word bits before wherein resetting isFemale code code word bits after rearrangement isRearrangement formulae is:
Wherein,PV represents that code word resets vector, and its element set isPV (x) represents that in PV vector, index is the element of x, and x is nonnegative integer; When the comparative result of comparing unit 20 is R_{tx}≥R_{m}Time, the female code code word bits after rearrangementFunc (K'/R is taken from small to large successively according to index_{tx}) individual bit, as code word bits waiting for transmission; When the comparative result of comparing unit 20 is R_{tx}< R_{m}Time, directly by from reset after female code code word bitsAs code word bits waiting for transmission.
Another it is to be appreciated that coding is mutually corresponding with decoding, the therefore coded method of LDPC code provided by the invention and device, its coding/decoding method also has corresponding inverse operation with decoding device, repeats no more.
The above, be only presently preferred embodiments of the present invention, is not intended to limit protection scope of the present invention.
Claims (18)
Priority Applications (1)
Application Number  Priority Date  Filing Date  Title 

CN201010293323.6A CN102412842B (en)  20100925  20100925  The coded method of a kind of low density parity check code and device 
Applications Claiming Priority (2)
Application Number  Priority Date  Filing Date  Title 

CN201010293323.6A CN102412842B (en)  20100925  20100925  The coded method of a kind of low density parity check code and device 
PCT/CN2010/079103 WO2012037749A1 (en)  20100925  20101125  Encoding method for low density parity check code and apparatus thereof 
Publications (2)
Publication Number  Publication Date 

CN102412842A CN102412842A (en)  20120411 
CN102412842B true CN102412842B (en)  20160615 
Family
ID=45873399
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

CN201010293323.6A CN102412842B (en)  20100925  20100925  The coded method of a kind of low density parity check code and device 
Country Status (2)
Country  Link 

CN (1)  CN102412842B (en) 
WO (1)  WO2012037749A1 (en) 
Families Citing this family (21)
Publication number  Priority date  Publication date  Assignee  Title 

CN104202057B (en) *  20140212  20190816  中兴通讯股份有限公司  Information processing method and device 
CN107404322A (en) *  20140917  20171128  上海数字电视国家工程研究中心有限公司  Check matrix and LDPC code word for low code rate LDPC code 
CN105811996B (en)  20141230  20191206  华为技术有限公司  data processing method and system based on quasicyclic LDPC 
CN106685586B (en) *  20151111  20200214  华为技术有限公司  Method and apparatus for generating low density parity check code for transmission in a channel 
CN107370489B (en)  20160513  20200728  中兴通讯股份有限公司  Data processing method and device for structured L DPC code 
WO2017193558A1 (en) *  20160513  20171116  中兴通讯股份有限公司  Data processing method and device for structured ldpc code 
WO2017193614A1 (en) *  20160513  20171116  中兴通讯股份有限公司  Encoding method and device and decoding method and device for structured ldpc 
CN107566081B (en) *  20160630  20200403  华为技术有限公司  RM sequence generation and application method and device 
CN107888198A (en) *  20160930  20180406  中兴通讯股份有限公司  Quasicyclic LDPC coding and decoding method, device and LDPC coders 
CN108134648A (en) *  20161201  20180608  华为技术有限公司  Notice channel transmitting method, method of reseptance and equipment 
CN108234064A (en) *  20161209  20180629  中兴通讯股份有限公司  Quasicyclic LDPC code data processing equipment and processing method 
CN108270448A (en) *  20170104  20180710  中兴通讯股份有限公司  Quasicirculating lowdensity parity check coding method and device 
WO2018126914A1 (en) *  20170109  20180712  中兴通讯股份有限公司  Method and device for coding of quasicyclic lowdensity paritycheck code, and storage medium 
CN108429602A (en) *  20170215  20180821  中兴通讯股份有限公司  A kind of data processing method, device and transmitting terminal 
JP2020515125A (en) *  20170303  20200521  華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ．  High rate long LDPC code 
WO2018171043A1 (en) *  20170324  20180927  中兴通讯股份有限公司  Processing method and device for quasicyclic low density parity check coding 
WO2018201912A1 (en) *  20170505  20181108  电信科学技术研究院有限公司  Method and device for selecting base graph for lowdensity paritycheck code 
CN108809509A (en) *  20170505  20181113  电信科学技术研究院  The foundation drawing selection method and device of low density parity check code 
CN109120374A (en) *  20170626  20190101  中兴通讯股份有限公司  Quasicirculating lowdensity parity check code Design method and device 
CN109150194A (en) *  20170627  20190104  华为技术有限公司  The method, apparatus and communication equipment of information processing 
WO2019029690A1 (en) *  20170811  20190214  华为技术有限公司  Communication method and device 
Citations (3)
Publication number  Priority date  Publication date  Assignee  Title 

CN1953335A (en) *  20051021  20070425  中兴通讯股份有限公司  A coding device and method for low density parity check code of supporting any code rate/code length 
CN101217337A (en) *  20070101  20080709  中兴通讯股份有限公司  A low density parity code encoding device and method supporting incremental redundancy hybrid automatic repeat 
CN101325474A (en) *  20070612  20081217  中兴通讯股份有限公司  Method for encoding channel of mixed automatic request retransmission and modulation mapping of LDPC code 
Family Cites Families (4)
Publication number  Priority date  Publication date  Assignee  Title 

US7149953B2 (en) *  20040203  20061212  Broadcom Corporation  Efficient LDPC code decoding with new minus operator in a finite precision radix system 
US7188297B2 (en) *  20040812  20070306  Motorola, Inc.  Method and apparatus for encoding and decoding data 
US7996746B2 (en) *  20041012  20110809  Nortel Networks Limited  Structured lowdensity paritycheck (LDPC) code 
CN101567697B (en) *  20090525  20121212  普天信息技术研究院有限公司  Coder and method for coding ratecompatible lowdensity paritycheck codes 

2010
 20100925 CN CN201010293323.6A patent/CN102412842B/en active IP Right Grant
 20101125 WO PCT/CN2010/079103 patent/WO2012037749A1/en active Application Filing
Patent Citations (3)
Publication number  Priority date  Publication date  Assignee  Title 

CN1953335A (en) *  20051021  20070425  中兴通讯股份有限公司  A coding device and method for low density parity check code of supporting any code rate/code length 
CN101217337A (en) *  20070101  20080709  中兴通讯股份有限公司  A low density parity code encoding device and method supporting incremental redundancy hybrid automatic repeat 
CN101325474A (en) *  20070612  20081217  中兴通讯股份有限公司  Method for encoding channel of mixed automatic request retransmission and modulation mapping of LDPC code 
Also Published As
Publication number  Publication date 

WO2012037749A1 (en)  20120329 
CN102412842A (en)  20120411 
Similar Documents
Publication  Publication Date  Title 

US20200092035A1 (en)  Method and Apparatus for Encoding Data Using a Polar Code  
JP5801927B2 (en)  Downlink control information transmission method and codeword generation method therefor  
US8578249B2 (en)  LDPC encoding and decoding of packets of variable sizes  
JP5219552B2 (en)  Apparatus and method for encoding / decoding block low density parity check code in mobile communication system  
KR100678176B1 (en)  Apparatus and method for coding/decoding block low density parity check code with variable block length  
JP4555333B2 (en)  Apparatus and method for encoding / decoding block low density parity check code having variable coding rate  
KR100739510B1 (en)  Apparatus and method for coding/decoding semisystematic block low density parity check code  
CN1866751B (en)  Construction method and device for low density parity codes  
KR100671319B1 (en)  Lowdensity paritycheck codes for multiple code rates  
EP2503698B1 (en)  Error correction method and device, and communication system using the same  
KR101042747B1 (en)  Apparatus and method for transmitting and receiving data in a communication system using structured low density parity check  
WO2017025823A1 (en)  Ratecompatible polar codes  
AU2005239662B2 (en)  Method and apparatus for generating a lowdensity parity check code  
US8225173B2 (en)  Multirate LDPC code system and method  
JP4519902B2 (en)  Apparatus and method for encoding / decoding block low density parity check code having variable block length  
US7523375B2 (en)  Set of irregular LDPC codes with random structure and low encoding complexity  
CN101032082B (en)  Method and apparatus for encoding and decoding data  
US10277249B2 (en)  Method and apparatus for channel encoding and decoding in a communication system using a lowdensity parity check code  
US9197250B2 (en)  Method and apparatus for channel coding and decoding in a communication system using a lowdensity paritycheck code  
JP4820368B2 (en)  Encoding and decoding method using LDPC code  
CN100583651C (en)  Apparatus and method for decoding using channel code  
US8266512B2 (en)  Method and apparatus for signal transmission/reception in a communication system using an HARQ scheme  
CN101217337B (en)  A low density parity code encoding device and method supporting incremental redundancy hybrid automatic repeat  
US8433972B2 (en)  Systems and methods for constructing the base matrix of quasicyclic lowdensity paritycheck codes  
KR20070042850A (en)  Apparatus and method for coding/decoding block low density parity check code with variable block length 
Legal Events
Date  Code  Title  Description 

PB01  Publication  
C06  Publication  
SE01  Entry into force of request for substantive examination  
C10  Entry into substantive examination  
GR01  Patent grant  
C14  Grant of patent or utility model 