CN103268217A - Quasi-cyclic matrix serial multiplier based on rotate left - Google Patents

Quasi-cyclic matrix serial multiplier based on rotate left Download PDF

Info

Publication number
CN103268217A
CN103268217A CN2013101388397A CN201310138839A CN103268217A CN 103268217 A CN103268217 A CN 103268217A CN 2013101388397 A CN2013101388397 A CN 2013101388397A CN 201310138839 A CN201310138839 A CN 201310138839A CN 103268217 A CN103268217 A CN 103268217A
Authority
CN
China
Prior art keywords
circular matrix
generator polynomial
bit
shift register
matrix
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.)
Pending
Application number
CN2013101388397A
Other languages
Chinese (zh)
Inventor
张鹏
刘志文
张燕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
RONGCHENG DINGTONG ELECTRONIC INFORMATION TECHNOLOGY Co Ltd
Original Assignee
RONGCHENG DINGTONG ELECTRONIC INFORMATION TECHNOLOGY Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by RONGCHENG DINGTONG ELECTRONIC INFORMATION TECHNOLOGY Co Ltd filed Critical RONGCHENG DINGTONG ELECTRONIC INFORMATION TECHNOLOGY Co Ltd
Priority to CN2013101388397A priority Critical patent/CN103268217A/en
Publication of CN103268217A publication Critical patent/CN103268217A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Complex Calculations (AREA)

Abstract

The invention provides a quasi-cyclic matrix serial multiplier based on rotate left. The quasi-cyclic matrix serial multiplier is used for implementing multiplication of a vector m and a quasi-cyclic matrix F in QC-LDPC (quasi-cyclic low-density parity-check) approximate lower triangular encodings. The multiplier comprises u generated polynomial lookup tables, u b-bit binary multipliers, u b-bit binary summators and u b-bit shift registers. The generated polynomial lookup tables are used for pre-storing quasi-cyclic matrix generated polynomial in the matrix F. The b-bit binary multipliers are used for performing scalar multiplication of the vector m data bit and the generated polynomial. The b-bit binary summators are used for performing modulo-2 adding of products and shift register contents. The b-bit shift registers are used for storing sums of 1-bit movements subjected to rotate left. The quasi-cyclic matrix serial multiplier has the advantages of small number of registers, simple structure, low power consumption and cost and the like.

Description

