CN101834613B - Encoding method of LDPC (Low Density Parity Check) code and encoder - Google Patents

Abstract

The invention provides an encoding method of an LDPC (Low Density Parity Check) code. The encoding method comprises the following steps of: adjusting elements of a modular matrix Hbm by using an expanding factor Zf to generate an adjusted modular matrix Hbmf; expanding by using the modular matrix Hbmf to generate a check matrix H, wherein the expanding mode is as follows: sub-matrixes Pi and j in the check matrix H expand according to the value of the modular matrix Hbmf, and each of the sub-matrixes Pi and j is a full zero matrix, a unit matrix or a unit matrix for left and right cyclic shifting according to a line direction; and encoding input information U by using the check matrix H and outputting encoding information V. The invention also provides an encoder of the LDPC code. According to the technical scheme proposed by the invention, through increasing the quantity of zero elements of the modular matrix Hbm, the processing complexity and the implementation complexity of the encoding and the decoding of the LDPC code can be reduced, and the processing speed of the encoding and the coding can be improved.

Description

A kind of coding method of LDPC sign indicating number and encoder

Technical field

The present invention relates to digital communicating field, particularly, the present invention relates to a kind of coding method and encoder of LDPC sign indicating number.

Background technology

LDPC (Low Density Parity Check, low-density checksum) sign indicating number is a kind of packeting error-correcting code with sparse check matrix that Gallager proposed in 1962.1996, people such as Mackay restudied the LDPC sign indicating number, and find that the LDPC sign indicating number has extraordinary performance: approach shannon limit, coding is simple, but decoding is simple and parallel computation.

2005, IEEE std802.16e standard provided a kind of structurized LDPC sign indicating number (StructuredLDPC).The coding structure of this LDPC sign indicating number is based on one modular matrix H _Bm, and use the unit matrix of cyclic shift and full null matrix to expand as submatrix, produce the required check matrix H of coding.This LDPC sign indicating number corresponding check matrix structure is shown in formula (1-1).

$H=\left[\begin{array}{cccc}{P}_{\mathrm{1,1}}& \begin{array}{cc}{P}_{\mathrm{1,2}}& \·\·\·\·\·\·\end{array}& P_{1,n_b-1}& P_{1,n_b}\\ P_{2,1}& P_{\mathrm{2,2}}\begin{array}{cc}& \·\·\·\·\·\·\end{array}& P_{2,n_b-1}& P_{2,n_b}\\ \·\·\·\·\·\·& \·\·\·\·\·\·& \·\·\·\·\·\·& \·\·\·\·\·\·\\ P_{m_b-\mathrm{1,1}}& P_{m_b-\mathrm{1,2}}\begin{array}{cc}& \·\·\·\·\·\·\end{array}& P_{m_b-1,n_b-1}& P_{m_b-1,n_b}\\ P_{m_b,1}& P_{m_b,2}\begin{array}{cc}& \·\·\·\·\·\·\end{array}& P_{m_b-1,n_b-1}& P_{m_b,n_b}\end{array}\right]---(1-1)$

In formula (1-1), the submatrix P in the check matrix H _{I, j}Be to expand as submatrix and produce by the unit matrix of cyclic shift and full null matrix, the size of corresponding unit matrix and full null matrix, z _fRow, z _fRow can be with spreading factor z _fChange the modular matrix H that this check matrix H is corresponding neatly _BmEach element be natural number or-1.Wherein, natural number comprises 0 and positive integer, is the cyclic shift value of unit matrix, and the representation unit matrix is by being listed as the number of cyclic shift to the right, and unit matrix is by being listed as to the right after the cyclic shift as the submatrix P in the corresponding check matrix H _{I, j}Submatrix P in-1 expression corresponding check matrix H wherein _{I, j}Expand and obtain by full null matrix.Modular matrix H _BmLine number, columns be respectively m _bAnd n _b, shown in formula (1-2),

$H_{\mathrm{bm}}=\left[\begin{array}{ccc}{h}_{\mathrm{1,1}}& \·\·\·& h_{1,n_b}\\ \·& & \·\\ \·& & \·\\ \·& & \·\\ h_{m_b,1}& \·\·\·& h_{m_b,n_b}\end{array}\right]---(1-2)$

Wherein, each element h _{I, j}(i=1 ..., m _bJ=1 ..., n _b) value be natural number perhaps-1.Here, be that the element of positive integer is called the positive integer element with value, be that 0 element is called neutral element with value, value is called " 1 " element for-1 element.

Formula (1-2) can also be expressed as n _bIndividual column vector,

$H_{\mathrm{bm}}=[h_1,\·\·\·,h_{n_b}],---(1-3)$

Wherein, each column vector h _i(i=1 ..., n _b) comprise m _bIndividual element.

$h_i=\left[\begin{array}{c}{h}_{1,i}\\ \·\\ \·\\ \·\\ h_{m_b,i}\end{array}\right]={[h_{1,i},\·\·\·,h_{m_b,i}]}^T---(1-4)$

Wherein, x ^TExpression is carried out transpose process to vector x.

Above-mentioned modular matrix H _BmCan also be divided into 2 parts, as shown in Figure 1, wherein, modular matrix H _BmBy formula (1-5) is expressed as:

$H_{\mathrm{bm}}=\left[\begin{array}{cc}{H}_{\mathrm{bm}}^S& H_{\mathrm{bm}}^P\end{array}\right]---(1-5)$

Wherein, H _Bm ^SCorresponding to the systematic bits part of check matrix H, it comprises matrix H _BmThe m on the left side _bRow, k _bThe element of row is corresponding to H _BmLeft side k _bIndividual column vector h _i(i=1 ..., k _b), shown in formula (1-6),

$H_{\mathrm{bm}}^S=[h_1,\·\·\·,h_{k_b}]---(1-6)$

Wherein, H _Bm ^PCorresponding to the check bit part of check matrix H, it comprises matrix H _BmThe m on the right _bRow, m _bThe element of row is corresponding to H _BmThe right m _bIndividual column vector h _i(i=k _b+ 1 ..., n _b), shown in formula (1-7),

$H_{\mathrm{bm}}^P=[h_{k_b+1},\·\·\·,h_{n_b}]---(1-7)$

Wherein, k _b+ m _b=n _b

Above-mentioned matrix H _Bm ^PAlso can be divided into 2 parts, shown in formula (1-8),

Wherein,

Be modular matrix H _BmK _b+ 1 column vector.

Comprise modular matrix H _BmThe m on the right _bRow, m _bThe element of-1 row is corresponding to H _BmThe right m _b-1 column vector h _i(i=k _b+ 2 ..., n _b), shown in formula (1-9),

${\hat{H}}_{\mathrm{bm}}^P=[h_{k_b+2},\·\·\·,h_{n_b}]---(1-9)$

Usually; Matrix

adopts the structure at a kind of biconjugate angle; Shown in formula (1-10)

Wherein, work as i=1 ..., m _bAnd when i=j or i=j+1, h _{I, j}Value is 0, and other is-1.Modular matrix H as shown in table 1, that a kind of LDPC that provides for IEEE std802.16e standard encodes _Bm, k wherein _b=12, m _b=12, n _b=24.

The modular matrix of table 1 LDPC coding

-1 94 73 -1 -1 -1 -1 -1 55 83 -1 -1 ?7 ?0 -1 -1 -1 -1?-1?-1?-1?-1?-1?-1

-1 27 -1 -1 -1 22 79 9 ?-1 -1 -1 12 -1 ?0 ?0 -1 -1 -1?-1?-1?-1?-1?-1?-1

-1 -1 -1 24 22 81 -1 33 -1 -1 -1 ?0 -1 -1 ?0 ?0 -1 -1?-1?-1?-1?-1?-1?-1

61 -1 47 -1 -1 -1 -1 -1 65 25 -1 -1 -1 -1 -1 ?0 ?0 -1?-1?-1?-1?-1?-1?-1

-1 -1 39 -1 -1 -1 84 -1 -1 41 72 -1 -1 -1 -1 -1 ?0 ?0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 46 40 -1 82 -1 -1 -1 79 ?0 -1 -1 -1 -1 ?0 0?-1?-1?-1?-1?-1

-1 -1 95 53 -1 -1 -1 -1 -1 14 18 -1 -1 -1 -1 -1 -1 -1 0 0?-1?-1?-1?-1

-1 11 73 -1 -1 -1 2 ?-1 -1 47 -1 -1 -1 -1 -1 -1 -1 -1?-1 0 0?-1?-1?-1

12 -1 -1 -1 83 24 -1 43 -1 -1 -1 51 -1 -1 -1 -1 -1 -1?-1?-1 0 0?-1?-1

-1 -1 -1 -1 -1 94 -1 59 -1 -1 70 72 -1 -1 -1 -1 -1 -1?-1?-1?-1 0 0?-1

-1 -1 ?7 65 -1 -1 -1 -1 39 49 -1 -1 -1 -1 -1 -1 -1 -1?-1?-1?-1?-1 0 0

43 -1 -1 -1 -1 66 -1 41 -1 -1 -1 26 ?7 -1 -1 -1 -1 -1?-1?-1?-1?-1?-1 0

For the code length that can support neatly that other is short, need to use less spreading factor z _f, simultaneously in addition need be according to the above-mentioned modular matrix H of following formula (1-11) adjustment _BmThe value of element, generate adjusted modular matrix H _BmfFor

Wherein, p (i, j) the above-mentioned modular matrix H of representative _BmThe element value or the cyclic shift value of capable, the j of i row, (f, i are corresponding to above-mentioned spreading factor z j) to p _fAdjusted modular matrix H _BmfThe element or the cyclic shift value of capable, the j of i row.z ₀It is maximum spreading factor.The z that IEEE std802.16e standard provides ₀=96.

Yet the problem that above-mentioned LDPC sign indicating number exists is, as modular matrix H _BmP (i, j)＞0 element relatively more for a long time, this just means in the formula (1-11) than the complex mathematical expression formula

The also corresponding increase of computational process.In order further to reduce the coding of LDPC sign indicating number and the processing complexity and the implementation complexity of decoding, improve the processing speed of coding and decoding, be necessary modular matrix H _BmDo further to improve, make the operand of formula (1-11) further lower, improve the coding and the decoding speed of LDPC sign indicating number.In addition, above-mentioned modular matrix H _BmThe all elements value can only be-1,0 and positive integer, wherein, positive integer representation unit matrix is by being listed as the numerical value of cyclic shift to the right, all elements of modular matrix can not be a negative integer.Therefore, be necessary to propose a kind of can two-way cyclic shift modular matrix H _Bm, increased the flexibility of encoding process.

Summary of the invention

The object of the invention is intended to solve at least one of above-mentioned technological deficiency, the processing complexity of coding and decoding that particularly solve to reduce the LDPC sign indicating number with implementation complexity, improve coding and the processing speed of deciphering, increased the problem of the flexibility of encoding process.

For achieving the above object, one aspect of the present invention has proposed a kind of coding method of LDPC sign indicating number, may further comprise the steps: use spreading factor z _fAdjustment modular matrix H _BmElement, generate adjusted modular matrix H _Bmf, said matrix H _BmBe m _bRow, n _bThe matrix of row, said matrix H _BmIn element p (i, value j) is-1,0 or Integer n, said matrix H _BmThe number of neutral element be not less than m _b+ n _b-1, said matrix H _BmfIn element

Wherein

