CN103268213A - Quasi-cyclic matrix high speed multiplier in DTMB (digital television-terrestrial multimedia broadcasting) without memory - Google Patents

Abstract

The invention provides a quasi-cyclic matrix high speed multiplier in a DTMB (digital television-terrestrial multimedia broadcasting) without a memory, and is used for realizing the multiplication operation of a vector m and a quasi-cyclic matrix F in DTMB standard multi-rate QC-LDPC (quasi-cyclic low-density parity-check) approximate lower triangular coding. The multiplier comprises seven groups of multi-input mode 2 summators and seven 127-bit shifting registers, wherein the multi-input mode 2 summators are used for carrying out parts of bit additions on the content of the vector m data segment and the shifting register, and the 127-bit shifting registers are used for storing the sum of the ring shift left for one bit. According to the quasi-cyclic matrix high speed multiplier provided by the invention, all code rates can be compatible, the memory can be omitted, the logic resource is reduced, and the quasi-cyclic matrix high speed multiplier has the advantages of simple structure, small power consumption and low cost.

Description

Need not accurate circular matrix high-speed multiplier among the DTMB of storer

Technical field

The present invention relates to field of channel coding, particularly the accurate circular matrix high-speed multiplier in a kind of DTMB standard multi code Rate of Chinese character QC-LDPC near lower triangular coding.

Background technology

Low-density checksum (Low-Density Parity-Check, LDPC) sign indicating number is one of channel coding technology efficiently, and QC-LDPC(Quasic-LDPC, QC-LDPC) sign indicating number is a kind of special LDPC sign indicating number.Generator matrix G and the check matrix H of QC-LDPC sign indicating number all are the arrays that is made of circular matrix, have the characteristics of segmentation circulation, so be called as the QC-LDPC sign indicating number.The first trip of circular matrix is the result of 1 of footline ring shift right, and all the other each provisional capitals are results of 1 of its lastrow ring shift right, and therefore, circular matrix is characterized by its first trip fully.Usually, the first trip of circular matrix is called as its generator polynomial.

When adopting the near lower triangular coding method that the QC-LDPC sign indicating number is encoded, by the ranks exchange, check matrix H is transformed near lower triangular shape H _ALT, it is composed as follows by 6 sub-matrixes:

$H_{\mathrm{ALT}}=\left[\begin{array}{ccc}A& B& L\\ C& D& E\end{array}\right]---\left(1\right)$

Wherein, L is lower triangular matrix.H _ALTCorresponding code word v _ALT=(s, p, q), and matrix A and C corresponding informance vector s, the corresponding a part of verification vector of matrix B and D p, matrix L and E be corresponding remaining verification vector q then.The method of calculating section verification vector p is as follows:

p＝s(C+EL ^-1A) ^Τ((D+EL ^-1B) ^-1) ^Τ (2)

Wherein, subscript ^-1With ^ΤRepresent respectively matrix inversion and transposition.Order

m＝s(C+EL ^-1A) ^Τ (3)

F＝((D+EL ^-1B) ^-1) ^Τ (4)

Then vectorial m and matrix F satisfy following relation:

p＝mF (5)

Matrix F is by following u * u b * b rank circular matrix F _{I, j}(0≤i＜u, the accurate circular matrix that 0≤j＜u) constitutes:

Capable and the b of the continuous b of F row are called as the capable and piece row of piece respectively.By formula (6) as can be known, F has the capable and u piece row of u piece.Make f _{I, j}Be circular matrix F _{I, j}Generator polynomial, they have constituted following generator polynomial matrix f

Make f _jBe all the circular matrix generator polynomials formations by generator polynomial matrix f j row in the formula (7).

Make vectorial m=(e ₀, e ₁..., e _{U * b-1}), part verification vector p=(d ₀, d ₁..., d _{U * b-1}).Be one section with the b bit, vectorial m and part verification vector p all are divided into the u section, i.e. m=(m ₀, m ₁..., m _U-1) and p=(p ₀, p ₁..., p _U-1).By formula (5) as can be known, the j section p of part verification vector _jSatisfy

