CN105450235A - Full-diagonal quasi-cyclic matrix multiplier in DTMB - Google Patents
Full-diagonal quasi-cyclic matrix multiplier in DTMB Download PDFInfo
- Publication number
- CN105450235A CN105450235A CN201610004205.6A CN201610004205A CN105450235A CN 105450235 A CN105450235 A CN 105450235A CN 201610004205 A CN201610004205 A CN 201610004205A CN 105450235 A CN105450235 A CN 105450235A
- Authority
- CN
- China
- Prior art keywords
- matrix
- bit
- ring shift
- full
- multiplexer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
- H03M13/1168—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices
Landscapes
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Complex Calculations (AREA)
Abstract
The invention provides a full-diagonal quasi-cyclic matrix multiplier in DTMB. The multiplier is composed of five parts, i.e., t-1 ring-shift-left devices C1 to Ct-1, t-2 b-bit XOR gates X1 to Xt-2, t-1 multiplexers M1 to Mt-1, t1 b-bit registers R1 to Rt-1 and one look-up table ROM. According to the invention, a full-diagonal structure of a QC-LDPC code verification matrix in the DTMB is fully utilized, and the provided full-diagonal quasi-cyclic matrix multiplier is compatible with three code rates and has the advantages of simple structure, fast calculation speed, small memory demand and the like.
Description
Technical field
The present invention relates to field of channel coding, particularly the full diagonal quasi-cyclic matrix multiplier of QC-LDPC code in a kind of DTMB standard.
Background technology
Low-density checksum (Low-DensityParity-Check, LDPC) code is one of efficient channel coding technology, and quasi-cyclic LDPC (Quasic-LDPC, QC-LDPC) code is a kind of special LDPC code.The generator matrix G of QC-LDPC code and check matrix H are all the arrays be made up of circular matrix, have the feature of Circulant Block, therefore are called as quasi-cyclic LDPC code.The first trip of circular matrix is the result of footline ring shift right 1, and all the other each provisional capitals are results of its lastrow ring shift right 1, and therefore, circular matrix is characterized by its first trip completely.Usually, the first trip of circular matrix is called as its generator polynomial.
The row of circular matrix is heavy identical with column weight, is denoted as w.If w=0, so this circular matrix is full null matrix.If w=1, so this circular matrix is replaceable, is called permutation matrix, and it is by obtaining the some positions of unit matrix I ring shift right.The check matrix H of QC-LDPC code is by c × t b × b rank circular matrix H
i,jthe following array that (1≤i≤c, 1≤j≤t, t=e+c) is formed:
Usually, all circular matrixes in H are full null matrix (w=0) or are permutation matrix (w=1).The continuous b of H capable and b row are called as the capable and block row of block respectively.From formula (1), H has c block capable and t block row.
That the front e block row of H are corresponding is information vector a, and that rear c block row are corresponding is the vectorial p of verification.Code word v=(a, p).Be one section with b bit, information vector a is divided into e section, i.e. a=(a
1, a
2..., a
e); Verify vectorial p and be divided into c section, be i.e. p=(p
1, p
2..., p
c).
The matrix that front for H e block row and rear c block row are formed is denoted as E and C respectively, then formula (1) becomes
H＝[EC](2)
Since QC-LDPC code is a kind of special linear block codes, so it meets
Hv
T＝0(3)
Wherein, subscript
trepresent the transposition of vector (or matrix).Formula (2) and v=(a, p) are substituted into formula (3), and arrangement can obtain
p
T＝C
-1Ea
T(4)
Wherein, subscript
– 1representing matrix inverse.
From formula (4), when utilizing H to encode to QC-LDPC code, need first compute vector m
t=Ea
t, then compute vector p
t=C
-1m
t.Be one section with b bit, vectorial m is divided into c section, i.e. m=(m
1, m
2..., m
c).As a part of H, E is also quasi-cyclic matrix, and calculating m needs to use quasi-cyclic matrix multiplier.
For general QC-LDPC code, quasi-cyclic matrix multiplier forms primarily of ROM, barrel shifter and accumulator.The clock periodicity calculated needed for m equals the number β of permutation matrix in E.ROM stores the ring shift right figure place of the relative I of each permutation matrix and the block line number at place thereof and block row number, needs β ([log
2b]+[log
2e]+[log
2c]) memory of bit, wherein, symbol [x] represents the smallest positive integral being not less than x.
DTMB is the English abbreviation of digital television terrestrial broadcasting system, and English full name is DigitalTelevisionTerrestrialMultimediaBroadcasting.DTMB standard have employed the QC-LDPC code of 3 kinds of different code checks.For these 3 kinds of QC-LDPC codes, all there is t=59 and b=127.Fig. 1 gives parameter e, c and β under different code check η.
For 3 kinds of different code checks, in DTMB standard, the computing time needed for existing quasi-cyclic matrix multiplier of QC-LDPC code is 166,227 and 261 clock cycle respectively.3 kinds of code checks need 12426 bit ROM altogether.
Summary of the invention
The check matrix of the QC-LDPC code that DTMB standard adopts has full diagonal structure, the present invention is directed to this QC-LDPC code and provides a kind of quasi-cyclic matrix multiplier efficiently.
As shown in Figure 5, full diagonal quasi-cyclic matrix multiplier is made up of 4 parts: t-1 ring shift left device C
1~ C
t-1, a t-2 b bit XOR gate X
1~ X
t-2, a t-1 multiplexer M
1~ M
t-1, a t-1 b bit register R
1~ R
t-1with 1 look-up table ROM.Whole checking procedure divides 6 steps to complete: the 1st step, resets all b bit register R
1~ R
t-1; 2nd step, input message segment a
j, look-up table ROM is the E of η according to code check η and row j bit rate output
ejth row t-1 bit, wherein, 1≤j≤e; 3rd step, as 0≤s
kduring <b, ring shift left device C
kto message segment a
jring shift left s
kposition, and work as s
kduring=∞, ring shift left device C
knot to message segment a
jring shift left but it is directly exported, as k=t-1, ring shift left device C
koutput and multiplexer M
kbe connected, and as 1≤k<t-1, ring shift left device C
koutput and b bit XOR gate X
kbe connected, wherein, 1≤k≤t-1, s
k∈ ∞, 0,1 ..., b-1}; 4th step, b bit XOR gate X
kto ring shift left device C
koutput rusults and b bit register R
k+1content carry out mould 2 and add, and send into multiplexer M
k; 5th step, multiplexer M
kinput alternatives according to the kth bit that look-up table ROM exports to 2, selection result sends into b bit register R
k, as k=t-1, if the kth bit that look-up table ROM exports is 0, then multiplexer M
kselect full null vector, otherwise, multiplexer M
kselect ring shift left device C
koutput rusults, as 1≤k<t-1, if look-up table ROM export kth bit be 0, then multiplexer M
kselect b bit register R
k+1content, otherwise, multiplexer M
kselect b bit XOR gate X
koutput rusults; 6th step, with 1 for step-length increases progressively the value changing j, repeats 2nd ~ 5 step e-1 time, until whole information vector a inputs complete, now, and b bit register R
1~ R
ccontent be vectorial m=(m
1, m
2..., m
c).
The present invention takes full advantage of the full diagonal structure of QC-LDPC code check matrix in DTMB standard, and the compatible 3 kinds of code checks of the full diagonal quasi-cyclic matrix multiplier provided, have the advantages such as structure is simple, computational speed is fast, memory footprint is few.
Be further understood by detailed description and accompanying drawings below about advantage of the present invention and method.
Accompanying drawing explanation
Fig. 1 gives parameter e, c and β under different code check η;
Fig. 2 is the matrix E schematic diagram of η=0.8 code check QC-LDPC code in DTMB standard;
Fig. 3 is the basic matrix E of η=0.8 code check QC-LDPC code in DTMB standard
bASEschematic diagram;
Fig. 4 is the extended matrix E of η=0.8 code check QC-LDPC code in DTMB standard
eschematic diagram;
Fig. 5 is the quasi-cyclic matrix multiplier function block diagram of QC-LDPC code in DTMB standard.
Embodiment
Below in conjunction with accompanying drawing, preferred embodiment of the present invention is elaborated, can be easier to make advantages and features of the invention be readily appreciated by one skilled in the art, thus more explicit defining is made to protection scope of the present invention.
For the QC-LDPC code of code check arbitrary in DTMB standard, the arbitrary circular matrix H in check matrix H
i,j(1≤i≤c, 1≤j≤t) is full null matrix or is permutation matrix.Work as H
i,jwhen being permutation matrix, it can be considered unit matrix I ring shift right s
i,jthe result of position, wherein, 0≤s
i,j<b.For ease of describing, work as H
i,jwhen being full null matrix, it is denoted as to unit matrix I ring shift right s
i,jthe result of=∞ position, i.e. I
∞=0.To sum up, s
i,j∈ ∞, 0,1 ..., b-1}.
Because arbitrary code check QC-LDPC code all has full diagonal check matrix H in DTMB standard, so submatrix E and C also has full diagonal structure, but C
-1usually no longer there is full diagonal structure.Fig. 2 is the E schematic diagram of η=0.8 code check QC-LDPC code in DTMB standard, and the numeral circular matrix in figure is relative to the ring shift right figure place s of unit matrix I
i,j.Fig. 2 has t-1 bar diagonal, and every bar diagonal is all circular matrix.For the circular matrix on arbitrary diagonal, may be all full null matrix (as shown in article diagonal of the 56th in Fig. 2, s
9,1=s
10,2=s
11,3=∞), also may be all identical permutation matrix (as shown in article diagonal of the 3rd in Fig. 2, s
isosorbide-5-Nitrae 6=s
2,47=s
3,48=65), also may a part be full null matrix, remainder be identical permutation matrix (as shown in the Sub_clause 11 diagonal in Fig. 2, s
1,38=∞, and s
2,39=s
3,40=...=s
11,48=34).If the circular matrix on kth bar diagonal is all full null matrix, then they are all to unit matrix I ring shift right s
kthe result of=∞ position; Otherwise the permutation matrix on this diagonal is all to unit matrix I ring shift right s
k∈ 0,1 ..., the result of b-1} position, wherein, 1≤k≤t+c-1.To sum up, s
k∈ ∞, 0,1 ..., b-1}.In fig. 2, s
56=∞, s
3=65, s
11=34.
If by the full null matrix in " 0 " mark E, with " 1 " mark permutation matrix, so E just can be expressed as basic matrix E
bASE.Fig. 3 is the E that in Fig. 2, E is corresponding
bASE.E
bASEit is the binary matrix on c × e rank.
Next, to E
bASEcarry out expansion and cyclic shift.First, at E
bASEtop increase the full null matrix on (e-1) × e rank, be extended to the binary matrix on (t-1) × e rank.Then, to the E after expansion
bASEjth row circulation on move j-1 position, wherein, 2≤j≤e.According to aforesaid operations, the E in Fig. 3
bASEbecome the extended matrix E shown in Fig. 4
e.
For code check QC-LDPC code arbitrary in DTMB standard, E
es
1~ s
58114,79,65,68,23,117,28,13,92,84,34,12,29,102,62,3,8,122,78,115,17,70,110,53,74,21,41,67,66,42,81,60,126,31,2,63,16,116,24,57,40,22,69,18,89,48,113,120,124,5,83,93,105,47,90,101,30 and 0 respectively.
For the QC-LDPC code in DTMB standard, Fig. 5 gives its quasi-cyclic matrix multiplier, compatible 3 kinds of code checks, so that efficient calculation vector m.This full diagonal quasi-cyclic matrix multiplier is by t-1 ring shift left device C
1~ C
t-1, a t-2 b bit XOR gate X
1~ X
t-2, a t-1 multiplexer M
1~ M
t-1, a t-1 b bit register R
1~ R
t-1form with 1 look-up table ROM.
Look-up table ROM stores (t-1) × e rank extended matrix E by column
ein binary data, 3 kinds of code check QC-LDPC codes share this look-up table ROM, and its width is t-1 bit, and the degree of depth is 108.Look-up table ROM is the E of η according to code check η and row j bit rate output
ejth row t-1 bit, wherein, 1≤j≤e.
As 0≤s
kduring <b, ring shift left device C
kto message segment a
jring shift left s
kposition; Work as s
kduring=∞, ring shift left device C
knot to message segment a
jring shift left but it is directly exported, wherein, 1≤j≤e, 1≤k≤t-1, s
k∈ ∞, 0,1 ..., b-1}.As k=t-1, ring shift left device C
koutput and multiplexer M
kbe connected; As 1≤k<t-1, ring shift left device C
koutput and b bit XOR gate X
kbe connected.
B bit XOR gate X
kto ring shift left device C
koutput rusults and b bit register R
k+1content carry out mould 2 and add, and send into multiplexer M
k, wherein, 1≤k≤t-2.
Multiplexer M
k, input alternatives according to the kth bit that look-up table ROM exports to 2, selection result sends into b bit register R
k, wherein, 1≤k≤t-1.As k=t-1, if the kth bit that look-up table ROM exports is 0, then multiplexer M
kselect full null vector; Otherwise, multiplexer M
kselect ring shift left device C
koutput rusults.As 1≤k<t-1, if the kth bit that look-up table ROM exports is 0, then multiplexer M
kselect b bit register R
k+1content; Otherwise, multiplexer M
kselect b bit XOR gate X
koutput rusults.
For the QC-LDPC code in DTMB standard, the invention provides a kind of full diagonal quasi-cyclic matrix multiplication efficiently, its multiplication step is described below:
1st step, resets all b bit register R
1~ R
t-1;
2nd step, input message segment a
j, look-up table ROM is the E of η according to code check η and row j bit rate output
ejth row t-1 bit, wherein, 1≤j≤e;
3rd step, as 0≤s
kduring <b, ring shift left device C
kto message segment a
jring shift left s
kposition, and work as s
kduring=∞, ring shift left device C
knot to message segment a
jring shift left but it is directly exported, as k=t-1, ring shift left device C
koutput and multiplexer M
kbe connected, and as 1≤k<t-1, ring shift left device C
koutput and b bit XOR gate X
kbe connected, wherein, 1≤k≤t-1, s
k∈ ∞, 0,1 ..., b-1};
4th step, b bit XOR gate X
kto ring shift left device C
koutput rusults and b bit register R
k+1content carry out mould 2 and add, and send into multiplexer M
k;
5th step, multiplexer M
kinput alternatives according to the kth bit that look-up table ROM exports to 2, selection result sends into b bit register R
k, as k=t-1, if the kth bit that look-up table ROM exports is 0, then multiplexer M
kselect full null vector, otherwise, multiplexer M
kselect ring shift left device C
koutput rusults, as 1≤k<t-1, if look-up table ROM export kth bit be 0, then multiplexer M
kselect b bit register R
k+1content, otherwise, multiplexer M
kselect b bit XOR gate X
koutput rusults;
6th step, with 1 for step-length increases progressively the value changing j, repeats 2nd ~ 5 step e-1 time, until whole information vector a inputs complete, now, and b bit register R
1~ R
ccontent be vectorial m=(m
1, m
2..., m
c).
Be not difficult to find out from above step, whole computational process needs e clock cycle altogether, and the clock periodicity needed for existing full diagonal quasi-cyclic matrix multiplier equals the number β of permutation matrix in E.For 3 kinds of code check QC-LDPC codes in DTMB standard, e is 24,36 and 48 respectively, and β is 166,227 and 261 respectively.Therefore, the former coding rate is 6.9,6.3 and 5.4 times of the latter respectively.
The present invention needs 7366 registers, 7239 two input XOR gate and 6264 bit memory.Ring shift left device just changes line, not consumption of natural resource.Existing calibration equipment needs use 12426 bit memory.
As fully visible, the present invention takes full advantage of the full diagonal structure of QC-LDPC code check matrix in DTMB standard, and compatible 3 kinds of code checks, have the advantages such as structure is simple, computational speed is fast, memory footprint is few.
The above; be only 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 technical scope disclosed by the present invention; the change can expected without creative work or replacement, all should be encompassed within protection scope of the present invention.Therefore, the protection range that protection scope of the present invention should limit with claims is as the criterion.
Claims (2)
1. the full diagonal quasi-cyclic matrix multiplier in a DTMB, DTMB is the English abbreviation of digital television terrestrial broadcasting system, English full name is DigitalTelevisionTerrestrialMultimediaBroadcasting, DTMB standard have employed the QC-LDPC code of 3 kinds of different code checks, 3 kinds of different code check η are 0.4,0.6,0.8 respectively, the check matrix H of QC-LDPC code is the array be made up of c × t b × b rank circular matrix, arbitrary circular matrix H
i,jbe full null matrix or be permutation matrix, wherein, 1≤i≤c, 1≤j≤t, t=e+c, for these 3 kinds different code check QC-LDPC codes, all there is t=59 and b=127, the parameter e that 3 kinds of different code checks are corresponding is 24,36 and 48 respectively, and the parameter c that 3 kinds of different code checks are corresponding is 35,23,11 respectively, works as H
i,jwhen being permutation matrix, it can be considered b × b rank unit matrix I ring shift right s
i,jthe result of position, wherein, 0≤s
i,j<b, works as H
i,jwhen being full null matrix, it is denoted as to b × b rank unit matrix I ring shift right s
i,jthe result of=∞ position, i.e. I
∞=0, the continuous b of H capable and b row are called as the capable and block row of block respectively, the matrix that the front e block row of H are formed is denoted as E, QC-LDPC code in DTMB has the H of full diagonal structure, submatrix E also has full diagonal structure, E has t-1 bar diagonal, circular matrix on arbitrary diagonal, it may be all full null matrix, also may be all identical permutation matrix, may a part be also full null matrix, remainder is identical permutation matrix, if the circular matrix on kth bar diagonal is all full null matrix, then they are all to b × b rank unit matrix I ring shift right s
kthe result of=∞ position, otherwise the permutation matrix on this diagonal is all to b × b rank unit matrix I ring shift right s
k∈ 0,1 ..., the result of b-1} position, wherein, 1≤k≤t-1, if identify the full null matrix in E with " 0 ", with " 1 " mark permutation matrix, so E just can be expressed as basic matrix E
bASE, at E
bASEtop increase the full null matrix on (e-1) × e rank, be extended to the binary matrix on (t-1) × e rank, on this basis, to the E after expansion
bASEjth row circulation on move j-1 position, wherein, 2≤j≤e, by E
bASEbecome extended matrix E
e, be one section with b bit, information vector a is divided into e section, i.e. a=(a
1, a
2..., a
e), vectorial m
t=Ea
t, vectorial m is divided into c section, i.e. m=(m
1, m
2..., m
c), it is characterized in that, described multiplier comprises with lower component:
Look-up table ROM, stores (t-1) × e rank extended matrix E by column
ein binary data, 3 kinds of code check QC-LDPC codes share this look-up table ROM, and its width is t-1 bit, and the degree of depth is 108, and look-up table ROM is the E of η according to code check η and row j bit rate output
ejth row t-1 bit, wherein, 1≤j≤e;
Ring shift left device C
1~ C
t-1, as 0≤s
kduring <b, ring shift left device C
kto message segment a
jring shift left s
kposition, works as s
kduring=∞, ring shift left device C
knot to message segment a
jring shift left but it is directly exported, wherein, 1≤j≤e, 1≤k≤t-1, s
k∈ ∞, 0,1 ..., b-1}, as k=t-1, ring shift left device C
koutput and multiplexer M
kbe connected, as 1≤k<t-1, ring shift left device C
koutput and b bit XOR gate X
kbe connected;
B bit XOR gate X
1~ X
t-2, b bit XOR gate X
kto ring shift left device C
koutput rusults and b bit register R
k+1content carry out mould 2 and add, and send into multiplexer M
k, wherein, 1≤k≤t-2;
Multiplexer M
1~ M
t-1, multiplexer M
kinput alternatives according to the kth bit that look-up table ROM exports to 2, selection result sends into b bit register R
k, wherein, 1≤k≤t-1, as k=t-1, if the kth bit that look-up table ROM exports is 0, then multiplexer M
kselect full null vector, otherwise, multiplexer M
kselect ring shift left device C
koutput rusults, as 1≤k<t-1, if look-up table ROM export kth bit be 0, then multiplexer M
kselect b bit register R
k+1content, otherwise, multiplexer M
kselect b bit XOR gate X
koutput rusults.
2. the full diagonal quasi-cyclic matrix multiplication in a DTMB, DTMB is the English abbreviation of digital television terrestrial broadcasting system, English full name is DigitalTelevisionTerrestrialMultimediaBroadcasting, DTMB standard have employed the QC-LDPC code of 3 kinds of different code checks, 3 kinds of different code check η are 0.4,0.6,0.8 respectively, the check matrix H of QC-LDPC code is the array be made up of c × t b × b rank circular matrix, arbitrary circular matrix H
i,jbe full null matrix or be permutation matrix, wherein, 1≤i≤c, 1≤j≤t, t=e+c, for these 3 kinds different code check QC-LDPC codes, all there is t=59 and b=127, the parameter e that 3 kinds of different code checks are corresponding is 24,36 and 48 respectively, and the parameter c that 3 kinds of different code checks are corresponding is 35,23,11 respectively, works as H
i,jwhen being permutation matrix, it can be considered b × b rank unit matrix I ring shift right s
i,jthe result of position, wherein, 0≤s
i,j<b, works as H
i,jwhen being full null matrix, it is denoted as to b × b rank unit matrix I ring shift right s
i,jthe result of=∞ position, i.e. I
∞=0, the continuous b of H capable and b row are called as the capable and block row of block respectively, the matrix that the front e block row of H are formed is denoted as E, QC-LDPC code in DTMB has the H of full diagonal structure, submatrix E also has full diagonal structure, E has t-1 bar diagonal, circular matrix on arbitrary diagonal, it may be all full null matrix, also may be all identical permutation matrix, may a part be also full null matrix, remainder is identical permutation matrix, if the circular matrix on kth bar diagonal is all full null matrix, then they are all to b × b rank unit matrix I ring shift right s
kthe result of=∞ position, otherwise the permutation matrix on this diagonal is all to b × b rank unit matrix I ring shift right s
k∈ 0,1 ..., the result of b-1} position, wherein, 1≤k≤t-1, if identify the full null matrix in E with " 0 ", with " 1 " mark permutation matrix, so E just can be expressed as basic matrix E
bASE, at E
bASEtop increase the full null matrix on (e-1) × e rank, be extended to the binary matrix on (t-1) × e rank, on this basis, to the E after expansion
bASEjth row circulation on move j-1 position, wherein, 2≤j≤e, by E
bASEbecome extended matrix E
e, be one section with b bit, information vector a is divided into e section, i.e. a=(a
1, a
2..., a
e), vectorial m
t=Ea
t, vectorial m is divided into c section, i.e. m=(m
1, m
2..., m
c), it is characterized in that, described multiplication comprises the following steps:
1st step, resets all b bit register R
1~ R
t-1;
2nd step, input message segment a
j, look-up table ROM is the E of η according to code check η and row j bit rate output
ejth row t-1 bit, wherein, 1≤j≤e;
3rd step, as 0≤s
kduring <b, ring shift left device C
kto message segment a
jring shift left s
kposition, and work as s
kduring=∞, ring shift left device C
knot to message segment a
jring shift left but it is directly exported, as k=t-1, ring shift left device C
koutput and multiplexer M
kbe connected, and as 1≤k<t-1, ring shift left device C
koutput and b bit XOR gate X
kbe connected, wherein, 1≤k≤t-1, s
k∈ ∞, 0,1 ..., b-1};
4th step, b bit XOR gate X
kto ring shift left device C
koutput rusults and b bit register R
k+1content carry out mould 2 and add, and send into multiplexer M
k;
5th step, multiplexer M
kinput alternatives according to the kth bit that look-up table ROM exports to 2, selection result sends into b bit register R
k, as k=t-1, if the kth bit that look-up table ROM exports is 0, then multiplexer M
kselect full null vector, otherwise, multiplexer M
kselect ring shift left device C
koutput rusults, as 1≤k<t-1, if look-up table ROM export kth bit be 0, then multiplexer M
kselect b bit register R
k+1content, otherwise, multiplexer M
kselect b bit XOR gate X
koutput rusults;
6th step, with 1 for step-length increases progressively the value changing j, repeats 2nd ~ 5 step e-1 time, until whole information vector a inputs complete, now, and b bit register R
1~ R
ccontent be vectorial m=(m
1, m
2..., m
c).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610004205.6A CN105450235A (en) | 2016-01-01 | 2016-01-01 | Full-diagonal quasi-cyclic matrix multiplier in DTMB |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610004205.6A CN105450235A (en) | 2016-01-01 | 2016-01-01 | Full-diagonal quasi-cyclic matrix multiplier in DTMB |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105450235A true CN105450235A (en) | 2016-03-30 |
Family
ID=55560088
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610004205.6A Withdrawn CN105450235A (en) | 2016-01-01 | 2016-01-01 | Full-diagonal quasi-cyclic matrix multiplier in DTMB |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105450235A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494546A (en) * | 2018-02-13 | 2018-09-04 | 北京梆梆安全科技有限公司 | A kind of whitepack encryption method, device and storage medium |
| CN109889207A (en) * | 2019-01-04 | 2019-06-14 | 浙江大学 | Based on the LDPC channel coding method of double diagonal line structure in NAVDAT |
-
2016
- 2016-01-01 CN CN201610004205.6A patent/CN105450235A/en not_active Withdrawn
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494546A (en) * | 2018-02-13 | 2018-09-04 | 北京梆梆安全科技有限公司 | A kind of whitepack encryption method, device and storage medium |
| CN109889207A (en) * | 2019-01-04 | 2019-06-14 | 浙江大学 | Based on the LDPC channel coding method of double diagonal line structure in NAVDAT |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103236850A (en) | Rotate left-based quasi-cyclic (QC) matrix serial multiplier in deep space communication | |
| CN102857238B (en) | LDPC (Low Density Parity Check) encoder and encoding method based on summation array in deep space communication | |
| CN102857236A (en) | China mobile multimedia broadcasting (CMMB) low density parity check (LDPC) encoder based on summation array and coding method | |
| CN105450235A (en) | Full-diagonal quasi-cyclic matrix multiplier in DTMB | |
| CN103929199A (en) | Full parallel input quasi-cyclic matrix multiplier based on ring shift left in DTMB | |
| CN103235713A (en) | Rotate left based quasi-cyclic matrix serial multiplier in digital terrestrial multimedia broadcasting (DTMB) | |
| CN105450234A (en) | Verification apparatus of QC-LDPC code in DTMB | |
| CN103236852B (en) | Without quasi cyclic matrix serial multiplier in the DTMB of multiplying | |
| CN105450233A (en) | Full-diagonal quasi-cyclic matrix multiplier of QC-LDPC code | |
| CN103236857B (en) | Without the need to the quasi-cyclic matrix high-speed gear of memory | |
| CN105680878A (en) | Checking device of QC-LDPC code with full diagonal check matrix | |
| CN103929207A (en) | Partially parallel input QC-LDPC encoder based on right-shift accumulation in CMMB | |
| CN104980167A (en) | QC-LDPC parallel encoder, based on summation array, in CDR | |
| CN103929194A (en) | Partially parallel input QC-LDPC encoder based on right-shift accumulation in WPAN | |
| CN103929189A (en) | Partial parallel input left shift accumulation QC-LDPC encoder in near-earth communications | |
| CN103916135A (en) | Ring shift left QC-LDPC coder with fully parallel input in ground proximity communication | |
| CN103929200A (en) | Full parallel input QC-LDPC encoder based on ring shift left in CDR | |
| CN103905055A (en) | Partial parallel input QC-LDPC encoder for right shift accumulation | |
| CN103905056A (en) | Accumulation left shift quasi-cyclic matrix multiplier for partially-parallel input in CMMB | |
| CN103268212B (en) | Without the need to quasi-cyclic matrix high-speed multiplier in the deep space communication of storer | |
| CN103888150A (en) | Ring-shift-left QC matrix multiplier based on fully parallel input | |
| CN103929205A (en) | Full-parallel-input cyclic-left-shift QC-LDPC encoder in deep space communication | |
| CN107181492A (en) | Second part inputs the cumulative LDPC encoder moved to left parallel in WPAN | |
| CN105049058A (en) | QC-LDPC serial encoder in CDR based on cyclic left shift | |
| CN105117197A (en) | Multiplication-free quasi-cyclic matrix serial multiplier for WPAN (wireless personal area network) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20160330 |