It is right to represent Round m to zero _b, n _b, j, i, z _f, z ₀Be positive integer, and 1≤i≤m _b, 1≤j≤n _b, z _f≤z ₀Use said matrix H _BmfExpansion generates check matrix H, and extended mode is the submatrix P in the check matrix H _{I, j}(value j) is expanded for f, i, each submatrix P according to p _{I, j}Size be z _f* z _f, (value j) is-1 o'clock corresponding submatrix P to p for f, i _{I, j}Be full null matrix, (value j) is 0 o'clock corresponding submatrix P to p for f, i _{I, j}Be unit matrix, (value j) is a positive integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift to the right

(value j) is a negative integer to p for f, i The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift left Use said check matrix H that input information U is encoded, output coding information V.

According to embodiments of the invention, said matrix H _BmComprise n _bIndividual column vector $H_{\mathrm{Bm}}=[h_1,\·\·\·,h_{n_b}],$ Each column vector h wherein _i(i=1 ..., n _b) comprise m _bIndividual element, each column vector h _i(i=1 ..., n _b) number of the neutral element that comprises is not less than 1.

According to embodiments of the invention, said matrix H _BmComprise matrix H _Bm ^SAnd matrix H _Bm ^P, $H_{\mathrm{Bm}}=\left[\begin{array}{cc}{H}_{\mathrm{Bm}}^S,& H_{\mathrm{Bm}}^P\end{array}\right],$ H wherein _Bm ^SSystematic bits part corresponding to check matrix H comprises matrix H _BmThe m on the left side _bRow, k _bThe element of row, H _Bm ^PCheck bit part corresponding to check matrix H comprises matrix H _BmThe m on the right _bRow, m _bThe element of row, said matrix H _BmThe number of neutral element be not less than 2m _b+ k _b-1 or 2n _b-k _b-1.

According to embodiments of the invention, said column vector h _i(i=1 ..., k _bThe number of the neutral element that+1) comprises is not less than 1, column vector h _i(i=k _b+ 2 ..., n _b) number of the neutral element that comprises is 2.

According to embodiments of the invention, use said check matrix H that input information U is encoded and may further comprise the steps: input information U is carried out following computing,

Wherein, u (j) (j=1 .., k _b) represent the j of encoder input information U to organize bit, v (i) (i=1 ..., m _b) represent the i of the coded message V of encoder output to organize bit, every group of number of bits is z _f,

The expression submatrix

Inverse matrix, 1≤x≤m _b

According to embodiments of the invention, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned at before m _b-1 element

The number of the neutral element that comprises is not less than 1.

According to embodiments of the invention, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 1st walk to m _bBetween-1 row, comprise the 1st row and m _b-1 row.

According to embodiments of the invention, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned at last m _b-1 element

The number of the neutral element that comprises is not less than 1.

According to embodiments of the invention, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 1st walk to m _bBetween-1 row, comprise the 2nd row and m _bOK.

According to embodiments of the invention, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned in the middle of m _b-2 elements

The number of the neutral element that comprises is not less than 1.

According to embodiments of the invention, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 2nd walk to m _bBetween-1 row, comprise the 2nd row and m _b-1 row.

Another aspect of the present invention has proposed a kind of LDPC code coder, comprises the matrix adjusting module, and matrix changes module, and matrix stores module and coding module: said matrix adjusting module is used for according to spreading factor z _fAdjustment modular matrix H _BmElement, generate adjusted modular matrix H _Bmf, said matrix H _BmBe m _bRow, n _bThe matrix of row, said matrix H _BmIn element p (i, value j) is-1,0 or Integer n, said matrix H _BmThe number of neutral element be not less than m _b+ n _b-1, said matrix H _BmfIn element

Wherein It is right to represent

Round m to zero _b, n _b, j, i, z _f, z ₀Be positive integer, and 1≤i≤m _b, 1≤j≤n _b, z _f≤z ₀Said matrixing module is used for according to said matrix H _BmfExpansion generates check matrix H and is stored in said matrix stores module, and extended mode is the submatrix P in the check matrix H _{I, j}(value j) is expanded for f, i, each submatrix P according to p _{I, j}Size be z _f* z _f, (value j) is-1 o'clock corresponding submatrix P to p for f, i _{I, j}Be full null matrix, (value j) is 0 o'clock corresponding submatrix P to p for f, i _{I, j}Be unit matrix, (value j) is a positive integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift to the right (value j) is a negative integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift left

Said coding module is used for according to said check matrix H input information U being encoded output coding information V; Said matrix stores module is used for the required matrix H of memory encoding _Bm, H _BmfAnd H.

According to embodiments of the invention, said matrix H _BmComprise n _bIndividual column vector $H_{\mathrm{Bm}}=[h_1,\·\·\·,h_{n_b}],$ Each column vector h wherein _i(i=1 ..., n _b) comprise m _bIndividual element, each column vector h _i(i=1 ..., n _b) number of the neutral element that comprises is not less than 1.

According to embodiments of the invention, said matrix H _BmComprise matrix H _Bm ^SAnd matrix H _Bm ^P, $H_{\mathrm{Bm}}=\left[\begin{array}{cc}{H}_{\mathrm{Bm}}^S,& H_{\mathrm{Bm}}^P\end{array}\right],$ H wherein _Bm ^SSystematic bits part corresponding to check matrix H comprises matrix H _BmThe m on the left side _bRow, k _bThe element of row, H _Bm ^PCheck bit part corresponding to check matrix H comprises matrix H _BmThe m on the right _bRow, m _bThe element of row, said matrix H _BmThe number of neutral element be not less than 2m _b+ k _b-1 or 2n _b-k _b-1.

According to embodiments of the invention, said column vector h _i(i=1 ..., k _bThe number of the neutral element that+1) comprises is not less than 1, column vector h _i(i=k _b+ 2 ..., n _b) number of the neutral element that comprises is 2.

The technical scheme that proposes according to the present invention is through increasing modular matrix H _BmThe quantity of neutral element can reduce the coding of LDPC sign indicating number and the processing complexity and the implementation complexity of decoding, improves the processing speed of coding and decoding.The modular matrix H that the present invention proposes _BmThe element value can be-1,0 and positive integer, can also be for less than-1 negative positive number, make that unit matrix can also two-way cyclic shift, both supported cyclic shift to the right, also support cyclic shift left, increased the flexibility of encoding process.In addition, modular matrix H _BmThe absolute value of element value can also become littler, modular matrix H like this _BmThe quantization bit of element parameter value can reduce, thereby save storage expenses and hardware spending, reduce implementation complexity.

Aspect that the present invention adds and advantage part in the following description provide, and part will become obviously from the following description, or recognize through practice of the present invention.

Description of drawings

Above-mentioned and/or additional aspect of the present invention and advantage are from obviously with easily understanding becoming the description of embodiment below in conjunction with accompanying drawing, wherein:

Fig. 1 is modular matrix H _BmStructural representation;

Fig. 2 is the flow chart of LDPC sign indicating number coding;

Fig. 3 is the structure intention of LDPC code coder.

Embodiment

Describe embodiments of the invention below in detail, the example of said embodiment is shown in the drawings, and wherein identical from start to finish or similar label is represented identical or similar elements or the element with identical or similar functions.Be exemplary through the embodiment that is described with reference to the drawings below, only be used to explain the present invention, and can not be interpreted as limitation of the present invention.

The present invention proposes a kind of coding method of LDPC sign indicating number, may further comprise the steps: use spreading factor z _fAdjustment modular matrix H _BmElement, generate adjusted modular matrix H _Bmf, said matrix H _BmBe m _bRow, n _bThe matrix of row, said matrix H _BmIn element p (i, value j) is-1,0 or Integer n, said matrix H _BmThe number of neutral element be not less than m _b+ n _b-1, said matrix H _BmfIn element

Wherein It is right to represent

Round m to zero _b, n _b, j, i, z _f, z ₀Be positive integer, and 1≤i≤m _b, 1≤j≤n _b, z _f≤z ₀Use said matrix H _BmfExpansion generates check matrix H, and extended mode is the submatrix P in the check matrix H _{I, j}(value j) is expanded for f, i, each submatrix P according to p _{I, j}Size be z _f* z _f, (value j) is-1 o'clock corresponding submatrix P to p for f, i _{I, j}Be full null matrix, (value j) is 0 o'clock corresponding submatrix P to p for f, i _{I, j}Be unit matrix, (value j) is a positive integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift to the right

, (value j) is a negative integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift left

Use said check matrix H that input information U is encoded, output coding information V.

As shown in Figure 2, the flow chart for the LDPC sign indicating number of the present invention's proposition is encoded may further comprise the steps:

S101: use spreading factor z _fAdjustment modular matrix H _Bm, generate adjusted modular matrix H _Bmf

The technical scheme that proposes according to the present invention, modular matrix H _BmLine number, columns be respectively m _bAnd n _b, shown in formula (1-2), matrix H _BmIn element p (i, value j) is-1,0 or Integer n.For the coding that can reduce the LDPC sign indicating number and the processing complexity and the implementation complexity of decoding, improve the processing speed of coding and decoding, the modular matrix H that the present invention proposes _BmThe number of neutral element be not less than m _b+ n _b-1.

Existing modular matrix H _BmThe all elements value can only be-1,0 and positive integer, wherein, positive integer representation unit matrix is by being listed as the shift value of cyclic shift to the right, all elements of existing modular matrix can not be a negative integer.The modular matrix H that the present invention proposes _BmThe element value can be-1,0 and positive integer, can also be for less than-1 negative positive number, unit matrix can two-way cyclic shift, has promptly both supported cyclic shift to the right, also supports cyclic shift left, has increased the flexibility of encoding process.In addition, modular matrix H _BmThe absolute value of element value can also become littler, modular matrix H like this _BmThe quantization bit of element parameter value can reduce, thereby save storage expenses and hardware spending, reduce implementation complexity.

With this understanding, use spreading factor z _fAdjustment modular matrix H _Bm, generate adjusted modular matrix H _BmfMatrix H _BmfIn element after adjusting be:

Wherein It is right to represent

Round m to zero _b, n _b, j, i, z _f, z ₀Be positive integer, and 1≤i≤m _b, 1≤j≤n _b, z _f≤z ₀

As embodiments of the invention, matrix H _BmComprise n _bIndividual column vector $H_{\mathrm{Bm}}=[h_1,\·\·\·,h_{n_b}],$ Each column vector h wherein _i(i=1 ..., n _b) comprise m _bIndividual element, each column vector h _i(i=1 ..., n _b) number of the neutral element that comprises is not less than 1.

As embodiments of the invention, the modular matrix H that the present invention proposes _BmAlso can be divided into 2 parts, as shown in Figure 1, wherein, modular matrix H _BmBy formula (1-5) is expressed as:

$H_{\mathrm{bm}}=\left[\begin{array}{cc}{H}_{\mathrm{bm}}^S& H_{\mathrm{bm}}^P\end{array}\right]---(1-5)$

Wherein, H _Bm ^SCorresponding to the systematic bits part of check matrix H, it comprises matrix H _BmThe m on the left side _bRow, k _bThe element of row is corresponding to H _BmLeft side k _bIndividual column vector h _i(i=1 ..., k _b), shown in formula (1-6),

$H_{\mathrm{bm}}^S=[h_1,\·\·\·,h_{k_b}]---(1-6)$

Wherein, H _Bm ^PCorresponding to the check bit part of check matrix H, it comprises matrix H _BmThe m on the right _bRow, m _bThe element of row is corresponding to H _BmThe right m _bIndividual column vector h _i(i=k _b+ 1 ..., n _b), shown in formula (1-7),