p _j＝m ₀F _0,j+m ₁F _1,j+…+m _iF _i,j+…+m _u-1F _u-1,j (8)

Wherein, 0≤i＜u, 0≤j＜u.Order

With Be respectively generator polynomial f _{I, j}The result of ring shift right n position and ring shift left n position, wherein, 0≤n≤b.So, the i item on formula (8) equal sign the right is deployable is

$m_i{F}_{i,j}=e_{i\×b}{f}_{i,j}^{r\left(0\right)}+e_{i\×b+1}{f}_{i,j}^{r\left(1\right)}+...+e_{i\×b+b-1}{f}_{i,j}^{r(b-1)}---\left(9\right)$

For the multiplication of vector in the quick realization formula (5) with accurate circular matrix, at present extensively employing be based on u ²Individual I type shift register adds totalizer (Type-I Shift-Register-Adder-Accumulator, SRAA-I) scheme of circuit.Fig. 1 is the functional block diagram of single SRAA-I circuit.When calculating m with the SRAA-I circuit _iF _{I, j}(when 0≤i＜u, 0≤j＜u), array section m _iThis circuit is sent in serial by turn, and the generator polynomial look-up table is stored the generator polynomial f that generator polynomial matrix i is capable, j is listed as in advance _{I, j}, totalizer is cleared initialization.When the 0th clock period arrived, shift register loaded generator polynomial from the generator polynomial look-up table Bit e _{I * b}Move into circuit, and with the content of shift register

Carry out scalar and take advantage of product Add with content 0 mould 2 of totalizer and

Deposit back totalizer.When the 1st clock period arrives, 1 of shift register ring shift right, content becomes

Bit e _{I * b+1}Move into circuit, and with the content of shift register

Carry out scalar and take advantage of product

Content with totalizer

Mould 2 add and

Deposit back totalizer.Above-mentioned moving to right-take advantage of-Jia-storing process is proceeded down.When b-1 clock period finishes, bit e _{I * b+b-1}Moved into circuit, that cumulative adder stores is part and m at this moment _iF _{I, j}, this is array section m _iTo p _jContribution.

Use u ²Individual SRAA-I circuit can constitute a kind of accurate circular matrix high-speed multiplier, and it obtains u verification section simultaneously in b clock period.U SRAA-I circuit shared 1 totalizer, so u ²Individual SRAA-I circuit needs u totalizer altogether.This scheme needs u * (u+1) * b register, u ²* b two inputs and door and u ²* b two input XOR gate also need u ²The generator polynomial of individual b bit ROM storage circular matrix.

The DTMB standard has adopted code check η=0.4,0.6 and 0.8 3 kind of QC-LDPC sign indicating number, and b=127 is all arranged.For code check η=0.4,0.6 and 0.8, u be respectively 3,2 and 2.

Be compatible 3 kinds of code checks, the existing solution of accurate circular matrix high-speed multiplication is based on 9 SRAA-I circuit in the DTMB standard QC-LDPC near lower triangular coding, need 1524 registers, 1143 two inputs and door and 1143 two input XOR gate, 9 circular matrix generator polynomials that also need the ROM of 9 381 bits to store 3 kinds of code check generator polynomial matrix f respectively.The shortcoming of this scheme is that register quantity is big, needs to finish multiplying with door in a large number and finishes additive operation with a large amount of XOR gate, and too many little ROM can waste memory resource.So many resources requirement can cause that the power consumption of circuit is big, cost is high.

Summary of the invention

There is the shortcoming that resource requirement is many, power consumption is big, cost is high in the existing implementation of accurate circular matrix high-speed multiplication in the DTMB standard multi code Rate of Chinese character QC-LDPC near lower triangular coding, at these technical matterss, the invention provides a kind of accurate circular matrix high-speed multiplier that need not storer.

