CN104980166A - Quasi cyclic LDPC serial encoder, sharing storage mechanism, in WPAN - Google Patents
Quasi cyclic LDPC serial encoder, sharing storage mechanism, in WPAN Download PDFInfo
- Publication number
- CN104980166A CN104980166A CN201510346184.1A CN201510346184A CN104980166A CN 104980166 A CN104980166 A CN 104980166A CN 201510346184 A CN201510346184 A CN 201510346184A CN 104980166 A CN104980166 A CN 104980166A
- Authority
- CN
- China
- Prior art keywords
- generator polynomial
- generator
- wpan
- matrix
- quasi
- 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
Links
Landscapes
- Complex Calculations (AREA)
Abstract
The invention provides a quasi cyclic LDPC (low-density parity-check) serial encoder, based on a shared storage mechanism, in a WPAN (wireless personal area network). The encoder includes one generator polynominal look-up table for storing in advance cyclic matrix generator polynominals in all code rate generation matrixes, one 16-bit delayer for sliding storage of information bits, sixteen 21-bit buffers for buffering generator polynominals, sixteen 21-bit binary system multipliers for scalar multiplication of the information bits by the generator polynominals, sixteen 21-bit binary system adders for modulo-2 adding of product and content of shift registers, and sixteen 21-bit shift registers for storing the sum of cycled left shift 1-bits. Finally, verification data is included in the sixteen shift registers. The serial encoder is compatible with quasi cyclic LDPC codes with all code rates in a WPAN system, and has the advantages of being low in power consumption and low in cost, having a simple structure, enabling less consumption of a memory, etc.
Description
Technical field
The present invention relates to field of channel coding, particularly the serial encoder of quasi-cyclic LDPC code in a kind of WPAN system.
Background technology
Code is one of efficient channel coding technology to low-density checksum (Low-Density Parity-Check, LDPC), 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 stages cycle, 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.
WPAN is the English abbreviation of Chinese Digital broadcast, and English full name is China Digital Radio.WPAN standard have employed the QC-LDPC code of system form, and the left-half of its generator matrix G is a unit matrix, and right half part is by a × c b × b rank circular matrix G
i,jthe array that (0≤i<a, a≤j<t, t=a+c) is formed, as follows:
Wherein, I is b × b rank unit matrixs, and 0 is the full null matrix in b × b rank.The continuous b of G capable and b row are called as the capable and block row of block respectively.From formula (1), G has a block capable and t block row.Make g
i,jcircular matrix G
i,jgenerator polynomial.WPAN standard have employed the QC-LDPC code of four kinds of different code checks.For these four kinds of QC-LDPC codes, all there is t=32 and b=21.Fig. 1 gives parameter a under different code check η and c.
For WPAN standard, the corresponding code word v=(s, p) of generator matrix G, that the front a block row of G are corresponding is information vector s=(e
0, e
1..., e
a × b-1), that rear c block row are corresponding is the vectorial p=(d of verification
0, d
1..., d
c × b-1).Be one section with b bit, information vector s is divided into a section, i.e. s=(s
0, s
1..., s
a-1); Verify vectorial p and be divided into c section, be i.e. p=(p
0, p
1..., p
c-1).From v=sG, jth-a section verification vector meets
P
j-a=s
0g
0, j+ s
1g
1, j+ ... + s
ig
i,j+ ... + s
a-1g
a-1, j(2) wherein, 0≤i<a, a≤j<t, t=a+c.Order
with
generator polynomial g respectively
i,jthe result of ring shift right n position and ring shift left n position, wherein, 0≤n≤b.So, i-th on the right of formula (2) equal sign deployable is
At present, what QC-LDPC serial code extensively adopted is the scheme adding accumulator (Type-IShift-Register-Adder-Accumulator, SRAA-I) circuit based on c I type shift register.Fig. 2 is the functional block diagram of single SRAA-I circuit, and information vector s by turn serial sends into this circuit.When with SRAA-I circuit to verification section p
j-awhen (a≤j<t) encodes, generator polynomial look-up table prestores all generator polynomials of the jth block row of generator matrix G, and accumulator is cleared initialization.When the 0th clock cycle arrives, shift register loads the 0th piece of row of G, the generator polynomial of jth block row from generator polynomial look-up table
information bit e
0move into circuit, and with the content of shift register
carry out scalar multiplication, product
add with content 0 mould 2 of accumulator, and
deposit back accumulator.When the 1st clock cycle arrives, shift register ring shift right 1, content becomes
information bit e
1move into circuit, and with the content of shift register
carry out scalar multiplication, product
with the content of accumulator
mould 2 adds, and
deposit back accumulator.Above-mentioned-the Jia that moves to right-take advantage of-storing process proceeds down.At the end of b-1 clock cycle, information bit e
b-1move into circuit, that now accumulator stores is part and s
0g
0, j, this is message segment s
0to p
j-acontribution.When b clock cycle arrives, shift register loads the 1st piece of row of G, the generator polynomial of jth block row from generator polynomial look-up table
repeat the above-mentioned-Jia that moves to right-take advantage of-storing process.As message segment s
1when moving into circuit completely, that accumulator stores is part and s
0g
0, j+ s
1g
1, j.Repeat said process, until the whole serial of whole information vector s moves into circuit.Now, that accumulator stores is verification section p
j-a.Use the serial encoder shown in c SRAA-I circuit energy pie graph 3, it obtains c verification section within a × b clock cycle simultaneously.The program needs 2 × c × b register, c × b two inputs to input XOR gate with door and c × b individual two, also needs c a × b bit ROM to store the generator polynomial of circular matrix.
For compatible four kinds of code checks, in WPAN standard, the existing solution of QC-LDPC serial code is based on 16 SRAA-I circuit, need 672 registers, 336 two inputs input XOR gate with door and 336 two, the ROM of 4 336 bits is also needed to store the circular matrix generator polynomial of 16th ~ 19 pieces of row of η=1/2 code check G respectively, the ROM of 4 756 bits stores the circular matrix generator polynomial of 20th ~ 23 pieces of row of η=1/2 and 5/8 two kinds of code check G respectively, the ROM of 4 1260 bits stores η=1/2 respectively, 5/8 and the circular matrix generator polynomials of 24th ~ 27 pieces of 3/4 3 kind of code check G row, the ROM of 4 1848 bits stores the circular matrix generator polynomial of 28th ~ 31 pieces of row of all code check generator matrix G respectively.The program has two shortcomings: one be shift register in each clock cycle or load new generator polynomial, or ring shift right 1, causes the storage content of single register constantly to change, and then causes the power consumption of circuit large; Two is that the generator polynomial of circular matrix is dispersed in multiple ROM, as everyone knows, when realizing ROM with the memory in FPGA sheet, inevitably cause the waste of memory, the more wastes of ROM number are more serious, certainly will cause that the memory of circuit is large, cost is high.
Summary of the invention
In WPAN system there is the shortcoming that power consumption is high, memory is large, cost is high in the existing implementation of multi code Rate of Chinese character QC-LDPC serial code, for these technical problems, the invention provides a kind of serial encoder based on shared memory mechanism.
As shown in Figure 5, in WPAN system, the serial encoder of multi code Rate of Chinese character QC-LDPC code forms primarily of 6 parts: generator polynomial look-up table, buffer, b position binary multiplier, b position binary adder, shift register and delayer.Cataloged procedure divides 5 steps to complete: the 1st step, resets delayer D and shift register R
0, R
1..., R
15, according to different code check η, buffer B
j-aload the generator polynomial g of generator matrix G i-th piece of row, jth block row from generator polynomial look-up table when i-th × b+j-a clock cycle arrives
i,j, and remain unchanged in other moment; 2nd step, when a kth clock cycle arrives, delayer D input information bits e
k(0≤k<a × b), buffer B
0, B
1..., B
15in generator polynomial respectively by b position binary multiplier M
0, M
1..., M
15with the data bit D in delayer D
0, D
1..., D
15carry out scalar multiplication, b position binary multiplier M
0, M
1..., M
15product respectively by b position binary adder A
0, A
1..., A
15with shift register R
0, R
1..., R
15content be added, b position binary adder A
0, A
1..., A
15and be recycled the result after 1 that moves to left respectively stored in shift register R
0, R
1..., R
15; 3rd step, with 1 for step-length increases progressively the value changing k, repetition the 2nd step a × b time, until whole information vector s inputs complete; 4th step, when the clock cycle arrives, delayer D inputs filling bit 0, buffer B
0, B
1..., B
15in generator polynomial respectively by b position binary multiplier M
0, M
1..., M
15with the data bit D in delayer D
0, D
1..., D
15carry out scalar multiplication, b position binary multiplier M
0, M
1..., M
15product respectively by b position binary adder A
0, A
1..., A
15with shift register R
0, R
1..., R
15content be added, b position binary adder A
0, A
1..., A
15and be recycled the result after 1 that moves to left respectively stored in shift register R
0, R
1..., R
15; 5th step, repeats the 4th step 16 times, until 16 filling bits 0 input complete, now, and shift register R
0, R
1..., R
15that store is verification section p respectively
0, p
1..., p
15, they constitute the vectorial p=(p of verification
0, p
1..., p
15).
Serial encoder structure provided by the invention is simple, the QC-LDPC code of all code checks in compatible WPAN system, under substantially keeping coding rate and logical resource to expend constant condition, can reduce power consumption, reduce storage requirement, cost-saving.
Be further understood by detailed description and accompanying drawings below about advantage of the present invention and method.
Accompanying drawing explanation
Fig. 1 summarizes parameter a and the c of four kinds of code check QC-LDPC code generator matrixes in WPAN system;
Fig. 2 is the functional block diagram that I type shift register adds accumulator SRAA-I circuit;
Fig. 3 is the QC-LDPC serial encoder be made up of c SRAA-I circuit;
Fig. 4 is the functional block diagram that buffer adds shift register BASR circuit;
Fig. 5 is a kind of QC-LDPC serial encoder based on shared memory mechanism be made up of 16 BASR circuit.
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.
Since by the generator polynomial g of circular matrix
i,jring shift right n position is equivalent to its ring shift left b-n position, namely
so formula (3) can be rewritten as
Formula (4) is a process taking advantage of-Jia-move to left-store, and its realization buffer adds shift register (Buffer-Adder-Shift-Register, BASR) circuit.Fig. 4 is the functional block diagram of BASR circuit, and information vector s is sent into this circuit by serial by turn.When with BASR circuit to verification section p
j-awhen (0≤j<c) encodes, generator polynomial look-up table prestores all generator polynomials of the jth block row of generator matrix G, and shift register is cleared initialization.When the 0th clock cycle arrives, buffer loads the 0th piece of row of G, the generator polynomial g of jth block row from generator polynomial look-up table
0, j, information bit e
0move into circuit, and with the content g of buffer
0, jcarry out scalar multiplication, product e
0g
0, jadd with content 0 mould 2 of shift register, and e
0g
0, jresult (the 0+e of ring shift left 1
0g
0, j)
l (1)deposit travelling backwards bit register.When the 1st clock cycle arrives, the content of buffer remains unchanged, information bit e
1move into circuit, and with the content g of buffer
0, jcarry out scalar multiplication, product e
1g
0, jwith the content (0+e of shift register
0g
0, j)
l (1)mould 2 adds, and (0+e
0g
0, j)
l (1)+ e
1g
0, jthe result ((0+e of ring shift left 1
0g
0, j)
l (1)+ e
1g
0, j)
l (1)deposit travelling backwards bit register.Above-mentioned-the Jia of taking advantage of-move to left-storing process proceeds down.At the end of b-1 clock cycle, information bit e
b-1move into circuit, that now shift register stores is part and s
0g
0, j, this is message segment s
0to p
j-acontribution.When b clock cycle arrives, buffer loads the 1st piece of row of G, the generator polynomial g of jth block row from generator polynomial look-up table
1, j, repeat that the above-mentioned-Jia of taking advantage of-move to left-storing process.As message segment s
1when moving into circuit completely, that shift register stores is part and s
0g
0, j+ s
1g
1, j.Repeat said process, until the whole serial of whole information vector s moves into circuit.Now, that shift register stores is verification section p
j-a.
Fig. 5 gives a kind of QC-LDPC serial encoder based on shared memory mechanism be made up of 16 BASR circuit, is made up of generator polynomial look-up table, buffer, b position binary multiplier, b position binary adder, shift register and delayer six kinds of functional modules.Generator polynomial look-up table is for storing the generator polynomial of all circular matrixes, and 16 BASR circuit share this look-up table, and timesharing therefrom reads generator polynomial.Buffer B
0, B
1..., B
15buffer memory a, a+1 respectively ..., the generator polynomial of circular matrix in t-1 block row.Buffer B
0, B
1..., B
15in generator polynomial respectively with the data bit D in delayer D
0, D
1..., D
15carry out scalar multiplication, these 16 scalar multiplications are respectively by b position binary multiplier M
0, M
1..., M
15complete.B position binary multiplier M
0, M
1..., M
15product respectively with shift register R
0, R
1..., R
15content be added, these 16 nodulo-2 additions are respectively by b position binary adder A
0, A
1..., A
15complete.B position binary adder A
0, A
1..., A
15and be recycled the result after 1 that moves to left respectively stored in shift register R
0, R
1..., R
15.Data bit D in delayer D
0~ D
15slip storage 16 bit information.
Generator polynomial look-up table stores the circular matrix generator polynomial in all code check QC-LDPC code generator matrixes, for arbitrary code check, first stores a in the 0th piece of row successively, a+1 ..., the generator polynomial that t-1 block row are corresponding, store a, a+1 in the 1st piece of row successively again ... the generator polynomial that t-1 block row are corresponding, the rest may be inferred, finally store successively a-1 block capable in a, a+1,, the generator polynomial that t-1 block row are corresponding.
The invention provides a kind of QC-LDPC serial encoding method based on shared memory mechanism, four kinds of code check QC-LDPC codes in its compatible WPAN standard, its coding step is described below:
1st step, resets delayer D and shift register R
0, R
1..., R
15, according to different code check η, buffer B
j-aload the generator polynomial g of generator matrix G i-th piece of row, jth block row from generator polynomial look-up table when i-th × b+j-a clock cycle arrives
i,j, and remain unchanged in other moment;
2nd step, when a kth clock cycle arrives, delayer D input information bits e
k(0≤k<a × b), buffer B
0, B
1..., B
15in generator polynomial respectively by b position binary multiplier M
0, M
1..., M
15with the data bit D in delayer D
0, D
1..., D
15carry out scalar multiplication, b position binary multiplier M
0, M
1..., M
15product respectively by b position binary adder A
0, A
1..., A
15with shift register R
0, R
1..., R
15content be added, b position binary adder A
0, A
1..., A
15and be recycled the result after 1 that moves to left respectively stored in shift register R
0, R
1..., R
15;
3rd step, with 1 for step-length increases progressively the value changing k, repetition the 2nd step a × b time, until whole information vector s inputs complete;
4th step, when the clock cycle arrives, delayer D inputs filling bit 0, buffer B
0, B
1..., B
15in generator polynomial respectively by b position binary multiplier M
0, M
1..., M
15with the data bit D in delayer D
0, D
1..., D
15carry out scalar multiplication, b position binary multiplier M
0, M
1..., M
15product respectively by b position binary adder A
0, A
1..., A
15with shift register R
0, R
1..., R
15content be added, b position binary adder A
0, A
1..., A
15and be recycled the result after 1 that moves to left respectively stored in shift register R
0, R
1..., R
15;
5th step, repeats the 4th step 16 times, until 16 filling bits 0 input complete, now, and shift register R
0, R
1..., R
15that store is verification section p respectively
0, p
1..., p
15, they constitute the vectorial p=(p of verification
0, p
1..., p
15).
Be not difficult to find out from above step, whole cataloged procedure needs a × b+16 clock cycle altogether, more than the existing serial encoding method based on 16 SRAA-I circuit 16 clock cycle.For four kinds of QC-LDPC codes that WPAN standard adopts, a × b has 336,420,504,588 4 kind may.16 1 ~ 2 magnitudes less of a × b, can ignore.Visible, the speed of two kinds of coding methods is substantially identical.
In WPAN standard, the existing solution of QC-LDPC serial code needs 672 registers, 336 two inputs inputs XOR gate with door and 336 two, and the present invention needs 336 registers, 336 two inputs and door and 336 two to input XOR gate.Two kinds of coding methods expend equal number with door and XOR gate, the present invention is multiplex 16 registers.16 much smaller than 672, can ignore.Visible, the register that two kinds of coding methods expend is also substantially identical.
To sum up, two kinds of coding methods have almost identical coding rate and logical resource to expend.But the present invention has two clear superiorities, overcome the shortcoming of the existing solution of QC-LDPC serial code in WPAN standard.In existing solution, shift register is in each clock cycle or load new generator polynomial, ring shift right 1, the storage content of single register constantly changes and causes the power consumption of circuit large, and the present invention uses the generator polynomial of buffer load circular matrix, without the need to loopy moving, the every b of its content clock cycle change once, significantly reduces power consumption.This is first advantage of the present invention.Second advantage adopts to share memory mechanism, single ROM and same data/address bus is used to realize generator polynomial look-up table, overcome that the waste that in existing solution, multiple ROM brings is many, memory is large, cost high shortcoming, enormously simplify the project organization of generator polynomial look-up table, farthest save memory space, reduce cost.
In brief, for the serial code of four kinds of QC-LDPC codes in WPAN standard, compared with existing solution, the present invention maintains identical coding rate substantially and logical resource expends, and has that power consumption is little, structure is simple, memory consumption is few, low cost and other advantages.
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 (4)
1. quasi-cyclic LDPC serial encoder in the WPAN of a shared memory mechanism, WPAN is the English abbreviation of wireless personal-area network, English full name is Wireless Personal Area Network, the generator matrix G of quasi-cyclic LDPC code is divided into the capable and t block row of a block, and the part generator matrix that rear c block row are corresponding is by a × c b × b rank circular matrix G
i,jthe array formed, g
i,jcircular matrix G
i,jgenerator polynomial, wherein, t=a+c, a, b, c, i, j and t is nonnegative integer, 0≤i<a, a≤j<t, WPAN standard have employed the quasi-cyclic LDPC code of four kinds of different code check η, η is 1/2 respectively, 5/8, 3/4, 7/8, for these four kinds different code check quasi-cyclic LDPC codes, all there is t=32 and b=21, the parameter a that four kinds of different code checks are corresponding is 16 respectively, 20, 24, 28, the parameter c that four kinds of different code checks are corresponding is 16 respectively, 12, 8, 4, the corresponding code word v=(s of generator matrix G, p), that the front a block row of G are corresponding is information vector s=(e
0, e
1..., e
a × b-1), that rear c block row are corresponding is the vectorial p of verification, is one section, verifies vectorial p and be divided into c section, be i.e. p=(p with b bit
0, p
1..., p
15), it is characterized in that, described encoder comprises following parts:
Generator polynomial look-up table, for storing the generator polynomial of circular matrix in all generator matrix G;
Delayer D, its data bit D
0, D
1..., D
15slip storage 16 bit information;
Buffer B
0, B
1..., B
15, buffer memory generator matrix G a, a+1 respectively ..., the generator polynomial of circular matrix in t-1 block row;
B position binary multiplier M
0, M
1..., M
15, respectively to data bit D
0, D
1..., D
15with buffer B
0, B
1..., B
15in generator polynomial carry out scalar multiplication;
B position binary adder A
0, A
1..., A
15, respectively to b position binary multiplier M
0, M
1..., M
15sum of products shift register R
0, R
1..., R
15content carry out mould 2 and add;
Shift register R
0, R
1..., R
15, store b position binary adder A respectively
0, A
1..., A
15and be recycled the move to left result after 1 and final verification section p
0, p
1..., p
15.
2. quasi-cyclic LDPC serial encoder in the WPAN of a kind of shared memory mechanism according to claim 1, it is characterized in that, described generator polynomial look-up table stores the circular matrix generator polynomial in all code check quasi-cyclic LDPC code generator matrixes, for arbitrary code check, first store a, a+1 in the 0th piece of row successively ... the generator polynomial that t-1 block row are corresponding, store a, a+1 in the 1st piece of row successively again ... the generator polynomial that t-1 block row are corresponding, the rest may be inferred, finally store successively a-1 block capable in a, a+1,, the generator polynomial that t-1 block row are corresponding.
3. quasi-cyclic LDPC serial encoder in the WPAN of a kind of shared memory mechanism according to claim 1, is characterized in that, described buffer B
0, B
1..., B
15share generator polynomial look-up table, timesharing therefrom reads generator polynomial, buffer B
j-aaccording to different code check η, load the generator polynomial g of generator matrix G i-th piece of row, jth block row from generator polynomial look-up table when i-th × b+j-a clock cycle arrives
i,j, and remain unchanged in other moment.
4. quasi-cyclic LDPC serial encoding method in the WPAN of a shared memory mechanism, WPAN is the English abbreviation of wireless personal-area network, English full name is Wireless Personal Area Network, the generator matrix G of quasi-cyclic LDPC code is divided into the capable and t block row of a block, and the part generator matrix that rear c block row are corresponding is by a × c b × b rank circular matrix G
i,jthe array formed, g
i,jcircular matrix G
i,jgenerator polynomial, wherein, t=a+c, a, b, c, i, j and t is nonnegative integer, 0≤i<a, a≤j<t, WPAN standard have employed the quasi-cyclic LDPC code of four kinds of different code check η, η is 1/2 respectively, 5/8, 3/4, 7/8, for these four kinds different code check quasi-cyclic LDPC codes, all there is t=32 and b=21, the parameter a that four kinds of different code checks are corresponding is 16 respectively, 20, 24, 28, the parameter c that four kinds of different code checks are corresponding is 16 respectively, 12, 8, 4, the corresponding code word v=(s of generator matrix G, p), that the front a block row of G are corresponding is information vector s=(e
0, e
1..., e
a × b-1), that rear c block row are corresponding is the vectorial p of verification, is one section, verifies vectorial p and be divided into c section, be i.e. p=(p with b bit
0, p
1..., p
15), it is characterized in that, described coding method comprises the following steps:
1st step, resets delayer D and shift register R
0, R
1..., R
15, according to different code check η, buffer B
j-aload the generator polynomial g of generator matrix G i-th piece of row, jth block row from generator polynomial look-up table when i-th × b+j-a clock cycle arrives
i,j, and remain unchanged in other moment;
2nd step, when a kth clock cycle arrives, delayer D input information bits e
k, buffer B
0, B
1..., B
15in generator polynomial respectively by b position binary multiplier M
0, M
1..., M
15with the data bit D in delayer D
0, D
1..., D
15carry out scalar multiplication, b position binary multiplier M
0, M
1..., M
15product respectively by b position binary adder A
0, A
1..., A
15with shift register R
0, R
1..., R
15content be added, b position binary adder A
0, A
1..., A
15and be recycled the result after 1 that moves to left respectively stored in shift register R
0, R
1..., R
15, wherein, 0≤k<a × b;
3rd step, with 1 for step-length increases progressively the value changing k, repetition the 2nd step a × b time, until whole information vector s inputs complete;
4th step, when the clock cycle arrives, delayer D inputs filling bit 0, buffer B
0, B
1..., B
15in generator polynomial respectively by b position binary multiplier M
0, M
1..., M
15with the data bit D in delayer D
0, D
1..., D
15carry out scalar multiplication, b position binary multiplier M
0, M
1..., M
15product respectively by b position binary adder A
0, A
1..., A
15with shift register R
0, R
1..., R
15content be added, b position binary adder A
0, A
1..., A
15and be recycled the result after 1 that moves to left respectively stored in shift register R
0, R
1..., R
15;
5th step, repeats the 4th step 16 times, until 16 filling bits 0 input complete, now, and shift register R
0, R
1..., R
15that store is verification section p respectively
0, p
1..., p
15, they constitute the vectorial p=(p of verification
0, p
1..., p
15).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510346184.1A CN104980166A (en) | 2015-06-20 | 2015-06-20 | Quasi cyclic LDPC serial encoder, sharing storage mechanism, in WPAN |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510346184.1A CN104980166A (en) | 2015-06-20 | 2015-06-20 | Quasi cyclic LDPC serial encoder, sharing storage mechanism, in WPAN |
Publications (1)
Publication Number | Publication Date |
---|---|
CN104980166A true CN104980166A (en) | 2015-10-14 |
Family
ID=54276322
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510346184.1A Pending CN104980166A (en) | 2015-06-20 | 2015-06-20 | Quasi cyclic LDPC serial encoder, sharing storage mechanism, in WPAN |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104980166A (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5116735B2 (en) * | 2008-08-27 | 2013-01-09 | ミツビシ・エレクトリック・リサーチ・ラボラトリーズ・インコーポレイテッド | How to construct a code |
CN103236859A (en) * | 2013-04-19 | 2013-08-07 | 荣成市鼎通电子信息科技有限公司 | Quasi-cyclic LDPC (low-density parity-check) serial encoder based on shared storage mechanism |
CN103259544A (en) * | 2013-04-19 | 2013-08-21 | 荣成市鼎通电子信息科技有限公司 | Quasi-cyclic LDPC serial encoder in DTMB of shared storage mechanism |
CN103269228A (en) * | 2013-04-19 | 2013-08-28 | 荣成市鼎通电子信息科技有限公司 | Quasic-LDPC serial encoder of CMMB with shared storage mechanism |
US8812930B1 (en) * | 2010-04-27 | 2014-08-19 | Marvell International Ltd. | Parallel encoder for low-density parity-check (LDPC) codes |
-
2015
- 2015-06-20 CN CN201510346184.1A patent/CN104980166A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5116735B2 (en) * | 2008-08-27 | 2013-01-09 | ミツビシ・エレクトリック・リサーチ・ラボラトリーズ・インコーポレイテッド | How to construct a code |
US8812930B1 (en) * | 2010-04-27 | 2014-08-19 | Marvell International Ltd. | Parallel encoder for low-density parity-check (LDPC) codes |
CN103236859A (en) * | 2013-04-19 | 2013-08-07 | 荣成市鼎通电子信息科技有限公司 | Quasi-cyclic LDPC (low-density parity-check) serial encoder based on shared storage mechanism |
CN103259544A (en) * | 2013-04-19 | 2013-08-21 | 荣成市鼎通电子信息科技有限公司 | Quasi-cyclic LDPC serial encoder in DTMB of shared storage mechanism |
CN103269228A (en) * | 2013-04-19 | 2013-08-28 | 荣成市鼎通电子信息科技有限公司 | Quasic-LDPC serial encoder of CMMB with shared storage mechanism |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103248372A (en) | Quasi-cyclic LDPC serial encoder based on ring shift left | |
CN103259544A (en) | Quasi-cyclic LDPC serial encoder in DTMB of shared storage mechanism | |
CN103269228B (en) | Share quasi-cyclic LDPC serial encoder in the CMMB of memory mechanism | |
CN103236859B (en) | Share the quasi-cyclic LDPC serial encoder of memory mechanism | |
CN103236855A (en) | Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in near field communication | |
CN103236858A (en) | Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in China mobile multimedia broadcasting (CMMB) | |
CN103269226B (en) | Share quasi-cyclic LDPC serial encoder in the near-earth communication of memory mechanism | |
CN103236856A (en) | Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in digital television terrestrial multimedia broadcasting (DTMB) | |
CN103236849B (en) | Based on quasi cyclic matrix serial multiplier in the DTMB of shared memory mechanism | |
CN104980166A (en) | Quasi cyclic LDPC serial encoder, sharing storage mechanism, in WPAN | |
CN104980163A (en) | Quasi-LDPC serial encoder, sharing storage mechanism, in CDR | |
CN103269225B (en) | Share quasi-cyclic LDPC serial encoder in the deep space communication of memory mechanism | |
CN103236852B (en) | Without quasi cyclic matrix serial multiplier in the DTMB of multiplying | |
CN103905059A (en) | Right shift accumulation QC-LDPC encoder for partially-parallel input in CDR | |
CN103929200A (en) | Full parallel input QC-LDPC encoder based on ring shift left in CDR | |
CN103929189A (en) | Partial parallel input left shift accumulation QC-LDPC encoder in near-earth communications | |
CN103905055A (en) | Partial parallel input QC-LDPC encoder for right shift accumulation | |
CN103929196A (en) | Full parallel input QC-LDPC encoder based on ring shift left in WPAN | |
CN104980164A (en) | Quasic-LDPC serial encoder, based on ring shift left, in WPAN | |
CN103929194A (en) | Partially parallel input QC-LDPC encoder based on right-shift accumulation in WPAN | |
CN103929207A (en) | Partially parallel input QC-LDPC encoder based on right-shift accumulation in CMMB | |
CN103929193A (en) | Partial parallel input accumulation left shift QC-LDPC coder | |
CN103916135A (en) | Ring shift left QC-LDPC coder with fully parallel input in ground proximity communication | |
CN103268211A (en) | Shared storage mechanism-based quasi-cyclic matrix serial multiplier for China mobile multimedia broadcasting (CMMB) | |
CN105049058A (en) | QC-LDPC serial encoder in CDR based on cyclic left shift |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151014 |