$H_{\mathrm{bm}}^P=[h_{k_b+1},\·\·\·,h_{n_b}]---(1-7)$

Wherein, k _b+ m _b=n _b

At this moment, as embodiments of the invention, matrix H _BmThe number of neutral element be not less than 2m _b+ k _b-1 or 2n _b-k _b-1.

As embodiments of the invention, column vector h _i(i=1 ..., k _bThe number of the neutral element that+1) comprises is not less than 1, column vector h _i(i=k _b+ 2 ..., n _b) number of the neutral element that comprises is 2.

The matrix H that the present invention proposes _BmCan also have for meeting the various ways of following condition, for example:

Matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned at before m _b-1 element

The number of the neutral element that comprises is not less than 1; Furthermore, can also be matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Hm ^SThe 1st walk to m _bBetween-1 row, comprise the 1st row and m _b-1 row.

More specifically, matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=12, m _b=12, n _b=24:

Table 2 (a)

-1?-13 0 -1 -1 -1 -1 -1?-10 36 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 16 -1 -1 -1 -2 -5?-34 -1 -1 -1 12 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1?-29 ?0?-39 -1?-10 -1 -1 -1 ?0 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

0 -1?-26 -1 -1 -1 -1 -1 ?0?-22 -1 -1 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1?-34 -1 -1 -1 ?0 -1 -1 -6 ?0 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 24 16 -1 39 -1 -1 -1?-17 -7?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 22 ?0 -1 -1 -1 -1 -1?-33 42 -1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 0 0 -1 -1 -1 14 -1 -1 0 -1 -1 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

47 -1 -1 -1?-35 ?0 -1 ?0 -1 -1 -1?-45 -1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 -1 -1 -1?-26 -1 16 -1 -1 -2?-24 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 -1 30 12 -1 -1 -1 -1?-26 ?2 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-18 -1 -1 -1 -1 42 -1 -2 -1 -1 -1 26 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=20, m _b=4, n _b=24:

Table 3 (a)

0 19?-28?-1 7?-43?-1?12?-43?-16 -5 -9?-26 24 15 18 36 28 33 -19 ?0 0?-1?-1

-1 0 -1?32 0 0?-9 0 16 -1 46?-40 0?-34 24 -6 0?-44?-18 ?0 16 0 0?-1

-46?-21 0 0?27 -1 0?-1 0 0 0 0?-27 0 0 0?-36 0 0 15 -1?-1 0 0

-47 -1?-33?11?-1?-11?-8?27?-20 -4?-38 29 17?-13?-29?-48?-12 ?4 40 -30 ?0?-1?-1 0

Matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned at last m _b-1 element

The number of the neutral element that comprises is not less than 1; Furthermore, can also be matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 1st walk to m _bBetween-1 row, comprise the 2nd row and m _bOK.

More specifically, matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=8, n _b=24:

Table 4 (a)

-17?-25 -1 -1?-26?-15 -1?-31 -3 -1?-16?-17 -1 -1 -1 -1 ?0 ?0?-1?-1?-1?-1?-1?-1

-1 -1 -5 -1 ?8 -1 -1 ?0 ?0 -1 -1 ?0 -7 -1 -5?-39 -1 ?0 0?-1?-1?-1?-1?-1

-1 -1 ?6?-22 -1 ?0 -1 ?6 -1?-25 -1 -3 -1 -2 ?5 -1 -1 -1 0 0?-1?-1?-1?-1

-1 -1 13 ?0 -1?-12 ?0 -1 -4 -1 ?0 -1 -1 -1 ?0 ?0 -1 -1?-1 0 0?-1?-1?-1

0 -1 ?0 -1 -1 -5 29 -1 -1 ?0 -1 -4 -1 34 -1 -1 95 -1?-1?-1 0 0?-1?-1

-1 -1 ?4 -1 ?0 ?6 -1 -1 -2 -1 19 -1 ?0 -1 13 ?6 -1 -1?-1?-1?-1 0 0?-1

15 0 -1 13 -1 6 -1 -1 -5 -1 -1?-18 -1 0 12 -1 -1 -1?-1?-1?-1?-1 0 0

-1?-19 0 -1 -1 -1 4 -1 4 2 -1?-15 27 -1 6 -1 0 -1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=8, n _b=24:

Table 5 (a)

-17?-25 -1 -1?-26?-15 -1?-31 -3 -1?-16?-13 -1 -1 -1 -1 ?1 ?0?-1?-1?-1?-1?-1?-1

-1 -1 -5 -1 ?8 -1 -1 ?0 ?0 -1 -1 ?4 -7 -1?-10?-39 -1 ?0 0?-1?-1?-1?-1?-1

-1 -1 ?6?-22 -1 ?0 -1 ?6 -1?-25 -1 ?1 -1 -2 ?0 -1 -1 -1 0 0?-1?-1?-1?-1

-1 -1 13 ?0 -1?-12 ?0 -1 -4 -1 ?0 -1 -1 -1 -5 ?0 -1 -1?-1 0 0?-1?-1?-1

0 -1 ?0 -1 -1 -5 29 -1 -1 ?0 -1 ?0 -1 34 -1 -1 ?0 -1?-1?-1 0 0?-1?-1

-1 -1 ?4 -1 ?0 ?5 -1 -1 -2 -1 19 -1 ?0 -1 ?8 ?6 -1 -1?-1?-1?-1 0 0?-1

15 0 -1 13 -1 6 -1 -1 -5 -1 -1?-14 -1 0 7 -1 -1 -1?-1?-1?-1?-1 0 0

-1?-19 0 -1 -1 -1 4 -1 4 2 -1?-11 27 -1 1 -1 1 -1?-1?-1?-1?-1?-1 0

Matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned in the middle of m _b-2 elements The number of the neutral element that comprises is not less than 1; Furthermore, matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 2nd walk to m _bBetween-1 row, comprise the 2nd row and m _b-1 row.

More specifically, matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=16, n _b=32:

Table 6 (a)

-68 -1 -1 -1 -1 -1 -66 -1 -1 41 -1 -1 -1?-157 92 12 ?0 0 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-155 -1 -1 -1 -1 -1 -23 -1 -1?-254 -1 -1 ?0 260 191 -1 0 0 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 15 -1 -1 -1 -1 -1 104 -1 -1 -38 -1 159?-135?-193 -1 -1 0 0 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 152 -1 -1 180 -1 -1 -1 ?0 -1 -1?-245 37 -10 -1 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

0 -1 -1 -1 -1 ?0 -1 -1 -1 -1 -1 242 -1 -82 211 175 -1 -1 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?0 -1 -1 -1?-137 -1 262 -1 -1 83?-178?-203 -1 -1 -1 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 0 -1 -1 -1 -1 -1 -1 -1 184 -1 -35 -1 250 0 -14 -1 -1 -1 -1 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1?-189 -1 -1 -1 ?0 -1 -1 -1 -1 160?-146 180 177 -1 -1 -1 -1 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -1 -1 -1 205 -1 -1 -1 ?0 25?-203?-195 135 -1 -1 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1?-228 -1 -1 -1 -1 -1 -1 ?0 -1 -1 162 198 -19 ?0 -1 -1 -1 -1 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 -1 ?0?-205 -1 -1 -1 -1 -1 -1 ?0 -1?-192 167 197 -1 -1 -1 -1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 205 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 0 ?-1 ?-1 ?-1 -73 -15?-210?-169 ?-1 -1 -1 -1 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1 -1 -1 -1 107 -1 -1 -1?-166 -1 -1 95 164 -20 32 -1 -1 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 ?0 -1 -1 -1 ?0 -1 -1 -1 -1 -1 265?-220 172 235 -1 -1 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 -1 -1 -1 119 -1 -1 212 -1 -1 -1 -1?-128 -37?-199?-125 -1 -1 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 -1 -1 -1 -1?-173 -1 -1 -1 -1 -3 -1 46 148 -3 82 ?0 -1 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=16, n _b=32:

Table 7 (a)

-1 -1 ?-1 -1 ?-1 ?55 ?-1 ?-1 ?-1 ?-5 ?-1 ?59 ?-1 ?-32 65 -47 ?0 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 42 ?-1 ?-1 ?-1 ?-1 -15 ?-1 ?-1 ?-1 -18 -186 18 141 ?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-96 0 -1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-144 ?-1 ?-1 41 ?-33 ?41 ?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 ?-1 0 ?-1 -46 ?-1 ?-1 ?-1 ?-1 ?41 -128 -189?-156 ?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1?-52 -42 ?-1 0 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 68 ?-75 l87 ?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

137?-29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 164 -97 -116 190 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 ?-1 ?-1 ?-1 0 0?-138 ?-1 ?-1 ?-1 ?-51 ?-13 ?92 ?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?25 -1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-157 -91 ?102 ?-73 0 ?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 ?-1 ?-1 -82 ?-1 ?-1 ?-1 ?60 ?-1 ?-1 39 93 100 -48?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-8 -1 ?-1 -1 ?-1 ?-1 ?-1 ?-1 ?-1 162 ?-1 ?-1?-184 17 ?174 125 ?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 ?46 ?-1 ?-1 -99 ?-1 ?-1 ?-1 0 ?-1 91 ?0 0 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 -1 ?-1 -1 ?-1?-149 ?-1 ?-1 ?-1 ?-1 0 ?-1 ?37 ?-71 ?-41?-180 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 0 -1 -1 -1 -1 12 -1 -1 ?0 -1 -1 -1 -142 ?69?-120 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1?-174 ?0 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 0 60 79 -52 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

0 -1 ?-1 -1 0 ?-1 ?-1 ?-1 ?61 ?-1 ?-1 ?-1 ?-1 ?0 -2 ?88 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1?141 -1 -1 -1 -1 -1 17 -1 -1 -1 -1 -63 -11 16?1 57 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=16, n _b=32:

Table 8 (a)

-1?-229 15?-243 -1?-178 -1 177 -1 -1 -1 -1 -1 96 -1 -1 ?0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 0 -81 -88?-254 ?-1 ?-1 ?-1 ?55 ?-1 ?-1 ?-1 150 ?-1 ?-1 ?-1 ?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-131?-158 185 ?-1 ?-1 267 ?-1 ?-1 0 ?-1 ?-1 ?-1?-241 ?-1 ?-1 ?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

0?-171 113 -93 -19 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 120 ?-1 ?-1 ?-1 ?-1 ?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 44 83 221 -1 14 -1 -1 -1 -1 297 -1 -1 -1 -1 ?0 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-233 284 121 ?33 ?-1 ?-1?-150 ?-1 ?-1 ?-1 0 ?-1 ?-1 ?-1 ?-1 ?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-138 -10 265 ?-1 ?-1?-204 ?-1 298 ?-1 0 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 301 ?20 106 ?85 ?-1 ?-1 ?-1 ?-1?-246 ?-1 ?-1 ?-1 ?-1 0 ?-1 ?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-2?-223 222?-183 ?-1 ?-1 ?-1 ?-1 ?54 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 135?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 149 ?97 0 220?-135 ?-1 ?-1 ?-1 ?78 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