As shown in Figure 3, the accurate circular matrix high-speed multiplier in the DTMB standard multi code Rate of Chinese character QC-LDPC near lower triangular coding mainly is made up of 2 parts: import modulo 2 adder and shift register more.Multiplication process divided for 3 steps finished: the 1st step, zero clearing shift register R ₀, R ₁..., R ₆The 2nd step, the data segment z of input vector m _k, import modulo 2 adder A more ₀, A ₁, A ₂Respectively according to η=0.4 code check f ₀, f ₁, f ₂To vectorial m data segment and shift register R ₀, R ₁, R ₂Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₀, R ₁, R ₂, import modulo 2 adder A more ₃, A ₄Respectively according to η=0.6 code check f ₀, f ₁To vectorial m data segment and shift register R ₃, R ₄Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₃, R ₄, import modulo 2 adder A more ₅, A ₆Respectively according to η=0.8 code check f ₀, f ₁To vectorial m data segment and shift register R ₅, R ₆Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₅, R ₆The 3rd step was that step-length increases progressively the value that changes k with 1, repeated the 2nd and went on foot b time, finish up to whole vectorial m input, at this moment, shift register R ₀, R ₁, R ₂That store is respectively η=0.4 code check verification section p ₀, p ₁, p ₂, they have constituted η=0.4 code check part verification vector p=(p ₀, p ₁, p ₂), shift register R ₃, R ₄That store is respectively η=0.6 code check verification section p ₀, p ₁, they have constituted η=0.6 code check part verification vector p=(p ₀, p ₁), shift register R ₅, R ₆That store is respectively η=0.8 code check verification section p ₀, p ₁, they have constituted η=0.8 code check part verification vector p=(p ₀, p ₁).

Accurate circular matrix high-speed multiplier provided by the invention is simple in structure, and the QC-LDPC sign indicating number of all code checks need not storer in the compatible DTMB standard, has reduced logical resource, has reduced power consumption, has saved cost.

Can be further understood by following detailed description and accompanying drawings about advantage of the present invention and method.

Description of drawings

Fig. 1 is the functional block diagram that I type shift register adds totalizer SRAA-I circuit;

Fig. 2 is the functional block diagram that adds shift register ASR circuit;

Fig. 3 is a kind of accurate circular matrix high-speed multiplier that need not storer that is made of 7 ASR circuit.

Embodiment

Below in conjunction with accompanying drawing preferred embodiment of the present invention is elaborated, thereby so that advantages and features of the invention can be easier to be it will be appreciated by those skilled in the art that protection scope of the present invention is made more explicit defining.

Since the generator polynomial f with circular matrix _{I, j}Ring shift right n position is equivalent to its ring shift left b-n position, namely

Formula (9) can be rewritten as so

$m_i{F}_{i,j}=e_{i\×b}{f}_{i,j}^{l\left(b\right)}+e_{i\×b+1}{f}_{i,j}^{l(b-1)}+...+e_{i\×b+b-1}{f}_{i,j}^{l\left(1\right)}$

$={\left(e_{i\×b}{f}_{i,j}\right)}^{l\left(b\right)}+{\left(e_{i\×b+1}{f}_{i,j}\right)}^{l(b-1)}+...+{\left(e_{i\×b+b-1}{f}_{i,j}\right)}^{l\left(1\right)}$

$={(0+e_{i\×b}{f}_{i,j})}^{l\left(b\right)}+{\left(e_{i\×b+1}{f}_{i,j}\right)}^{l(b-1)}+...+{\left(e_{i\×b+b-1}{f}_{i,j}\right)}^{l\left(1\right)}---\left(10\right)$

$={({(0+e_{i\×b}{f}_{i,j})}^{l\left(1\right)}+e_{i\×b+1}{f}_{i,j})}^{l(b-1)}+...+{\left(e_{i\×b+b-1}{f}_{i,j}\right)}^{l\left(1\right)}$

$={(...{({(0+e_{i\×b}{f}_{i,j})}^{l\left(1\right)}+e_{i\×b+1}{f}_{i,j})}^{l\left(1\right)}+...+e_{i\×b+b-1}{f}_{i,j})}^{l\left(1\right)}$

With formula (10) substitution formula (8), can get