Accurate circular matrix serial multiplier based on ring shift left
Technical field
The present invention relates to field of channel coding, particularly the accurate circular matrix serial multiplier in a kind of 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 ALT = A B L C D E - - - ( 1 )
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:
Figure BDA00003070941500021
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, jBe circular matrix F I, jGenerator polynomial.
Make vectorial m=(e 0, e 1..., e U * b-1), part verification vector p=(d 0, d 1..., 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 0, m 1..., m U-1) and p=(p 0, p 1..., p U-1).By formula (5) as can be known, the j section p of part verification vector jSatisfy
p j=m 0F 0,j+m 1F 1,j+…+m iF i,j+…+m u-1F u-1,j (7)
Wherein, 0≤i<u, 0≤j<u.Order
Figure BDA00003070941500022
With
Figure BDA00003070941500023
Be respectively generator polynomial f I, jThe result of ring shift right n position and ring shift left n position, wherein, 0≤n≤b.So, the i item on formula (7) equal sign the right is deployable is
m i F i , j = e i × b f i , j r ( 0 ) + e i × b + 1 f i , j r ( 1 ) + · · · + e i × b + b f i , j r ( b - 1 ) - - - ( 8 )
Formula (5) relates to the multiplication of vector and accurate circular matrix, and u the I type shift register that be based on that extensively adopts adds totalizer (Type-I Shift-Register-Adder-Accumulator, SRAA-I) scheme of circuit at present.Fig. 1 is the functional block diagram of single SRAA-I circuit, and vectorial m serial by turn sends into this circuit.When using SRAA-I circuit calculation check section p j(during 0≤j<u), the generator polynomial look-up table is stored all generator polynomials of the j piece row of accurate circular matrix F in advance, and totalizer is cleared initialization.When the 0th clock period arrived, shift register loaded the 0th row of F, the generator polynomial of j piece row from the generator polynomial look-up table
Figure BDA00003070941500025
Bit e 0Move into circuit, and with the content of shift register
Figure BDA00003070941500026
Carry out scalar and take advantage of product
Figure BDA00003070941500027
Add with content 0 mould 2 of totalizer and
Figure BDA00003070941500028
Deposit back totalizer.When the 1st clock period arrives, 1 of shift register ring shift right, content becomes
Figure BDA00003070941500029
Bit e 1Move into circuit, and with the content of shift register
Figure BDA000030709415000210
Carry out scalar and take advantage of product
Figure BDA000030709415000211
Content with totalizer
Figure BDA000030709415000212
Mould 2 add and
Figure BDA000030709415000213
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 B-1Moved into circuit, that cumulative adder stores is part and m at this moment 0F 0, j, this is array section m 0To p jContribution.When b clock period arrived, shift register loaded the 1st row of F, the generator polynomial of j piece row from the generator polynomial look-up table
Figure BDA000030709415000214
Repeat above-mentioned moving to right-take advantage of-Jia-storing process.As array section m 1When moving into circuit fully, cumulative adder stores be the part and m 0F 0, j+ m 1F 1, jRepeat said process, move into circuit up to the whole serials of whole vectorial m.At this moment, that cumulative adder stores is verification section p jUse u SRAA-I circuit can constitute accurate circular matrix serial multiplier shown in Figure 2, it obtains u verification section simultaneously in u * b clock period.This scheme needs 2 * u * b register, u * b two input and door and u * b two input XOR gate, also needs the generator polynomial of u u * b bit ROM storage circular matrix.
The existing solution of accurate circular matrix serial multiplication is based on u SRAA-I circuit in the QC-LDPC near lower triangular coding, and one of shortcoming of this scheme is a large amount of registers of needs, will certainly cause the power consumption of circuit big, cost is high.
Summary of the invention
There is the shortcoming that power consumption is big, cost is high in the existing implementation of accurate circular matrix serial multiplication in the QC-LDPC near lower triangular coding, at these technical matterss, the invention provides a kind of accurate circular matrix serial multiplier based on ring shift left.
As shown in Figure 4, the accurate circular matrix serial multiplier in the QC-LDPC near lower triangular coding mainly is made up of 4 parts: generator polynomial look-up table, b position binary multiplier, b position binary adder and shift register.Multiplication process divided for 3 steps finished: the 1st step, zero clearing shift register R 0, R 1..., R U-1The 2nd step, input bit e k(0≤k<u * b), generator polynomial look-up table L 0, L 1..., L U-1Export accurate circular matrix F i=[k/b respectively] (symbol [k/b] expression is not more than the maximum integer of k/b) during piece is capable the 0th, 1 ..., the generator polynomial of u-1 piece row, these generator polynomials are respectively by b position binary multiplier M 0, M 1..., M U-1With bit e kCarry out scalar and take advantage of, b position binary multiplier M 0, M 1..., M U-1Product respectively by b position binary adder A 0, A 1..., A U-1With shift register R 0, R 1..., R U-1The content addition, b position binary adder A 0, A 1..., A U-1And be recycled the result who moves to left after 1 and deposit shift register R respectively in 0, R 1..., R U-1The 3rd step be that step-length increases progressively the value that changes k with 1, repeated the 2nd step u * b time, import up to whole vectorial m to finish, at this moment, shift register R 0, R 1..., R U-1That store is respectively verification section p 0, p 1..., p U-1, they have constituted part verification vector p=(p 0, p 1..., p U-1).
Accurate circular matrix serial multiplier provided by the invention is simple in structure, can reduce register under the condition that keeps speed, reduces power consumption, saves 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 accurate circular matrix serial multiplier that is made of u SRAA-I circuit;
Fig. 3 takes advantage of the functional block diagram that adds shift register MASR circuit;
Fig. 4 is a kind of accurate circular matrix serial multiplier based on ring shift left that is made of u MASR 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, jRing shift right n position is equivalent to its ring shift left b-n position, namely f i , j r ( n ) = f i , j l ( b - n ) , Formula (8) can be rewritten as so
m i F i , j = e i × b f i , j l ( b ) + e i × b + 1 f i , j l ( b - 1 ) + · · · + e i × b + b - 1 f i , j l ( 1 )
= ( e i × b f i , j ) l ( b ) + ( e i × b + 1 f i , j ) l ( b - 1 ) + · · · + ( e i × b + b - 1 f i , j ) l ( 1 )
= ( 0 + e i × b f i , j ) l ( b ) + ( e i × b + 1 f i , j ) l ( b - 1 ) + · · · + ( e i × b + b - 1 f i , j ) l ( 1 ) - - - ( 9 )
= ( ( 0 + e i × b f i , j ) l ( 1 ) + e i × b + 1 f i , j ) l ( b - 1 ) + · · · + ( e i × b + b - 1 f i , j ) l ( 1 )
= ( · · · ( ( 0 + e i × b f i , j ) l ( 1 ) + e i × b + 1 f i , j ) l ( 1 ) + · · · + e i × b + b - 1 f i , j ) l ( 1 )
Compare with formula (8), the remarkable advantage of formula (9) is generator polynomial f I, jNeed not ring shift right.Formula (9) is one to be taken advantage of-process of Jia-move to left-store, and its realization adds shift register (Multiplier-Adder-Shift-Register, MASR) circuit with taking advantage of.Fig. 3 is the functional block diagram of MASR circuit, and vectorial m is sent into this circuit by serial by turn.When using MASR circuit calculation check section p j(during 0≤j<u), the generator polynomial look-up table is stored all generator polynomials of the j piece row of accurate circular matrix F in advance, and shift register is cleared initialization.When the 0th clock period arrives, the 0th row of generator polynomial look-up table output F, the generator polynomial f of j piece row 0, j, bit e 0Move into circuit, and with generator polynomial f 0, jCarry out scalar and take advantage of, product e 0f 0, jAdd with content 0 mould 2 of shift register, and e 0f 0, jResult (the 0+e that ring shift left is 1 0f 0, j) L (1)Deposit the travelling backwards bit register.When the 1st clock period arrived, the output of generator polynomial look-up table remained unchanged, bit e 1Move into circuit, and with generator polynomial f 0, jCarry out scalar and take advantage of, product e 1f 0, jContent (0+e with shift register 0f 0, j) L (1)Mould 2 adds and (0+e 0f 0, j) L (1)+ e 1f 0, jThe result ((0+e that ring shift left is 1 0f 0, j) L (1)+ e 1f 0, j) L (1)Deposit the travelling backwards bit register.Above-mentioned taking advantage of-Jia-move to left-storing process is proceeded down.When b-1 clock period finishes, bit e B-1Moved into circuit, that this moment, shift register was stored is part and m 0F 0, j, this is array section m 0To p jContribution.When b clock period arrives, the 1st row of generator polynomial look-up table output F, the generator polynomial f of j piece row 1, j, repeat above-mentioned taking advantage of-Jia-move to left-storing process.As array section m 1When moving into circuit fully, that shift register is stored is part and m 0F 0, j+ m 1F 1, jRepeat said process, move into circuit up to the whole serials of whole vectorial m.At this moment, that the shift register storage is verification section p j
Fig. 4 has provided a kind of accurate circular matrix serial multiplier based on ring shift left that is made of u MASR circuit, is made up of generator polynomial look-up table, b position binary multiplier, b position binary adder and four kinds of functional modules of shift register.Generator polynomial look-up table L 0, L 1..., L U-1The accurate circular matrix F the 0th, 1 that prestores respectively ..., the circular matrix generator polynomial in the u-1 piece row.Generator polynomial look-up table L 0, L 1..., L U-1The generator polynomial of output respectively with the bit e of vectorial m k(0≤k<u * b) carry out scalar to take advantage of, this u scalar multiplication are respectively by b position binary multiplier M 0, M 1..., M U-1Finish.B position binary multiplier M 0, M 1..., M U-1Product respectively with shift register R 0, R 1..., R U-1The content addition, this u nodulo-2 addition is respectively by b position binary adder A 0, A 1..., A U-1Finish.B position binary adder A 0, A 1..., A U-1And be recycled the result who moves to left after 1 and deposit shift register R respectively in 0, R 1..., R U-1
Generator polynomial look-up table L 0, L 1..., L U-1Store the circular matrix generator polynomial among the accurate circular matrix F.Generator polynomial look-up table L 0~L U-1Store all generator polynomials in the 0th~u-1 piece row of F respectively, for arbitrary row, store the 0th, 1 successively ..., the generator polynomial of the capable correspondence of u-1 piece.
The invention provides a kind of accurate circular matrix serial multiplication based on ring shift left, its multiplication step is described below:
The 1st step, zero clearing shift register R 0, R 1..., R U-1
The 2nd step, input bit e k(0≤k<u * b), generator polynomial look-up table L 0, L 1..., L U-1Export accurate circular matrix F i=[k/b respectively] (symbol [k/b] expression is not more than the maximum integer of k/b) during piece is capable the 0th, 1 ..., the generator polynomial of u-1 piece row, these generator polynomials are respectively by b position binary multiplier M 0, M 1..., M U-1With bit e kCarry out scalar and take advantage of, b position binary multiplier M 0, M 1..., M U-1Product respectively by b position binary adder A 0, A 1..., A U-1With shift register R 0, R 1..., R U-1The content addition, b position binary adder A 0, A 1..., A U-1And be recycled the result who moves to left after 1 and deposit shift register R respectively in 0, R 1..., R U-1
The 3rd step be that step-length increases progressively the value that changes k with 1, repeated the 2nd step u * b time, import up to whole vectorial m to finish, at this moment, shift register R 0, R 1..., R U-1That store is respectively verification section p 0, p 1..., p U-1, they have constituted part verification vector p=(p 0, p 1..., p U-1).
Be not difficult to find out that from above step whole computation process needs u * b clock period altogether, identical with existing multiplication scheme based on u SRAA-I circuit.
The existing solution of accurate circular matrix serial multiplication needs 2 * u * b register, u * b two input and door and u * b two input XOR gate, and the present invention needs u * b register, u * b two input and door and u * b two input XOR gate.Two kinds of multiplication scheme expend equal number with door and XOR gate, the present invention has saved 50% register.
As fully visible, for the accurate circular matrix serial multiplication in the QC-LDPC near lower triangular coding, compare with existing solution, the present invention has kept identical speed, has saved the register of half, have simple in structure, 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 (3)