204?-204?-116 -71 ?-1 ?-1 ?-1 -35 ?-1 ?-1 ?-1 ?-1 0 ?-1 ?-1 ?-1 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 0?-319 268 -15 ?-1 0 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 0 ?-1 ?-1 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 158 0?-280 ?-1 ?-1 ?-1 0 0 ?-1 ?-1 ?-1 ?-1 ?-1 ?25 ?-1 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1?-310?-203 -24 0 ?-1 -35 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 -74 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1?-261?-110?-245 -1 ?0 -1 -1 -1 -1 -1?-251 -1 -1?-297 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 99?-153 56?-176 -1 -1 -1 -1 -1?-169 -1?-184 -1 -1 -1 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=8, n _b=24:

Table 9 (a)

-21 -1 19 -1 32 -1 18 -1 47 -1?-30 -1 13 -1?-47 -1 ?0 0?-1?-1?-1?-1?-1?-1

-1 39 -1 23 -1?-21 -1?-24 -1 16 -1 ?0 -1?-34 -1 11 -1 0 0?-1?-1?-1?-1?-1

-13 -1?-10 -1 47 -1 -2 -1 ?0 -1 ?0 -1 ?0 -1 11 -1 -1?-1 0 0?-1?-1?-1?-1

-1 -2 -1?-33 -1 27 -1 ?0 -1 -8 -1?-32 -1?-18 -1 ?0 -1?-1?-1 0 0?-1?-1?-1

0 -1 29 -1 ?0 -1 ?0 -1?-19 -1 ?8 -1 16 -1 ?0 -1 -1?-1?-1?-1 0 0?-1?-1

-1 0 -1 0 -1 0 -1?-13 -1 0 -1 -7 -1 0 -1?-37 -1?-1?-1?-1?-1 0 0?-1

9 -1 ?0 -1 ?0 -1 26 -1 ?0 -1?-11 -1?-28 -1?-10 -1 ?1?-1?-1?-1?-1?-1 0 0

-1?-30 -1?-18 -1?-41 -1 34 -1?-12 -1 18 -1 ?4 -1 ?4 ?0?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=18, m _b=6, n _b=24:

Table 10 (a)

31?-23?-16 9 -1 -1 -1?-34?-25 -1?25 -1 13?-7?-20?-21 -1 14 0 0?-1?-1?-1?-1

-9 33 ?0 ?0 -1 19 23 -1 16 -1?-1?-47 -1 0 ?0 ?0 ?0 -1 -1 0 0?-1?-1?-1

0 -1 36 -1 ?0 -7?-10 15 -1?-40?-1 -1?-14?-1 -2 23 40?-46 -1?-1 0 0?-1?-1

-33 0 -1?-18 -3 0 -8 0 -1 17 0 0 -1?-1 -1 -1?-31 0?-48?-1?-1 0 0?-1

-1 -1 -1 -1 20?-21 ?0 16 ?0 ?0?41 ?8 ?0?45 20?-12 -1 -1 -1?-1?-1?-1 0 0

-1 2 12 4 8 -1 -1 -1 7 18?-5?-27 47 8 -1 -1 -3 -6 0 -1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=18, m _b=6, n _b=24:

Table 11 (a)

-1?-17 -1?-40 -1 -1?-25 22?-34 -1 -1?-22 ?31?-20?-21 38?-38?-23 ?0 0?-1?-1?-1?-1

-22 -1 -6 ?0 ?0 -1 -1 -1 -1 ?0 ?0 ?0 ?38?-32 30 ?0?-22 ?5 -1 0 0?-1?-1?-1

-1 -1 ?0 -1 -1 37 ?0 -1 19 -3 -1 27 6 ?0 44?-28 ?0?-14?-16?-1 0 0?-1?-1

0 0 -1 -1 31 -1 -1 0 0 -1 38 4 ?0 33?-14?-21?-46 0 -1?-1?-1 0 0?-1

-1?-45 40 12 -1 ?0 36 -1 -1 -1 -1 -21?-17 25 ?0 15 ?0 ?6 -1?-1?-1?-1 0 0

13 -1 -1 -1?-17 ?2 -1 32 -1 ?2?-13 -39 -9 12 23 ?7 47?-26 ?0?-1?-1?-1?-1 0

Obviously, all there is the multiple form of expression in each in above-mentioned matrix table 2 (a) to the table 11 (a) that the present invention proposes, as the specific embodiment of a certain matrix in above-mentioned matrix table 2 (a) to the table 11 (a), a kind of concrete modular matrix H _BmFor:

Table 12 (b)

-1?-10 -1 -1 ?0 -1 -1 36 -1 -1 -1?-13 ?0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -5 -1 -1 -1 12 -1?-34 -2 -1 16 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 ?0 -1 -1 ?0 -1?-10?-39?-29 -1 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 0 -1 -1?-26 0 -1?-22 -1 -1 -1 -1 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

0 -1 0- ?1?-34 -1 -1 -6 -1 -1 -1 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 24 -1 -1?-17 -1 39 16 -1 -1 -7?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

42 -1 -1 -1 22 -1 -1?-33 -1 -1 ?0 -1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 -1 14 -1 ?0 -1 -1 ?0 -1 -1 -1 ?0 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1 -1?-35 -1 47?-45 -1 ?0 ?0 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-2 -1 -1 -1 -1 -1?-24 -1 16?-26 -1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1?-26 -1 -1 30 -1 -1 ?2 -1 -1 12 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 -1 -1 -1 -1?-18 26 -1 -2 42 -1 -1 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 13 (b)

36 15?-26 -5?-43 -1 7?-28 ?0 28 18 24 -9?-16?12?-43?-1 19 33?-19 0 0?-1?-1

0 24 ?0 46 16 -9 0 -1 -1?-44 -6?-34?-40 -1 0 ?0?32 ?0?-18 ?0?16 0 0?-1

-36 0?-27 0 0 0?27 0?-46 0 0 0 0 0?-1 -1 0?-21 0 15?-1?-1 0 0

-12?-29 17?-38?-20 -8?-1?-33?-47 ?4?-48?-13 29 -4?27?-11?11 -1 40?-30 0?-1?-1 0

Perhaps said matrix H _BmFor:

Table 14 (b)

-1?-1?-16?-3?-1?-26?-1?-17 -1?-1?-17 -1?-31 -15?-1?-25 0 0?-1?-1?-1?-1?-1?-1

-5?-7 -1 0?-1 ?8?-5 -1?-39?-1 ?0 -1 ?0 -1 -1 -1?-1 0 0?-1?-1?-1?-1?-1

5?-1 -1?-1?-1 -1 6 -1 -1?-2 -3?-25 ?6 ?0?-22 -1?-1?-1 0 0?-1?-1?-1?-1

0?-1 0?-4 0 -1?13 -1 0?-1 -1 -1 -1?-12 0 -1?-1?-1?-1 0 0?-1?-1?-1

-1?-1 -1?-1?29 -1 0 ?0 -1?34 -4 ?0 -1 -5 -1 -1?95?-1?-1?-1 0 0?-1?-1

13 0 19?-2?-1 ?0 4 -1 ?6?-1 -1 -1 -1 ?5 -1 -1?-1?-1?-1?-1?-1 0 0?-1

12?-1 -1?-5?-1 -1?-1 15 -1 0?-18 -1 -1 ?6 13 ?0?-1?-1?-1?-1?-1?-1 0 0

6?27 -1 4 4 -1 0 -1 -1?-1?-15 ?2 -1 -1 -1?-19 0?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 15 (b)

-1?-1?-16?-3?-1?-26?-1?-17 -1?-1?-13 -1?-31?-15 -1?-25 1 0?-1?-1?-1?-1?-1?-1

-10?-7 -1 0?-1 ?8?-5 -1?-39?-1 ?4 -1 ?0 -1 -1 -1?-1 0 0?-1?-1?-1?-1?-1

0?-1 -1?-1?-1 -1 6 -1 -1?-2 ?1?-25 ?6 ?0?-22 -1?-1?-1 0 0?-1?-1?-1?-1

-5?-1 0?-4 0 -1?13 -1 0?-1 -1 -1 -1?-12 0 -1?-1?-1?-1 0 0?-1?-1?-1

-1?-1 -1?-1?29 -1 0 ?0 -1?34 ?0 ?0 -1 -5 -1 -1 0?-1?-1?-1 0 0?-1?-1

8?01 9?-2?-1 0 4 -1 6?-1 -1 -1 -1 5 -1 -1?-1?-1?-1?-1?-1 0 0?-1

7?-1 -1?-5?-1 -1?-1 15 -1 0?-14 -1 -1 ?6 13 ?0?-1?-1?-1?-1?-1?-1 0 0

1?27 -1 4 4 -1 0 -1 -1?-1?-11 ?2 -1 -1 -1?-19 1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 16 (b)

-1 -1?-66 -1 -1 -68 -1 41 -1 -1 -1 -1 12 92?-157 -1 ?0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-254 -1 -1 -1 -1 -1 -1 -1 -23 -1 -1?-155 191 260 ?0 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 104 -1 ?-1 ?15 ?-1 -38 ?-1 ?-1 ?-1 ?-1 ?-1?-193?-135 159 ?-1 ?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

0 -1?180 -1 -1 -1 -1 -1 -1 -1 152 -1 -10 37?-245 -1 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 ?0 242 -1 -1 ?0 -1 -1 175 211 -82 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

262?-137 -1 ?0- 1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-203?-178 ?83 ?-1 ?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -1 -35 184 -1 -1 -1 ?0 -14 ?0 250 -1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -1 -1 -1 ?0 -1?-189 -1 177 180?-146?-160 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 205 -1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-195?-203 ?25 0 135?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1?-228 -1 -1 ?0 -1 -1 -1 -1 ?0 -19 198 162 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 -1?-205 -1 -1 ?0 -1 -1 -1 ?0 -1 197 167?-192 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 0 -1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 205?-169?-210 -15 -73 ?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1 -1 -1 -1 -1 -1?-166 -1 107 -1 -1 32 -20 164 95 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 0 -1 ?0 -1 -1 -1 -1 -1 -1 -1 235 172?-220 265 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 -1 -1 119 -1 -1 -1 -1 212 -1 -1 -1?-125?-199 -37?-128 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-3 -1 -1 -1 -1 -1 -1 -1 -1?-173 -1 -1 82 -3 148 46 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 17 (b)

-1 -1 -1 -1 ?-1 ?-1 ?59 ?-5 ?-1 ?55 -1 -1 -47 ?65 ?-32 -1 ?0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-15 -1 -1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 42 -1 141 ?18 -186 ?-18 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-144 -1 -1 -1 0 ?-1 ?-1 ?-1 ?-1 ?-1 -1?-96 ?41 -33 41 -1 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?-1 ?-1 ?-1 ?-1 -46 0 -1 -1?-156?-189 -128 41 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?0?-42 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-52 -1 187 -75 68 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?-1 137 ?-1 ?-1 ?-1 ?-1 -1?-29 190?-116 ?-97 ?164 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 0 -1 -1 -1 -1 -1?-138 ?0 -1 -1 -1 92 -13 -51 ?-1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?25 ?-1?-157 ?-1 ?-1 -1 ?-1 ?-1 ?0 -73 ?102 ?-91 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

60 -1?-82 -1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 -1 -1 100 ?93 39 -1?-48?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?-1 ?-8 ?-1 162 ?-1 ?-1 -1 -1 125 174 17 -184 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 -1 46 ?-1 ?-1 0 ?-1 -99 ?-1 -1 -1 0 0 91 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