$p_j={(...{({(0+\underset{i=0}{\overset{u-1}{\mathrm{\Σ}}}{e}_{i\×b}{f}_{i,j})}^{l\left(1\right)}+\underset{i=0}{\overset{u-1}{\mathrm{\Σ}}}{e}_{i\×b+1}{f}_{i,j})}^{l\left(1\right)}+...+\underset{i=0}{\overset{u-1}{\mathrm{\Σ}}}{e}_{i\×b+b-1}{f}_{i,j})}^{l\left(1\right)}---\left(11\right)$

Make the data segment z of vectorial m _k=(e _k, e _B+k..., e _{(u-1) * b+k}), wherein, 0≤k＜b, and f _jBe that then formula (11) can be rewritten as by all circular matrix generator polynomials formations of generator polynomial matrix f j row in the formula (7)

p _j＝(…((0+z ₀f _j) ^l(1)+z ₁f _j) ^l(1)+…+z _b-1f _j) ^l(1) (12)

Make v _{J, y}Be by f _jThe column vector that y coefficient of all circular matrix generator polynomials constitutes, wherein, 0≤y＜b, then arbitrary product term satisfies following relation in the following formula:

z _kf _j=(z _kv _j,0,z _kv _j,1,…,z _kv _j,y,…,z _kv _j,b-1) (13)

z _kBe at random, v _{J, y}Be constant and formed at random by " 0 " and " 1 ".If v _{J, y}In x " 1 ", then z are arranged _kv _{J, y}Can be reduced to v _{J, y}The z of nonzero element correspondence _kThe mould 2 of middle x element adds, wherein, and 0≤x≤u.

Since each element in the formula (13) can be tried to achieve by the modulo 2 adder of input more than, formula (12) can be considered as one and adds-move to left-process of storing so, and it is realized with adding shift register (Adder-Shift-Register, ASR) circuit.Fig. 2 is the functional block diagram of ASR circuit, and vectorial m is sent into this circuit by the u bit parallel, the data segment z of vectorial m _kDepend on v with the annexation of each many input modulo 2 adder _{J, y}, depend on f with all annexations of importing modulo 2 adders more _jWhen using ASR circuit calculation check section p _j(during 0≤j＜u), shift register is cleared initialization.When the 0th clock period arrives, the data segment z of vectorial m ₀Move into circuit, b many input modulo 2 adder output 0+z ₀f _j, and 0+z ₀f _jResult (the 0+z that ring shift left is 1 ₀f _j) ^{L (1)}Deposit the travelling backwards bit register.When the 1st clock period arrives, the data segment z of vectorial m ₁Move into circuit, b many input modulo 2 adder output (0+z ₀f _j) ^{L (1)}+ z ₁f _jAnd (0+z ₀f _j) ^{L (1)}+ z ₁f _jThe result ((0+z that ring shift left is 1 ₀f _j) ^{L (1)}+ z ₁f _j) ^{L (1)}Deposit the travelling backwards bit register.Above-mentioned adding-move to left-storing process is proceeded down.When b-1 clock period finishes, the final data section z of vectorial m _B-1Moved into circuit, that this moment, shift register was stored is verification section p _jAn ASR circuit is obtained verification section p in b clock period _j, need b many input modulo 2 adders and b register.Since all v _{J, y}(0≤j＜u, 0≤y＜b) all formed at random by " 0 " and " 1 ", each v so _{J, y}In the scope of " 1 " be 0～u, average is u/2.The input end of many input modulo 2 adders also is connected with shift register except with the data segment of vectorial m links to each other, so each many input modulo 2 adder on average has u/2+1 input end, need import XOR gate by u/2 individual two and be realized.