1. accurate circular matrix serial multiplier based on ring shift left, when adopting the near lower triangular coding method that the 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, jThe array that constitutes, f I, jBe circular matrix F I, jGenerator polynomial, wherein, b, i, j and u are nonnegative integer, 0≤i<u, 0≤j<u, vectorial m=(e 0, e 1..., e U * b-1), be one section with the b bit, part verification vector p is divided into the u section, i.e. p=(p 0, p 1..., p U-1), it is characterized in that described multiplier comprises with lower member:
Generator polynomial look-up table L 0, L 1..., L U-1, among the accurate circular matrix F that prestores respectively the 0th, 1 ..., the circular matrix generator polynomial of u-1 piece row;
B position binary multiplier M 0, M 1..., M U-1, respectively to bit and the generator polynomial look-up table L of vectorial m 0, L 1..., L U-1Output carry out scalar and take advantage of;
B position binary adder A 0, A 1..., A U-1, respectively to b position binary multiplier M 0, M 1..., M U-1Sum of products shift register R 0, R 1..., R U-1Content carry out mould 2 and add;
Shift register R 0, R 1..., R U-1, store b position binary adder A respectively 0, A 1..., A U-1And be recycled the result that moves to left after 1 and final verification section p 0, p 1..., p U-1
2. a kind of accurate circular matrix serial multiplier based on ring shift left according to claim 1 is characterized in that described generator polynomial look-up table L 0~L U-1Store all generator polynomials in the 0th~u-1 piece row of F respectively, for arbitrary row, store the 0th, 1 successively ..., the generator polynomial of the capable correspondence of u-1 piece.
3. accurate circular matrix serial multiplication method based on ring shift left, when adopting the near lower triangular coding method that the 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, jThe array that constitutes, f I, jBe circular matrix F I, jGenerator polynomial, wherein, b, i, j and u are nonnegative integer, 0≤i<u, 0≤j<u, vectorial m=(e 0, e 1..., e U * b-1), be one section with the b bit, part verification vector p is divided into the u section, i.e. p=(p 0, p 1..., p U-1), it is characterized in that described multiplication method may further comprise the steps:
The 1st step, zero clearing shift register R 0, R 1..., R U-1
The 2nd step, input bit e k, generator polynomial look-up table L 0, L 1..., L U-1Export accurate circular matrix F i=[k/b respectively] during piece is capable the 0th, 1 ..., the generator polynomial of u-1 piece row, these generator polynomials are respectively by b position binary multiplier M 0, M 1..., M U-1With bit e kCarry out scalar and take advantage of, b position binary multiplier M 0, M 1..., M U-1Product respectively by b position binary adder A 0, A 1..., A U-1With shift register R 0, R 1..., R U-1The content addition, b position binary adder A 0, A 1..., A U-1And be recycled the result who moves to left after 1 and deposit shift register R respectively in 0, R 1..., R U-1, wherein, 0≤k<u * b, symbol [k/b] expression is not more than the maximum integer of k/b;
The 3rd step be that step-length increases progressively the value that changes k with 1, repeated the 2nd step u * b time, import up to whole vectorial m to finish, at this moment, shift register R 0, R 1..., R U-1That store is respectively verification section p 0, p 1..., p U-1, they have constituted part verification vector p=(p 0, p 1..., p U-1).
CN2013101388397A 2013-04-19 2013-04-19 Quasi-cyclic matrix serial multiplier based on rotate left Pending CN103268217A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2013101388397A CN103268217A (en) 2013-04-19 2013-04-19 Quasi-cyclic matrix serial multiplier based on rotate left

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2013101388397A CN103268217A (en) 2013-04-19 2013-04-19 Quasi-cyclic matrix serial multiplier based on rotate left