0 -1 -1 -1 ?-1 ?-1 ?-1 ?-1 ?-1?-149 -1 -1?-180 -41 ?-71 37 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1 12 -1 ?-1 ?-1 ?-1 0 ?-1 ?-1 -1 ?0?-120 ?69 -142 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 -1 -1?-174 ?-1 ?-1 ?-1 ?-1 ?-1 ?0 -1 -52 ?79 60 ?0 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 61 -1 ?0 ?-1 0 ?-1 ?-1 ?-1 ?-1 -1 -1 ?88 ?-2 ?0 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 -1 -1 -1 ?-1 ?-1 ?-1 ?-1 ?17 ?-1 -1?141 ?57 161 ?-11 ?-63 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 18 (b)

-1 -1 -1 -1 -1 -1 -1 96 -1 -1 177?-178 -1?-243 15?-229 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 150 ?-1 55 ?-1?-254 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 -88 -81 0 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 267 -1 -1?-241 -1 ?0 -1 -1 -1 185?-158?-131 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -19 -1 -1 120 -1 -1 -1 ?0 -93 113?-171 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 297 -1 -1 -1 ?0 -1 -1 -1 -1 14 -1 221 83 44 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 33 -1 -1 ?0 -1?-150 -1 -1 121 284?-233 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?0?298?-204 -1 -1 -1 -1 -1 -1 -1 -1 265 -10?-138 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

0 -1 -1 -1 -1 85 -1 -1 -1?-246 -1 -1 -1 106 20 301 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 54 -1 -1 -1 -1 -1 -1 -1 -1 -2?-183 222?-223?135?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 220 -1 -1 -1 78 -1?-135 -1 ?0 97 149 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 0 -1 -1 -1 -1 -1 -1 -1 -1 -35 -1 204 -71?-116?-204 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 -1 -1 -1 ?0 -15 -1 ?0 -1 -1 -1 -1 -1 268?-319 ?0 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

25 -1 -1 0 -1 -1 -1 -1 -1 -1 ?0 -1 -1?-280 ?0 158 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 -1 -1?-35 0 -74 -1 -1 -1 -1 -1 -1 -24?-203?-310 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-297 -1 -1 -1 -1 -1 -1 -1?-251 -1 -1 ?0 -1?-245?-110?-261 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1?-184?-169 -1 ?-1?-176 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?56?-153 ?99 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 19 (b)

-47?13?-30 47?18?32 19?-21 -1 -1 -1 -1 -1 -1 -1 -1 0 0?-1?-1?-1?-1?-1?-1

-1?-1 -1 -1?-1?-1 -1 -1 11 -34 0 16?-24?-21 23 39?-1 0 0?-1?-1?-1?-1?-1

11 0 ?0 ?0?-2?47?-10?-13 -1 -1 -1 -1 -1 -1 -1 -1?-1?-1 0 0?-1?-1?-1?-1

-1?-1 -1 -1?-1?-1 -1 -1 ?0?-18?-32 -8 ?0 27?-33 -2?-1?-1?-1 0 0?-1?-1?-1

0?16 8?-19 0 0 29 0 -1 -1 -1 -1 -1 -1 -1 -1?-1?-1?-1?-1 0 0?-1?-1

-1?-1 -1 -1?-1?-1 -1 -1?-37 ?0 -7 ?0?-13 ?0 ?0 ?0?-1?-1?-1?-1?-1 0 0?-1

-10?-28?-11 0?26 0 ?0 ?9 -1 -1 -1 -1 -1 -1 -1 -1 1?-1?-1?-1?-1?-1 0 0

-1?-1 -1 -1?-1?-1 -1 -1 ?4 ?4 18?-12 34?-41?-18?-30 0?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 20 (b)

-1?-20 13 25?-25 -1 -1?-16 31 14?-21 -7 -1 -1?-34 -1 ?9?-23 ?0 0?-1?-1?-1?-1

0 0 -1 -1 16 23 -1 0 -9 -1 0 0?-47 -1 -1 19 0 33 -1 0 0?-1?-1?-1

40 -2?-14 -1 -1?-10 ?0 36 ?0?-46 23 -1 -1?-40 15 -7 -1 -1 -1?-1 0 0?-1?-1

-31 -1 -1 ?0 -1 -8 -3 -1?-33 ?0 -1 -1 ?0 17 ?0 ?0?-18 ?0?-48?-1?-1 0 0?-1

-1 20 ?0 41 ?0 ?0 20 -1 -1 -1 -12?45 ?8 ?0 16?-21 -1 -1 -1?-1?-1?-1 0 0

-3 -1 47 -5 ?7 -1 ?8 12 -1 -6 -1 ?8?-27 18 -1 -1 ?4 ?2 ?0?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

Table 21 (b)

-38?-21 31 -1?-34?-25 -1 -1 -1?-23 38?-20 -22 -1 22?-1?-40?-17 ?0 0?-1?-1?-1?-1

-22 30 38 ?0 -1 -1 ?0 -6?-22 ?5 ?0?-32 0 ?0 -1?-1 ?0 -1 -1 0 0?-1?-1?-1

0 44 ?6 -1 19 ?0 -1 ?0 -1?-14?-28 ?0 ?27 -3 -1?37 -1 -1?-16?-1 0 0?-1?-1

-46 -14 0 38 ?0 -1 31 -1 ?0 ?0?-21 33 4 -1 ?0?-1 -1 ?0 -1?-1?-1 0 0?-1

0 0 -17 -1 -1 36 -1 40 -1 ?6 15 25 -21 -1 -1 0 12?-45 -1?-1?-1?-1 0 0

47 23 -9?-13 -1 -1?-17 -1 13?-26 ?7 12 -39 ?2 32 2 -1 -1 ?0?-1?-1?-1?-1 0

S102: use adjusted modular matrix H _Bmf, expansion generates check matrix H.

Confirm modular matrix H according to step S101 _BmAfter, expansion generates the check matrix H to input information.Extended mode is the submatrix P in the check matrix H _{I, j}(value j) is expanded for f, i, each submatrix P according to p _{I, j}Size be z _f* z _f, (value j) is-1 o'clock corresponding submatrix P to p for f, i _{I, j}Be full null matrix, (value j) is 0 o'clock corresponding submatrix P to p for f, i _{I, j}Be unit matrix, (value j) is a positive integer to p for f, i The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift to the right

(value j) is a negative integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift left

S103: use check matrix H, input information is encoded.

According to the check matrix H that step S102 obtains, input information is encoded.Input information U is carried out following computing,

Wherein, and u (j) (j=1 ..., k _b) represent the j of encoder input information U to organize bit, v (i) (i=1 ..., m _b) represent the i of the coded message V of encoder output to organize bit, every group of number of bits is z _f,

The expression submatrix

Inverse matrix, 1≤x≤m _b

The said method that the present invention proposes is through increasing modular matrix H _BmThe quantity of neutral element can reduce the coding of LDPC sign indicating number and the processing complexity and the implementation complexity of decoding, improves the processing speed of coding and decoding.For example, with respect to compare the table 2 (a) and the encoder matrix of table 2 (b) that use the present invention to propose, calculating modular matrix H with the encoder matrix of the WiMAX of table 1 _BmfThe complexity of the complicated function of the formula of element reduces by 25% relatively, and the whole coding computation complexity of the coding method that the present invention proposes can reduce by 9.6% relatively.In addition, the present invention correspondingly reduces decoder expanded mode matrix, generates the processing complexity of check matrix, improves the decoding processing speed, also makes memory and hardware spending further reduce by 12.5%.。

As shown in Figure 3, the invention allows for a kind of encoder 300 of LDPC sign indicating number, comprise matrix adjusting module 310, matrix changes module, matrix stores module 330 and coding module 340.

Wherein, matrix adjusting module 310 is used for according to spreading factor z _fAdjustment modular matrix H _BmElement, generate adjusted modular matrix H _BmfAnd be stored in matrix stores module 330, matrix H _BmBe m _bRow, n _bThe matrix of row, matrix H _BmIn element p (i, value j) is-1,0 or Integer n, matrix H _BmThe number of neutral element be not less than m _b+ n _b-1, matrix H _BmfIn element

Wherein

It is right to represent

Round m to zero _b, n _b, j, i, z _f, z ₀Be positive integer, and 1≤i≤m _b, 1≤j≤n _b, z _f≤z ₀Matrixing module 320 is used for according to matrix H _BmfExpansion generates check matrix H and is stored in matrix stores module 330, and extended mode is the submatrix P in the check matrix H _{I, j}(value j) is expanded for f, i, each submatrix P according to p _{I, j}Size be z _f* z _f, (value j) is-1 o'clock corresponding submatrix P to p for f, i _{I, j}Be full null matrix, (value j) is 0 o'clock corresponding submatrix P to p for f, i _{I, j}Be unit matrix, (value j) is a positive integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift to the right (value j) is a negative integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift left

Coding module 340 is used for according to check matrix H input information U being encoded, output coding information V; Matrix stores module 330 is used for the required matrix H of memory encoding _Bm, H _BmfAnd H.

As embodiments of the invention, encoder 300 employed matrix H _BmComprise n _bIndividual column vector $H_{\mathrm{Bm}}=[h_1,\·\·\·,h_{n_b}],$ Each column vector h wherein _i(i=1 ..., n _b) comprise m _bIndividual element, each column vector h _i(i=1 ..., n _b) number of the neutral element that comprises is not less than 1.

As embodiments of the invention, matrix H _BmComprise matrix H _Bm ^SAnd matrix H _Bm ^P, $H_{\mathrm{Bm}}=\left[\begin{array}{cc}{H}_{\mathrm{Bm}}^S,& H_{\mathrm{Bm}}^P\end{array}\right],$ H wherein _Bm ^SSystematic bits part corresponding to check matrix H comprises matrix H _BmThe m on the left side _bRow, k _bThe element of row, H _Bm ^PCheck bit part corresponding to check matrix H comprises matrix H _BmThe m on the right _bRow, m _bThe element of row, matrix H _BmThe number of neutral element be not less than 2m _b+ k _b-1 or 2n _b-k _b-1.

As embodiments of the invention, encoder 300 employed matrix H _BmColumn vector h _i(i=1 ..., k _bThe number of the neutral element that+1) comprises is not less than 1, column vector h _i(i=k _b+ 2 ..., n _b) number of the neutral element that comprises is 2.

As embodiments of the invention, encoder 300 employed matrix H _BmAlso comprise table 2 (a) to table 11 (a), the shown matrix H of table 12 (b) to table 21 (b) _BmEmbodiment.

The said equipment that the present invention proposes is through increasing modular matrix H _BmThe quantity of neutral element can reduce the coding of LDPC sign indicating number and the processing complexity and the implementation complexity of decoding, improves the processing speed of coding and decoding.The modular matrix H that the present invention proposes _BmThe element value can be-1,0 and positive integer, can also be for less than-1 negative positive number, make that unit matrix can also two-way cyclic shift, both supported cyclic shift to the right, also support cyclic shift left, increased the flexibility of encoding process.In addition, modular matrix H _BmThe absolute value of element value can also become littler, modular matrix H like this _BmThe quantization bit of element parameter value can reduce, deposit memory expense and the hardware spending in the above-mentioned encoder thereby save, reduce implementation complexity.

The above only is a preferred implementation of the present invention; Should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; Can also make some improvement and retouching, these improvement and retouching also should be regarded as protection scope of the present invention.

Claims (19)

1. the coding method of a LDPC sign indicating number is characterized in that, may further comprise the steps:

Use spreading factor z _fAdjustment modular matrix H _BmElement, generate adjusted modular matrix H _Bmf, said matrix H _BmBe m _bRow, n _bThe matrix of row, said matrix H _BmIn element p (i, value j) is-1,0 or Integer n, said matrix H _BmThe number of neutral element be not less than m _b+ n _b-1, said matrix H _BmfIn element

Wherein

It is right to represent

Round m to zero _b, n _b, j, i, z _f, z ₀Be positive integer, and 1≤i≤m _b, 1≤j≤n _b, z _f≤z ₀

Use said matrix H _BmfExpansion generates check matrix H, and extended mode is the submatrix P in the check matrix H _{I, j}(value j) is expanded for f, i, each submatrix P according to p _{I, j}Size be z _f* z _f, (value j) is-1 o'clock corresponding submatrix P to p for f, i _{I, j}Be full null matrix, (value j) is 0 o'clock corresponding submatrix P to p for f, i _{I, j}Be unit matrix, (value j) is a positive integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift to the right

(value j) is a negative integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift left

Use said check matrix H that input information U is encoded, output coding information V.

2. the coding method of LDPC sign indicating number as claimed in claim 1 is characterized in that, said matrix H _BmComprise n _bIndividual column vector $H_{\mathrm{Bm}}=[h_1,\·\·\·,h_{n_b}],$ Each column vector h wherein _i(i=1 ..., n _b) comprise m _bIndividual element, each column vector h _i(i=1 ..., n _b) number of the neutral element that comprises is not less than 1.

3. the coding method of LDPC sign indicating number as claimed in claim 2 is characterized in that, said matrix H _BmComprise matrix H _Bm ^SAnd matrix H _Bm ^P, $H_{\mathrm{Bm}}=\left[\begin{array}{cc}{H}_{\mathrm{Bm}}^S,& H_{\mathrm{Bm}}^P\end{array}\right],$ H wherein _Bm ^SSystematic bits part corresponding to check matrix H comprises matrix H _BmThe m on the left side _bRow, k _bThe element of row, H _Bm ^PCheck bit part corresponding to check matrix H comprises matrix H _BmThe m on the right _bRow, m _bThe element of row, said matrix H _BmThe number of neutral element be not less than 2m _b+ k _b-1 or 2n _b-k _b-1.

4. the coding method of LDPC sign indicating number as claimed in claim 3 is characterized in that, said column vector h _i(i=1 ..., k _bThe number of the neutral element that+1) comprises is not less than 1, column vector h _i(i=k _b+ 2 ..., n _b) number of the neutral element that comprises is 2.

5. like the coding method of the described LDPC sign indicating number of one of claim 3 to 4, it is characterized in that, use said check matrix H that input information U is encoded and may further comprise the steps: input information U is carried out following computing,

Wherein, and u (j) (j=1 ..., k _b) represent the j of encoder input information U to organize bit, v (i) (i=1 ..., m _b) represent the i of the coded message V of encoder output to organize bit, every group of number of bits is z _f,

The expression submatrix

Inverse matrix, 1≤x≤m _b

6. the coding method of LDPC sign indicating number as claimed in claim 5 is characterized in that, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned at before m _b-1 element

The number of the neutral element that comprises is not less than 1.

7. the coding method of LDPC sign indicating number as claimed in claim 6 is characterized in that, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 1st walk to m _bBetween-1 row, comprise the 1st row and m _b-1 row.

8. the coding method of LDPC sign indicating number as claimed in claim 7 is characterized in that,

Said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=12, m _b=12, n _b=24:

-1?-13 0 -1 -1 -1 -1 -1?-10 36 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 16 -1 -1 -1 -2 -5?-34 -1 -1 -1 12?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1?-29 ?0?-39 -1?-10 -1 -1 -1 ?0?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

0 -1?-26 -1 -1 -1 -1 -1 ?0?-22 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1?-34 -1 -1 -1 ?0 -1 -1 -6 ?0 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 24 16 -1 39 -1 -1 -1?-17?-7?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 22 ?0 -1 -1 -1 -1 -1?-33 42 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 0 0 -1 -1 -1 14 -1 -1 0 -1 -1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

47 -1 -1 -1?-35 ?0 -1 ?0 -1 -1 -1?-45?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 -1 -1 -1?-26 -1 16 -1 -1 -2?-24?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 -1 30 12 -1 -1 -1 -1?-26 ?2 -1 -1?-1?-1?-1?-l?-1?-1?-1?-1?-1?-1 0 0

-18 -1 -1 -1 -1 42 -1 -2 -1 -1 -1 26 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=20, m _b=4, n _b=24:

0 19?-28?-1 7?-43?-1?12?-43?-16 -5 -9?-26 24 15 18 36 28 33?-19 0 0?-1?-1

-1 0 -1?32 0 0?-9 0 16 -1 46?-40 0?-34 24 -6 0?-44?-18 0?16 0 0?-1

-46?-21 0 0?27 -1 0?-1 0 0 0 0?-27 0 0 0?-36 0 0 15?-1?-1 0 0

-47 -1?-33?11?-1?-11?-8?27?-20 -4?-38 29 17?-13?-29?-48?-12 ?4 40?-30 0?-1?-1 0

9. the coding method of LDPC sign indicating number as claimed in claim 5 is characterized in that, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned at last m _b-1 element

The number of the neutral element that comprises is not less than 1.

10. the coding method of LDPC sign indicating number as claimed in claim 9 is characterized in that, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 1st walk to m _bBetween-1 row, comprise the 2nd row and m _bOK.

11. the coding method of LDPC sign indicating number as claimed in claim 10 is characterized in that,

Said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=8, n _b=24:

-17?-25?-1 -1?-26?-15?-1?-31?-3 -1?-16?-17?-1?-1?-1 -1 0 0?-1?-1?-1?-1?-1?-1

-1 -1?-5 -1 ?8 -1?-1 ?0 0 -1 -1 ?0?-7?-1?-5?-39?-1 0 0?-1?-1?-1?-1?-1

-1 -1 6?-22 -1 ?0?-1 ?6?-1?-25 -1 -3?-1?-2 5 -1?-1?-1 0 0?-1?-1?-1?-1

-1 -1?13 ?0 -1?-12 0 -1?-4 -1 ?0 -1?-1?-1 0 ?0?-1?-1?-1 0 0?-1?-1?-1

0 -1 0 -1 -1 -5?29 -1?-1 ?0 -1 -4?-1?34?-1 -1?95?-1?-1?-1 0 0?-1?-1

-1 -1 4 -1 ?0 ?5?-1 -1?-2 -1 19 -1 0?-1?13 ?6?-1?-1?-1?-1?-1 0 0?-1

15 0?-1 13 -1 6?-1 -1?-5 -1 -1?-18?-1 0?12 -1?-1?-1?-1?-1?-1?-1 0 0

-1?-19 0 -1 -1 -1 4 -1 4 ?2 -1?-15?27?-1 6 -1 0?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=8, n _b=24:

-17?-25?-1 -1?-26?-15?-1?-31?-3 -1?-16?-13?-1?-1 -1 -1 1 0?-1?-1?-1?-1?-1?-1

-1 -1?-5 -1 ?8 -1?-1 ?0 0 -1 -1 ?4?-7?-1?-10?-39?-1 0 0?-1?-1?-1?-1?-1

-1 -1 6?-22 -1 ?0?-1 ?6?-1?-25 -1 ?1?-1?-2 ?0 -1?-1?-1 0 0?-1?-1?-1?-1

-1 -1?13 ?0 -1?-12 0 -1?-4 -1 ?0 -1?-1?-1 -5 ?0?-1?-1?-1 0 0?-1?-1?-1

0 -1 0 -1 -1 -5?29 -1?-1 ?0 -1 ?0?-1?34 -1 -1 0?-1?-1?-1 0 0?-1?-1

-1 -1 4 -1 ?0 ?5?-1 -1?-2 -1 19 -1 0?-1 ?8 ?6?-1?-1?-1?-1?-1 0 0?-1

15 0?-1 13 -1 6?-1 -1?-5 -1 -1?-14?-1 0 7 -1?-1?-1?-1?-1?-1?-1 0 0

-1?-19 0 -1 -1 -1 4 -1 4 ?2 -1?-11?27?-1 ?1 -1 1?-1?-1?-1?-1?-1?-1 0

12. the coding method of LDPC sign indicating number as claimed in claim 5 is characterized in that, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ Column vector h _i(i=1 ..., k _b) be positioned in the middle of m _b-2 elements

The number of the neutral element that comprises is not less than 1.

13. the coding method of LDPC sign indicating number as claimed in claim 12 is characterized in that, said matrix $H_{\mathrm{Bm}}^S=[h_1,\·\·\·,h_{k_b}]$ The position of neutral element be to be positioned at H _Bm ^SThe 2nd walk to m _bBetween-1 row, comprise the 2nd row and m _b-1 row.

14. the coding method of LDPC sign indicating number as claimed in claim 13 is characterized in that,

Said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=16, n _b=32:

-68 -1 -1 -1 -1 -1?-66 -1 -1 41 -1 -1 -1?-157 92 12 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-155 -1 -1 -1 -1 -1?-23 -1 -1?-254 -1 -1 ?0 260 191 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 15 -1 -1 -1 -1 -1 104 -1 -1?-38 -1 159?-135?-193 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 152 -1 -1?180 -1 -1 -1 ?0 -1 -1?-245 37 -10 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

0 -1 -1 -1 -1 ?0 -1 -1 -1 -1 -1?242 -1 -82 211 175 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?0 -1 -1 -1?-137 -1 262 -1 -1 83?-178?-203 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 0 -1 -1 -1 -1 -1 -1 -1 184 -1?-35 -1 250 0 -14 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1?-189 -1 -1 -1 0 -1 -1 -1 -1?-160?-146 180 177 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -1 -1 -1 205 -1 -1 -1 ?0 25?-203?-195?135?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1?-228 -1 -1 -1 -1 -1 -1 ?0 -1 -1 162 198 -19 ?0 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 -1 ?0?-205 -1 -1 -1 -1 -1 -1 0 -1?-192 167 197 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 205 ?-1 ?-1 ?-1 ?-1 -1 -1 0 ?-1 ?-1 -1 -73 -15?-210?-169 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1 -1 -1 -1 107 -1 -1 -1?-166 -1 -1 95 164 -20 32 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 ?0 -1 -1 -1 0 -1 -1 -1 -1 -1 265?-220 172 235 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 -1 -1 -1 119 -1 -1?212 -1 -1 -1 -1?-128 -37?-199?-125 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 -1 -1 -1 -1?-173 -1 -1 -1 -1 -3 -1 46 148 -3 82 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=16, n _b=32:

-1 -1 ?-1 -1 -1 ?55 -1 -1 ?-1 -5 ?-1 ?59 ?-1 -32 ?65 -47 ?0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 42 -1 ?-1 -1 -1?-15 ?-1 ?-1 ?-1 -18?-186 ?18 141 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-96 0 -1 -1 ?-1 -1 -1 -1 ?-1?-144 ?-1 ?-1 ?41 -33 ?41 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 -1 0 -1?-46 -1 ?-1 ?-1 ?-1 ?41?-128?-188?-156 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1?-52?-42 ?-1 ?0 -1 -1 ?-1 ?-1 ?-1 ?-1 ?68 -75 187 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