Fig. 3 has provided a kind of accurate circular matrix high-speed multiplier that need not storer that is made of 7 ASR circuit, is made up of many inputs modulo 2 adder and two kinds of functional modules of shift register.Many input modulo 2 adder A ₀, A ₁, A ₂Respectively according to η=0.4 code check f ₀, f ₁, f ₂To vectorial m data segment and shift register R ₀, R ₁, R ₂Content carry out the partial bit addition, import modulo 2 adder A more ₃, A ₄Respectively according to η=0.6 code check f ₀, f ₁To vectorial m data segment and shift register R ₃, R ₄Content carry out the partial bit addition, import modulo 2 adder A more ₅, A ₆Respectively according to η=0.8 code check f ₀, f ₁To vectorial m data segment and shift register R ₅, R ₆Content carry out the partial bit addition.Shift register R ₀, R ₁, R ₂Modulo 2 adder A are imported in storage more respectively ₀, A ₁, A ₂And be recycled result and the final verification section p of η=0.4 code check that moves to left after 1 ₀, p ₁, p ₂, shift register R ₃, R ₄Modulo 2 adder A are imported in storage more respectively ₃, A ₄And be recycled result and the final verification section p of η=0.6 code check that moves to left after 1 ₀, p ₁, shift register R ₅, R ₆Modulo 2 adder A are imported in storage more respectively ₅, A ₆And be recycled result and the final verification section p of η=0.8 code check that moves to left after 1 ₀, p ₁

The data segment z of vector m _kWith many inputs modulo 2 adder A ₀, A ₁, A ₂The annexation of input end depends on η=0.4 code check f ₀, f ₁, f ₂Y coefficient is " 1 " if generator polynomial matrix f i is capable, j row circular matrix generator polynomial, so z _kI bit be connected to the many inputs of j group modulo 2 adder A _jY totalizer on.

The data segment z of vector m _kWith many inputs modulo 2 adder A ₃, A ₄The annexation of input end depends on η=0.6 code check f ₀, f ₁Y coefficient is " 1 " if generator polynomial matrix f i is capable, j row circular matrix generator polynomial, so z _kI bit be connected to the many inputs of 3+j group modulo 2 adder A _3+jY totalizer on.

The data segment z of vector m _kWith many inputs modulo 2 adder A ₃, A ₄The annexation of input end depends on η=0.8 code check f ₀, f ₁Y coefficient is " 1 " if generator polynomial matrix f i is capable, j row circular matrix generator polynomial, so z _kI bit be connected to the many inputs of 5+j group modulo 2 adder A _5+jY totalizer on.

The invention provides a kind of accurate circular matrix high-speed multiplication that need not storer, 3 kinds of code check QC-LDPC sign indicating numbers in its compatible DTMB standard, its multiplication step is described below:

The 1st step, zero clearing shift register R ₀, R ₁..., R ₆

The 2nd step, the data segment z of input vector m _k, import modulo 2 adder A more ₀, A ₁, A ₂Respectively according to η=0.4 code check f ₀, f ₁, f ₂To vectorial m data segment and shift register R ₀, R ₁, R ₂Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₀, R ₁, R ₂, import modulo 2 adder A more ₃, A ₄Respectively according to η=0.6 code check f ₀, f ₁To vectorial m data segment and shift register R ₃, R ₄Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₃, R ₄, import modulo 2 adder A more ₅, A ₆Respectively according to η=0.8 code check f ₀, f ₁To vectorial m data segment and shift register R ₅, R ₆Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₅, R ₆

The 3rd step was that step-length increases progressively the value that changes k with 1, repeated the 2nd and went on foot b time, finish up to whole vectorial m input, at this moment, shift register R ₀, R ₁, R ₂That store is respectively η=0.4 code check verification section p ₀, p ₁, p ₂, they have constituted η=0.4 code check part verification vector p=(p ₀, p ₁, p ₂), shift register R ₃, R ₄That store is respectively η=0.6 code check verification section p ₀, p ₁, they have constituted η=0.6 code check part verification vector p=(p ₀, p ₁), shift register R ₅, R ₆That store is respectively η=0.8 code check verification section p ₀, p ₁, they have constituted η=0.8 code check part verification vector p=(p ₀, p ₁).

Be not difficult to find out that from above step whole computation process needs b clock period altogether, identical with existing multiplication scheme based on 9 SRAA-I circuit.