Publications (1)

Publication Number Publication Date
CN103268217A true CN103268217A (en) 2013-08-28

Family

ID=49011851

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2013101388397A Pending CN103268217A (en) 2013-04-19 2013-04-19 Quasi-cyclic matrix serial multiplier based on rotate left

Country Status (1)

Country Link
CN (1) CN103268217A (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103888150A (en) * 2014-04-23 2014-06-25 荣成市鼎通电子信息科技有限公司 Ring-shift-left QC matrix multiplier based on fully parallel input
CN103905056A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 Accumulation left shift quasi-cyclic matrix multiplier for partially-parallel input in CMMB
CN103905060A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 Accumulation left shift quasi-cyclic matrix multiplier for partially-parallel input in WPAN
CN103905058A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 Partial parallel input quasi-cyclic matrix multiplier for right shift accumulation
CN103902509A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 ROL quasi-cyclic matrix multiplier for full parallel input in WPAN
CN103914434A (en) * 2014-04-23 2014-07-09 荣成市鼎通电子信息科技有限公司 Partial parallel input right shift accumulation quasi-cyclic matrix multiplier in DTMB
CN103929191A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partial-parallel-input left-shift accumulation quasi-cyclic matrix multiplying unit in deep space communication
CN103929198A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Full parallel input quasi-cyclic matrix multiplier based on ring shift left in CMMB
CN103929195A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partially parallel input quasi-cyclic matrix multiplier based on right-shift accumulation in WPAN
CN103929272A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partially parallel input quasi-cyclic matrix multiplier based on right-shift accumulation in CMMB
CN103929201A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partial-parallel-input right-shift accumulation quasi-cyclic matrix multiplying unit in deep space communication
CN104090737A (en) * 2014-07-04 2014-10-08 东南大学 Improved partial parallel architecture multiplying unit and processing method thereof
CN105045559A (en) * 2014-05-01 2015-11-11 想象技术有限公司 Approximating Functions
CN105242902A (en) * 2015-10-03 2016-01-13 荣成市鼎通电子信息科技有限公司 WPAN quasi-cyclic matrix serial multiplier based on ring shift left

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050086278A1 (en) * 2003-10-16 2005-04-21 Samsung Electronics Co., Ltd. Method and apparatus for performing multiplication in finite field GF(2n)
CN101335528A (en) * 2008-08-07 2008-12-31 中山大学 Construction method and encoding method for multiple LDPC code
CN101399553A (en) * 2008-11-12 2009-04-01 清华大学 Quasi-loop LDPC code encoding device capable of on-line programming
CN102857240A (en) * 2012-09-27 2013-01-02 苏州威士达信息科技有限公司 LDPC (Low Density Parity Check) encoder and encoding method based on circulation shift right accumulation in deep space communication
CN102857324A (en) * 2012-09-27 2013-01-02 苏州威士达信息科技有限公司 Low density parity check (LDPC) serial coder in deep space communication and based on lookup table and coding method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050086278A1 (en) * 2003-10-16 2005-04-21 Samsung Electronics Co., Ltd. Method and apparatus for performing multiplication in finite field GF(2n)
CN101335528A (en) * 2008-08-07 2008-12-31 中山大学 Construction method and encoding method for multiple LDPC code
CN101399553A (en) * 2008-11-12 2009-04-01 清华大学 Quasi-loop LDPC code encoding device capable of on-line programming
CN102857240A (en) * 2012-09-27 2013-01-02 苏州威士达信息科技有限公司 LDPC (Low Density Parity Check) encoder and encoding method based on circulation shift right accumulation in deep space communication
CN102857324A (en) * 2012-09-27 2013-01-02 苏州威士达信息科技有限公司 Low density parity check (LDPC) serial coder in deep space communication and based on lookup table and coding method

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103929195A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partially parallel input quasi-cyclic matrix multiplier based on right-shift accumulation in WPAN
CN103905060A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 Accumulation left shift quasi-cyclic matrix multiplier for partially-parallel input in WPAN
CN103929272A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partially parallel input quasi-cyclic matrix multiplier based on right-shift accumulation in CMMB
CN103929201A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partial-parallel-input right-shift accumulation quasi-cyclic matrix multiplying unit in deep space communication
CN103902509A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 ROL quasi-cyclic matrix multiplier for full parallel input in WPAN
CN103914434A (en) * 2014-04-23 2014-07-09 荣成市鼎通电子信息科技有限公司 Partial parallel input right shift accumulation quasi-cyclic matrix multiplier in DTMB
CN103929191A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Partial-parallel-input left-shift accumulation quasi-cyclic matrix multiplying unit in deep space communication
CN103929198A (en) * 2014-04-23 2014-07-16 荣成市鼎通电子信息科技有限公司 Full parallel input quasi-cyclic matrix multiplier based on ring shift left in CMMB
CN103888150A (en) * 2014-04-23 2014-06-25 荣成市鼎通电子信息科技有限公司 Ring-shift-left QC matrix multiplier based on fully parallel input
CN103905056A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 Accumulation left shift quasi-cyclic matrix multiplier for partially-parallel input in CMMB
CN103905058A (en) * 2014-04-23 2014-07-02 荣成市鼎通电子信息科技有限公司 Partial parallel input quasi-cyclic matrix multiplier for right shift accumulation
CN103929272B (en) * 2014-04-23 2019-02-22 荣成市鼎通电子信息科技有限公司 What part parallel inputted in CMMB moves to right cumulative quasi-cyclic matrix multiplier
CN105045559A (en) * 2014-05-01 2015-11-11 想象技术有限公司 Approximating Functions
CN105045559B (en) * 2014-05-01 2019-04-09 想象技术有限公司 Binary logic circuits, the method and its manufacturing method for obtaining the expression of its hardware
US10642578B2 (en) 2014-05-01 2020-05-05 Imagination Technologies Limited Approximating functions
CN104090737B (en) * 2014-07-04 2017-04-05 东南大学 A kind of modified model part parallel framework multiplier and its processing method
CN104090737A (en) * 2014-07-04 2014-10-08 东南大学 Improved partial parallel architecture multiplying unit and processing method thereof
CN105242902A (en) * 2015-10-03 2016-01-13 荣成市鼎通电子信息科技有限公司 WPAN quasi-cyclic matrix serial multiplier based on ring shift left

Similar Documents

Publication Publication Date Title
CN103268217A (en) Quasi-cyclic matrix serial multiplier based on rotate left
CN103248372A (en) Quasi-cyclic LDPC serial encoder based on ring shift left
CN103236850A (en) Rotate left-based quasi-cyclic (QC) matrix serial multiplier in deep space communication
CN103268215A (en) Rotate-left-based quasi-cyclic matrix serial multiplier for China mobile multimedia broadcasting (CMMB)
CN103235713A (en) Rotate left based quasi-cyclic matrix serial multiplier in digital terrestrial multimedia broadcasting (DTMB)
CN103902509A (en) ROL quasi-cyclic matrix multiplier for full parallel input in WPAN
CN103929199A (en) Full parallel input quasi-cyclic matrix multiplier based on ring shift left in DTMB
CN103236855A (en) Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in near field communication
CN103268214A (en) Quasi-cyclic matrix high-speed multiplier in deep space communication based on lookup table
CN103269227A (en) Quasi-cyclic LDPC serial coder based on cyclic left shift and in deep space communication
CN103236858A (en) Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in China mobile multimedia broadcasting (CMMB)
CN103236856A (en) Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in digital television terrestrial multimedia broadcasting (DTMB)
CN103929191A (en) Partial-parallel-input left-shift accumulation quasi-cyclic matrix multiplying unit in deep space communication
CN103905060A (en) Accumulation left shift quasi-cyclic matrix multiplier for partially-parallel input in WPAN
CN103257843A (en) Quasi cyclic matrix serial multiplier free of multiplication
CN103236851A (en) Quasi-cyclic matrix high-speed multiplier based on look-up table in CMMB (China Mobile Multimedia Broadcasting)
CN103902508A (en) Accumulation left shift quasi-cyclic matrix multiplier with partial parallel input
CN103236849B (en) Based on quasi cyclic matrix serial multiplier in the DTMB of shared memory mechanism
CN103236857A (en) Quasi-cyclic matrix high-speed multiplier without memory
CN103905056A (en) Accumulation left shift quasi-cyclic matrix multiplier for partially-parallel input in CMMB
CN103929193A (en) Partial parallel input accumulation left shift QC-LDPC coder
CN103888150A (en) Ring-shift-left QC matrix multiplier based on fully parallel input
CN103268211A (en) Shared storage mechanism-based quasi-cyclic matrix serial multiplier for China mobile multimedia broadcasting (CMMB)
CN103236852A (en) Quasi-cyclic matrix serial multiplier without multiply operation in DTMB (Digital Television Terrestrial Multimedia Broadcasting)
CN103916135A (en) Ring shift left QC-LDPC coder with fully parallel input in ground proximity communication

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20130828