137?-29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 164 -97?-116 190 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 -1 ?-1 -1 ?0 ?0?-138 ?-1 ?-1 ?-1 -51 -13 ?92 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?25 -1 -1 ?-1 -1 -1 -1 ?-1 ?-1?-157 -91 102 -73 0 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 -1 ?-1?-82 -1 -1 ?-1 ?60 ?-1 ?-1 ?39 ?93 100?-48?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-8 -1 ?-1 -1 -1 ?-1 -1 -1 -1 162 ?-1 ?-1?-184 ?17 174 125 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 ?-1 -1 46 ?-1 -1?-99 -1 ?-1 ?-1 0 ?-1 ?91 0 0 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 -1 ?-1 -1 -1?-149 -1 -1 -1 ?-1 0 ?-1 ?37 -71 -41?-180 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 0 -1 -1 -1 -1 12 -1 -1 ?0 -1 -1 -1?-142 69?-120 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1?-174 ?0 -1 ?-1 -1 -1 -1 ?-1 ?-1 ?-1 0 ?60 ?79 -52 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

0 -1 ?-1 -1 ?0 ?-1 -1 -1 61 ?-1 ?-1 ?-1 ?-1 0 ?-2 ?88 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1?141 -1 -1 -1 -1 -1 17 -1 -1 -1 -1 -63 -11 161 57 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=16, n _b=32:

-1?-229 15?-243 -1?-178 -1 177 -1 -1 -1 -1 -1 96 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 0 -81 -88?-254 ?-1 ?-1 ?-1 ?55 ?-1 ?-1 ?-1 150 ?-1 ?-1 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-131?-158 185 ?-1 ?-1 267 ?-1 ?-1 0 ?-1 ?-1 ?-1?-241 ?-1 -1 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

0?-171 113 -93 -19 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 120 ?-1 ?-1 ?-1 -1 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 44 83 221 -1 14 -1 -1 -1 -1 297 -1 -1 -1 -1 0 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-233 284 121 ?33 ?-1 ?-1?-150 ?-1 ?-1 ?-1 0 ?-1 ?-1 ?-1 -1 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-138 -10 265 ?-1 ?-1?-204 ?-1 298 ?-1 0 ?-1 ?-1 ?-1 ?-1 -1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 301 ?20 106 ?85 ?-1 ?-1 ?-1 ?-1?-246 ?-1 ?-1 ?-1 ?-1 0 -1 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-2?-223 222?-183 ?-1 ?-1 ?-1 ?-1 ?54 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 -1?135?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 149 ?97 0 220?-135 ?-1 ?-1 ?-1 ?78 ?-1 ?-1 ?-1 ?-1 ?-1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

204?-204?-116 -71 ?-1 ?-1 ?-1 -35 ?-1 ?-1 ?-1 ?-1 0 ?-1 ?-1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 0?-319 268 -15 ?-1 0 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 0 ?-1 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 158 0?-280 ?-1 ?-1 ?-1 0 0 ?-1 ?-1 ?-1 ?-1 ?-1 ?25 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1?-310?-203 -24 0 ?-1 -35 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1 ?-1?-74 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1?-261?-110?-245 -1 ?0 -1 -1 -1 -1 -1?-251 -1 -1?-297 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 99?-153 56?-176 -1 -1 -1 -1 -1?-169 -1?-184 -1 -1 -1 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=16, m _b=8, n _b=24:

-21 -1 19 -1 32 -1?18 -1 47 -1?-30 -1 13 -1?-47 -1 0 0?-1?-1?-1?-1?-1?-1

-1 39 -1 23 -1?-21?-1?-24 -1 16 -1 ?0 -1?-34 -1 11?-1 0 0?-1?-1?-1?-1?-1

-13 -1?-10 -1 47 -1?-2 -1 ?0 -1 ?0 -1 ?0 -1 11 -1?-1?-1 0 0?-1?-1?-1?-1

-1 -2 -1?-33 -1 27?-1 ?0 -1 -8 -1?-32 -1?-18 -1 ?0?-1?-1?-1 0 0?-1?-1?-1

0 -1 29 -1 ?0 -1 0 -1?-19 -1 ?8 -1 16 -1 ?0 -1?-1?-1?-1?-1 0 0?-1?-1

-1 0 -1 0 -1 0?-1?-13 -1 0 -1 -7 -1 0 -1?-37?-1?-1?-1?-1?-1 0 0?-1

9 -1 ?0 -1 ?0 -1?26 -1 ?0 -1?-11 -1?-28 -1?-10 -1 1?-1?-1?-1?-1?-1 0 0

-1?-30 -1?-18 -1?-41?-1 34 -1?-12 -1 18 -1 ?4 -1 ?4 0?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=18, m _b=6, n _b=24:

31?-23?-16 9?-1 -1 -1?-34?-25 -1 25 -1 13 -7?-20?-21 -1 14 0 0?-1?-1?-1?-1

-9 33 ?0 ?0?-1 19 23 -1 16 -1 -1?-47 -1 ?0 ?0 ?0 ?0 -1 -1 0 0?-1?-1?-1

0 -1 36 -1 0 -7?-10 15 -1?-40 -1 -1?-14 -1 -2 23 40?-46 -1?-1 0 0?-1?-1

-33 0 -1?-18?-3 0 -8 0 -1 17 0 0 -1 -1 -1 -1?-31 0?-48?-1?-1 0 0?-1

-1 -1 -1 -1?20?-21 ?0 16 ?0 ?0 41 ?8 ?0 45 20?-12 -1 -1 -1?-1?-1?-1 0 0

-1 2 12 4 8 -1 -1 -1 7 18 -5?-27 47 8 -1 -1 -3 -6 0?-1?-1?-1?-1 0

Perhaps said matrix H _BmN _bIndividual column vector is taken from the n of following matrix _bIndividual column vector, wherein k _b=18, m _b=6, n _b=24:

-1?-17 -1?-40 -1?-1?-25?22?-34?-1 -1?-22 31?-20?-21 38?-38?-23 ?0 0?-1?-1?-1?-1

-22 -1 -6 ?0 ?0?-1 -1?-1 -1 0 ?0 ?0 38?-32 30 ?0?-22 ?5 -1 0 0?-1?-1?-1

-1 -1 ?0 -1 -1?37 ?0?-1 19?-3 -1 27 ?6 ?0 44?-28 ?0?-14?-16?-1 0 0?-1?-1

0 0 -1 -1 31?-1 -1 0 0?-1 38 4 0 33?-14?-21?-46 0 -1?-1?-1 0 0?-1

-1?-45 40 12 -1 0 36?-1 -1?-1 -1?-21?-17 25 ?0 15 ?0 ?6 -1?-1?-1?-1 0 0

13 -1 -1 -1?-17 2 -1?32 -1 2?-13?-39 -9 12 23 ?7 47?-26 ?0?-1?-1?-1?-1 0

15. the coding method of LDPC sign indicating number as claimed in claim 5 is characterized in that, said matrix H _BmFor:

-1?-10?-1 -1 ?0 -1 -1 36 -1 -1 -1?-13 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1?-5 -1 -1 -1 12 -1?-34 -2 -1 16?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1?-1 ?0 -1 -1 ?0 -1?-10?-39?-29 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 0?-1 -1?-26 0 -1?-22 -1 -1 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

0 -1 0 -1?-34 -1 -1 -6 -1 -1 -1 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1?-1 24 -1 -1?-17 -1 39 16 -1 -1?-7?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

42 -1?-1 -1 22 -1 -1?-33 -1 -1 ?0 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 -1?14 -1 ?0 -1 -1 ?0 -1 -1 -1 ?0?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1?-1?-35 -1 47?-45 -1 ?0 ?0 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-2 -1?-1 -1 -1 -1?-24 -1 16?-26 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1?-26?-1 -1 30 -1 -1 ?2 -1 -1 12 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 -1?-1 -1 -1?-18 26 -1 -2 42 -1 -1 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

36 15?-26 -5?-43?-1 7?-28 ?0 28 18 24 -9?-16?12?-43?-1 19 33?-19 0 0?-1?-1

0 24 ?0 46 16?-9 0 -1 -1?-44 -6?-34?-40 -1 0 ?0?32 ?0?-18 ?0?16 0 0?-1

-36 0?-27 0 0 0?27 0?-46 0 0 0 0 0?-1 -1 0?-21 0 15?-1?-1 0 0

-12?-29 17?-38?-20?-8?-1?-33?-47 ?4?-48?-13 29 -4?27?-11?11 -1 40?-30 0?-1?-1 0

Perhaps said matrix H _BmFor:

-1?-1?-16?-3?-1?-26?-1?-17 -1?-1?-17 -1?-31?-15 -1?-25 0 0?-1?-1?-1?-1?-1?-1

-5?-7 -1 0?-1 ?8?-5 -1?-39?-1 ?0 -1 ?0 -1 -1 -1?-1 0 0?-1?-1?-1?-1?-1

5?-1 -1?-1?-1 -1 6 -1 -1?-2 -3?-25 ?6 ?0?-22 -1?-1?-1 0 0?-1?-1?-1?-1

0?-1 0?-4 0 -1?13 -1 0?-1 -1 -1 -1?-12 0 -1?-1?-1?-1 0 0?-1?-1?-1

-1?-1 -1?-1?29 -1 0 ?0 -1?34 -4 ?0 -1 -5 -1 -1?95?-1?-1?-1 0 0?-1?-1

13 0 19?-2?-1 ?0 4 -1 ?6?-1 -1 -1 -1 ?5 -1 -1?-1?-1?-1?-1?-1 0 0?-1

12?-1 -1?-5?-1 -1?-1 15 -1 0?-18 -1 -1 ?6 13 ?0?-1?-1?-1?-1?-1?-1 0 0

6?27 -1 4 4 -1 0 -1 -1?-1?-15 ?2 -1 -1 -1?-19 0?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

-1?-1?-16?-3?-1?-26?-1?-17 -1?-1?-13 -1?-31?-15 -1?-25 1 0?-1?-1?-1?-1?-1?-1

-10?-7 -1 0?-1 ?8?-5 -1?-39?-1 ?4 -1 ?0 -1 -1 -1?-1 0 0?-1?-1?-1?-1?-1

0?-1 -1?-1?-1 -1 6 -1 -1?-2 ?1?-25 ?6 ?0?-22 -1?-1?-1 0 0?-1?-1?-1?-1

-5?-1 0?-4 0 -1?13 -1 0?-1 -1 -1 -1?-12 0 -1?-1?-1?-1 0 0?-1?-1?-1

-1?-1 -1?-1?29 -1 0 ?0 -1?34 ?0 ?0 -1 -5 -1 -1 0?-1?-1?-1 0 0?-1?-1

8 0 19?-2?-1 ?0 4 -1 ?6?-1 -1 -1 -1 ?5 -1 -1?-1?-1?-1?-1?-1 0 0?-1

7?-1 -1?-5?-1 -1?-1 15 -1 0?-14 -1 -1 ?6 13 ?0?-1?-1?-1?-1?-1?-1 0 0

1?27 -1 4 4 -1 0 -1 -1?-1?-11 ?2 -1 -1 -1?-19 1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

-1 -1?-66 -1 -1?-68 -1 41 -1 -1 -1 -1 12 92?-157 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-254 -1 -1 -1 -1 -1 -1 -1?-23 -1 -1?-155 191 260 ?0 -1 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 104 -1 ?-1 ?15 -1?-38 ?-1 -1 ?-1 ?-1 ?-1?-193?-135 159 ?-1 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

0 -1?180 -1 -1 -1 -1 -1 -1 -1 152 -1 -10 37?-245 -1 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 0?242 -1 -1 ?0 -1 -1 175 211 -82 -1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