The existing solution of accurate circular matrix high-speed multiplication needs 9 381 bit ROM, 1524 registers, 1143 two inputs and door and 1143 two input XOR gate in the DTMB standard, and the present invention needs 0 bit ROM, 889 registers, 0 two input and door and 1080 two input XOR gate.As seen, the present invention need not ROM and with door, the register that expends and XOR gate are respectively 58.3% and 94.4% of existing solutions.

As fully visible, for the accurate circular matrix high-speed multiplication in the DTMB standard multi code Rate of Chinese character QC-LDPC near lower triangular coding, compare with existing solution, the present invention has kept identical speed, need not storer, saved a large amount of logical resources, have simple in structure, resource requirement is few, power consumption is little, low cost and other advantages.

The above; it only is one of the specific embodiment of the present invention; but protection scope of the present invention is not limited thereto; any those of ordinary skill in the art are in the disclosed technical scope of the present invention; variation or the replacement that can expect without creative work all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain that claims were limited.

Claims (5)

1. accurate circular matrix high-speed multiplier among the DTMB who need not storer, when adopting the near lower triangular coding method that DTMB standard multi code Rate of Chinese character QC-LDPC sign indicating number is encoded, relate to the multiplying of vectorial m and accurate circular matrix F, matrix F is divided into the capable and u piece row of u piece, is by u * u b * b rank circular matrix F _{I, j}The array that constitutes, f _{I, j}Be circular matrix F _{I, j}Generator polynomial, u * u f _{I, j}Constituted generator polynomial matrix f, all circular matrix generator polynomials of f j row have constituted f _j, wherein, b, i, j and u are nonnegative integer, 0≤i＜u, 0≤j＜u, the DTMB standard has adopted the QC-LDPC sign indicating number of 3 kinds of different code check η, and η is respectively 0.4,0.6,0.8, for these 3 kinds different code check QC-LDPC sign indicating numbers, b=127 is all arranged, and 3 kinds of different code check corresponding parameters u are respectively 3,2,2, are one section with continuous b bit, part verification vector p is divided into the u section, i.e. p=(p ₀, p ₁..., p _U-1), vectorial m=(e ₀, e ₁..., e _{U * b-1}), be step-length with the b bit, the uniformly-spaced bit of vectorial m has constituted data segment z _k=(e _k, e _B+k..., e _{(u-1) * b+k}), wherein, 0≤k＜b is characterized in that, described multiplier comprises with lower member:

Many input modulo 2 adder A ₀, A ₁, A ₂, respectively according to η=0.4 code check f ₀, f ₁, f ₂To vectorial m data segment and shift register R ₀, R ₁, R ₂Content carry out the partial bit addition;

Many input modulo 2 adder A ₃, A ₄, respectively according to η=0.6 code check f ₀, f ₁To vectorial m data segment and shift register R ₃, R ₄Content carry out the partial bit addition;

Many input modulo 2 adder A ₅, A ₆, respectively according to η=0.8 code check f ₀, f ₁To vectorial m data segment and shift register R ₅, R ₆Content carry out the partial bit addition;

Shift register R ₀, R ₁, R ₂, modulo 2 adder A are imported in storage more respectively ₀, A ₁, A ₂And be recycled result and the final verification section p of η=0.4 code check that moves to left after 1 ₀, p ₁, p ₂

Shift register R ₃, R ₄, modulo 2 adder A are imported in storage more respectively ₃, A ₄And be recycled result and the final verification section p of η=0.6 code check that moves to left after 1 ₀, p ₁

Shift register R ₅, R ₆, modulo 2 adder A are imported in storage more respectively ₅, A ₆And be recycled result and the final verification section p of η=0.8 code check that moves to left after 1 ₀, p ₁

2. accurate circular matrix high-speed multiplier among a kind of DTMB that need not storer according to claim 1 is characterized in that the data segment z of described vectorial m _kWith many inputs modulo 2 adder A ₀, A ₁, A ₂The annexation of input end depends on η=0.4 code check f ₀, f ₁, f ₂If generator polynomial matrix f i is capable, j row circular matrix generator polynomial, and y coefficient is " 1 ", so z _kI bit be connected to the many inputs of j group modulo 2 adder A _jY totalizer on, wherein, 0≤y＜b.