262?-137 -1 0 ?-1 -1 -1 ?-1 -1 ?-1 ?-1 ?-1?-203?-178 ?83 ?-1 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -1?-35 184 -1 -1 -1 ?0 -14 ?0 250 -1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -1 -1 -1 0 -1?-189 -1 177 180?-146?-160 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 205 -1 ?-1 ?-1 -1 -1 ?-1 -1 ?-1 ?-1 ?-1?-195?-203 ?25 0?135?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1?-228 -1 -1 ?0 -1 -1 -1 -1 ?0 -19 198 162 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 -1?-205 -1 -1 0 -1 -1 -1 ?0 -1 197 167?-192 -1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 0 -1 ?-1 ?-1 -1 -1 ?-1 -1 ?-1 ?-1 205?-169?-210 -15 -73 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1 -1 -1 -1 -1 -1?-166 -1 107 -1 -1 32 -20 164 95 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 0 -1 ?0 -1 -1 -1 -1 -1 -1 -1 235 172?-220 265 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 -1 -1 119 -1 -1 -1 -1?212 -1 -1 -1?-125?-199 -37?-128 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-3 -1 -1 -1 -1 -1 -1 -1 -1?-173 -1 -1 82 -3 148 46 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

-1 -1 -1 -1 ?-1 -1 ?59 ?-5 -1 ?55 -1 -1 -47 ?65 -32 ?-1 ?0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1?-15 -1 -1 ?-1 -1 ?-1 ?-1 -1 ?-1 42 -1 141 ?18?-186 -18 -1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-144 -1 -1 -1 0 -1 ?-1 ?-1 -1 ?-1 -1?-96 ?41 -33 ?41 ?-1 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?-1 -1 ?-1 ?-1?-46 0 -1 -1?-156?-189?-128 ?41 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?0?-42 ?-1 -1 ?-1 ?-1 -1 ?-1?-52 -1 187 -75 ?68 ?-1 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?-1?137 ?-1 ?-1 -1 ?-1 -1?-29 190?-116 -97 164 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 0 -1 -1 -1 -1 -1?-138 0 -1 -1 -1 92 -13 -51 -1 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?25 -1?-157 ?-1 -1 ?-1 -1 -1 0 -73 102 -91 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

60 -1?-82 -1 ?-1 -1 ?-1 ?-1 -1 ?-1 -1 -1 100 ?93 ?39 ?-1?-48?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 ?-1 -8 ?-1 162 -1 ?-1 -1 -1 125 174 ?17?-184 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 -1 -1 46 ?-1 -1 0 ?-1?-99 ?-1 -1 -1 0 0 ?91 ?-1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

0 -1 -1 -1 ?-1 -1 ?-1 ?-1 -1?-149 -1 -1?-180 -41 -71 ?37 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

-1 -1 12 -1 ?-1 -1 ?-1 0 -1 ?-1 -1 ?0?-120 ?69?-142 ?-1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 -1 -1?-174 -1 ?-1 ?-1 -1 ?-1 ?0 -1 -52 ?79 ?60 0 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-1 61 -1 ?0 ?-1 ?0 ?-1 ?-1 -1 ?-1 -1 -1 ?88 ?-2 0 ?-1 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1 -1 -1 -1 ?-1 -1 ?-1 ?-1 17 ?-1 -1?141 ?57 161 -11 -63 ?0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

-1 -1 -1 -1 -1 -1 -1 96 -1 -1 177?-178 -1?-243 15?-229 ?0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 150 ?-1 55 ?-1?-254 -1 ?-1 ?-1 ?-1 ?-1 ?-1 -1 -88 -81 0 ?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 267 -1 -1?-241 -1 ?0 -1 -1 -1 185?-158?-131 -1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 -19 -1 -1 120 -1 -1 -1 0 -93 113?-171 -1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 297 -1 -1 -1 0 -1 -1 -1 -1 14 -1 221 83 44 -1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 33 -1 -1 ?0 -1?-150 -1 -1 121 284?-233 -1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1?-1

-1 -1 ?0?298?-204 -1 -1 -1 -1 -1 -1 -1 -1 265 -10?-138 -1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1?-1

0 -1 -1 -1 -1 85 -1 -1 -1?-246 -1 -1 -1 106 20 301 -1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1?-1

-1 -1 -1 54 -1 -1 -1 -1 -1 -1 -1 -1 -2?-183 222?-223 135?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1 -1 220 -1 -1 -1 78 -1?-135 -1 ?0 97 149 -1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1?-1

-1 0 -1 -1 -1 -1 -1 -1 -1 -1 -35 -1?204 -71?-116?-204 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1?-1

-1 -1 -1 -1 ?0 -15 -1 ?0 -1 -1 -1 -1 -1 268?-319 ?0 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1?-1

25 -1 -1 0 -1 -1 -1 -1 -1 -1 ?0 -1 -1?-280 ?0 158 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 -1 -1 -35 ?0?-74 -1 -1 -1 -1 -1 -1 -24?-203 -310 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0?-1

-297 -1 -1 -1 -1 -1 -1 -1?-251 -1 -1 ?0 -1?-245?-110?-261 -1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0 0

-1?-184?-169 -1 ?-1?-176 -1 ?-1 ?-1 ?-1 ?-1 ?-1 -1 ?56?-153 ?99 0?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

-47 13?-30 47?18?32 19?-21 -1 -1 -1 -1 -1 -1 -1 -1 0 0?-1?-1?-1?-1?-1?-1

-1 -1 -1 -1?-1?-1 -1 -1 11?-34 ?0 16?-24?-21 23 39?-1 0 0?-1?-1?-1?-1?-1

11 0 0 0?-2?47?-10?-13 -1 -1 -1 -1 -1 -1 -1 -1?-1?-1 0 0?-1?-1?-1?-1

-1 -1 -1 -1?-1?-1 -1 -1 ?0?-18?-32 -8 ?0 27?-33 -2?-1?-1?-1 0 0?-1?-1?-1

0 16 ?8?-19 0 0 29 ?0 -1 -1 -1 -1 -1 -1 -1 -1?-1?-1?-1?-1 0 0?-1?-1

-1 -1 -1 -1?-1?-1 -1 -1?-37 ?0 -7 ?0?-13 ?0 ?0 ?0?-1?-1?-1?-1?-1 0 0?-1

-10?-28?-11 0?26 0 0 9 -1 -1 -1 -1 -1 -1 -1 -1 1?-1?-1?-1?-1?-1 0 0

-1 -1 -1 -1?-1?-1 -1 -1 ?4 ?4 18?-12 34?-41?-18?-30 0?-1?-1?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

-1?-20 13?25?-25 -1?-1?-16 31 14?-21?-7 -1 -1?-34 -1 ?9?-23 ?0 0?-1?-1?-1?-1

0 0 -1?-1 16 23?-1 0 -9 -1 0 0?-47 -1 -1 19 0 33 -1 0 0?-1?-1?-1

40 -2?-14?-1 -1?-10 0 36 ?0?-46 23?-1 -1?-40 15 -7 -1 -1 -1?-1 0 0?-1?-1

-31 -1 -1 0 -1 -8?-3 -1?-33 ?0 -1?-1 ?0 17 ?0 ?0?-18 ?0?-48?-1?-1 0 0?-1

-1 20 ?0?41 ?0 ?0?20 -1 -1 -1?-12?45 ?8 ?0 16?-21 -1 -1 -1?-1?-1?-1 0 0

-3 -1 47?-5 ?7 -1 8 12 -1 -6 -1 8?-27 18 -1 -1 ?4 ?2 ?0?-1?-1?-1?-1 0

Perhaps said matrix H _BmFor:

-38?-21 31 -1?-34?-25 -1?-1 -1?-23 38?-20?-22?-1?22?-1?-40?-17 ?0 0?-1?-1?-1?-1

-22 30 38 ?0 -1 -1 ?0?-6?-22 ?5 ?0?-32 ?0 0?-1?-1 ?0 -1 -1 0 0?-1?-1?-1

0 44 ?6 -1 19 ?0 -1 0 -1?-14?-28 ?0 27?-3?-1?37 -1 -1?-16?-1 0 0?-1?-1

-46?-14 0 38 0 -1 31?-1 0 0?-21 33 4?-1 0?-1 -1 0 -1?-1?-1 0 0?-1

0 0?-17 -1 -1 36 -1?40 -1 6 15 25?-21?-1?-1 0 12?-45 -1?-1?-1?-1 0 0

47 23 -9?-13 -1 -1?-17?-1 13?-26 ?7 12?-39 2?32 2 -1 -1 ?0?-1?-1?-1?-1 0

16. a LDPC code coder is characterized in that, comprises the matrix adjusting module, matrix changes module, matrix stores module and coding module:

Said matrix adjusting module is used for according to spreading factor z _fAdjustment modular matrix H _BmElement, generate adjusted modular matrix H _Bmf, said matrix H _BmBe m _bRow, n _bThe matrix of row, said matrix H _BmIn element p (i, value j) is-1,0 or Integer n, said matrix H _BmThe number of neutral element be not less than m _b+ n _b-1, said matrix H _BmfIn element

Wherein It is right to represent

Round m to zero _b, n _b, j, i, z _f, z ₀Be positive integer, and 1≤i≤m _b, 1≤j≤n _b, z _f≤z ₀

Said matrixing module is used for according to said matrix H _BmfExpansion generates check matrix H and is stored in said matrix stores module, and extended mode is the submatrix P in the check matrix H _{I, j}(value j) is expanded for f, i, each submatrix P according to p _{I, j}Size be z _f* z _f, (value j) is-1 o'clock corresponding submatrix P to p for f, i _{I, j}Be full null matrix, (value j) is 0 o'clock corresponding submatrix P to p for f, i _{I, j}Be unit matrix, (value j) is a positive integer to p for f, i The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift to the right

(value j) is a negative integer to p for f, i

The time, corresponding submatrix P _{I, j}For unit matrix by being listed as cyclic shift left

Said coding module is used for according to said check matrix H input information U being encoded output coding information V;

Said matrix stores module is used for the required matrix H of memory encoding _Bm, H _BmfAnd H.

17. LDPC code coder as claimed in claim 16 is characterized in that, said matrix H _BmComprise n _bIndividual column vector $H_{\mathrm{Bm}}=[h_1,\·\·\·,h_{n_b}],$ Each column vector h wherein _i(i=1 ..., n _b) comprise m _bIndividual element, each column vector h _i(i=1 ..., n _b) number of the neutral element that comprises is not less than 1.

18. LDPC code coder as claimed in claim 17 is characterized in that, said matrix H _BmComprise matrix H _Bm ^SAnd matrix H _Bm ^P, $H_{\mathrm{Bm}}=\left[\begin{array}{cc}{H}_{\mathrm{Bm}}^S,& H_{\mathrm{Bm}}^P\end{array}\right],$ H wherein _Bm ^SSystematic bits part corresponding to check matrix H comprises matrix H _BmThe m on the left side _bRow, k _bThe element of row, H _Bm ^PCheck bit part corresponding to check matrix H comprises matrix H _BmThe m on the right _bRow, m _bThe element of row, said matrix H _BmThe number of neutral element be not less than 2m _b+ k _b-1 or 2n _b-k _b-1.

19. LDPC code coder as claimed in claim 18 is characterized in that, said column vector h _i(i=1 ..., k _bThe number of the neutral element that+1) comprises is not less than 1, column vector h _i(i=k _b+ 2 ..., n _b) number of the neutral element that comprises is 2.

Images