3. accurate circular matrix high-speed multiplier among a kind of DTMB that need not storer according to claim 1 is characterized in that the data segment z of described vectorial m _kWith many inputs modulo 2 adder A ₃, A ₄The annexation of input end depends on η=0.6 code check f ₀, f ₁If generator polynomial matrix f i is capable, j row circular matrix generator polynomial, and y coefficient is " 1 ", so z _kI bit be connected to the many inputs of 3+j group modulo 2 adder A _3+jY totalizer on, wherein, 0≤y＜b.

4. accurate circular matrix high-speed multiplier among a kind of DTMB that need not storer according to claim 1 is characterized in that the data segment z of described vectorial m _kWith many inputs modulo 2 adder A ₃, A ₄The annexation of input end depends on η=0.8 code check f ₀, f ₁If generator polynomial matrix f i is capable, j row circular matrix generator polynomial, and y coefficient is " 1 ", so z _kI bit be connected to the many inputs of 5+j group modulo 2 adder A _5+jY totalizer on, wherein, 0≤y＜b.

5. accurate circular matrix high-speed multiplication method among the DTMB who need not storer, when adopting the near lower triangular coding method that DTMB standard multi code Rate of Chinese character QC-LDPC sign indicating number is encoded, relate to the multiplying of vectorial m and accurate circular matrix F, matrix F is divided into the capable and u piece row of u piece, is by u * u b * b rank circular matrix F _{I, j}The array that constitutes, f _{I, j}Be circular matrix F _{I, j}Generator polynomial, u * u f _{I, j}Constituted generator polynomial matrix f, all circular matrix generator polynomials of f j row have constituted f _j, wherein, b, i, j and u are nonnegative integer, 0≤i＜u, 0≤j＜u, the DTMB standard has adopted the QC-LDPC sign indicating number of 3 kinds of different code check η, and η is respectively 0.4,0.6,0.8, for these 3 kinds different code check QC-LDPC sign indicating numbers, b=127 is all arranged, and 3 kinds of different code check corresponding parameters u are respectively 3,2,2, are one section with continuous b bit, part verification vector p is divided into the u section, i.e. p=(p ₀, p ₁..., p _U-1), vectorial m=(e ₀, e ₁..., e _{U * b-1}), be step-length with the b bit, the uniformly-spaced bit of vectorial m has constituted data segment z _k=(e _k, e _B+k..., e _{(u-1) * b+k}), wherein, 0≤k＜b is characterized in that, described multiplication method may further comprise the steps:

The 1st step, zero clearing shift register R ₀, R ₁..., R ₆

The 2nd step, the data segment z of input vector m _k, import modulo 2 adder A more ₀, A ₁, A ₂Respectively according to η=0.4 code check f ₀, f ₁, f ₂To vectorial m data segment and shift register R ₀, R ₁, R ₂Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₀, R ₁, R ₂, import modulo 2 adder A more ₃, A ₄Respectively according to η=0.6 code check f ₀, f ₁To vectorial m data segment and shift register R ₃, R ₄Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₃, R ₄, import modulo 2 adder A more ₅, A ₆Respectively according to η=0.8 code check f ₀, f ₁To vectorial m data segment and shift register R ₅, R ₆Content carry out the partial bit addition and be recycled the result who moves to left after 1 depositing shift register R respectively in ₅, R ₆

The 3rd step was that step-length increases progressively the value that changes k with 1, repeated the 2nd and went on foot b time, finish up to whole vectorial m input, at this moment, shift register R ₀, R ₁, R ₂That store is respectively η=0.4 code check verification section p ₀, p ₁, p ₂, they have constituted η=0.4 code check part verification vector p=(p ₀, p ₁, p ₂), shift register R ₃, R ₄That store is respectively η=0.6 code check verification section p ₀, p ₁, they have constituted η=0.6 code check part verification vector p=(p ₀, p ₁), shift register R ₅, R ₆That store is respectively η=0.8 code check verification section p ₀, p ₁, they have constituted η=0.8 code check part verification vector p=(p ₀, p ₁).

Images