CN102970046A - Highly parallel QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) encoder and encoding method in ground proximity communication system - Google Patents
Highly parallel QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) encoder and encoding method in ground proximity communication system Download PDFInfo
- Publication number
- CN102970046A CN102970046A CN2012104743305A CN201210474330A CN102970046A CN 102970046 A CN102970046 A CN 102970046A CN 2012104743305 A CN2012104743305 A CN 2012104743305A CN 201210474330 A CN201210474330 A CN 201210474330A CN 102970046 A CN102970046 A CN 102970046A
- Authority
- CN
- China
- Prior art keywords
- vector
- register
- matrix
- section
- input
- 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.)
- Granted
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention relates to a method for solving highly parallel encoding a QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) code in a CCSDS ground proximity communication system. A highly parallel encoder for the QC-LDPC code of the system mainly comprises a register, a lookup table, a 2b-bit binary input exclusive-OR gate and b-bit binary input exclusive-OR gate. The highly parallel QC-LDPC encoder provided by the invention is compatible with multiple code rates, fully utilizes the function of the lookup table in an FPGA (Field Programmable Gate Array) logic resource, effectively lowers resource requirements under the condition of keeping invariable encoding speed, and has the advantages of simple control, small resource consumption and power consumption, low cost and the like.
Description
Technical field
The present invention relates to near-earth space data communication field, particularly the highly-parallel implementation method of QC-LDPC code coder in a kind of CCSDS near-earth communication system.
Background technology
Because the various distortions that exist in transmission channel and noise can produce transmitted signal and disturb, the situation that digital signal produces error code can appear in receiving terminal inevitably.In order to reduce the error rate, need to adopt channel coding technology.
Low-density checksum (Low-Density Parity-Check, LDPC) code becomes the study hotspot of field of channel coding with its excellent properties that approaches the Shannon limit.Quasi-cyclic LDPC code (Quasic-LDPC, QC-LDPC) code is a kind of special LDPC code, and its coding can adopt shift register to add accumulator (Shift-Register-Adder-Accumulator, SRAA) and be realized.
The SRAA method is to utilize generator matrix G to encode.The generator matrix G of QC-LDPC code is by a * t b * b rank circular matrix G
I, j(1≤i≤a, the array that 1≤j≤t) consists of, t=a+c.The a part of generator matrix corresponding with information vector is unit matrix, and the remainder generator matrix corresponding with the verification vector is high-density matrix.Suppose that b is not prime number, can be broken down into b=ux.Au road highly-parallel SRAA method is finished first encoding needs x+t clock cycle, needs (auc+t) b register, aucb two input and door and aucb two input XOR gate.
CCSDS near-earth communication system has been recommended a kind of QC-LDPC code, wherein, and a=14, c=2, t=16, b=511.A kind of decomposition method of b=ux is u=7, x=73.
The existing solution of QC-LDPC ultrahigh speed coding is to adopt au road highly-parallel SRAA method in the CCSDS near-earth communication system, take u=7 as example, the highly-parallel encoder of realizing the QC-LDPC code needs 108332 registers, 100156 two inputs and door and 100156 two input XOR gate.When adopting FPGA to realize, need more logical resource, will certainly cause equipment cost high, power consumption is large.
Summary of the invention
The large shortcoming of resources requirement that exists in the existing implementation for CCSDS near-earth communication system QC-LDPC code ultrahigh speed coding, the invention provides a kind of highly-parallel coding method based on look-up table, take full advantage of the look-up table function in the fpga logic resource, can keep effectively reducing resource requirement under the constant prerequisite of coding rate.
As shown in Figure 1, the highly-parallel encoder of QC-LDPC code mainly is comprised of 4 parts in the CCSDS near-earth communication system: register, look-up table, 2b position two input XOR gate and b position two input XOR gate.Whole cataloged procedure divided for 4 steps finished: in the 1st step, input message vector s is saved to register R
1～R
14, zero clearing register R
15And R
16The 2nd step, register R
1～R
aThe serial u=7 position that moves to left, look-up table L
1～L
aDifference input vector h
1~ h
aWith output vector v
1~ v
a, 2b position two input XOR gate B
1～B
A-1To vector v
1~ v
aSummation obtains vector v
A+1, b position two input XOR gate A
l(1≤l≤c) with vector v
A+1L section b bit and register R
A+lThe results added of serial ring shift left u=7 position, and deposit back register R
A+lIn the 3rd step, repeat the 2nd and go on foot x time; The 4th step, parallel output code word (s, p).
The compatible multi code Rate of Chinese character of QC-LDPC highly-parallel encoder provided by the invention can keep effectively reducing resource requirement under the constant prerequisite of coding rate, thereby reach the purpose that reduces hardware cost and power consumption.
Can be further understood by ensuing detailed description and accompanying drawings about the advantages and spirit of the present invention.
Description of drawings
Fig. 1 is the highly-parallel encoder overall structure of QC-LDPC code in the CCSDS near-earth communication system;
Fig. 2 has compared traditional au road highly-parallel SRAA method and resource consumption of the present invention.
Embodiment
The invention will be further described below in conjunction with the drawings and specific embodiments, but not as a limitation of the invention.
The QC-LDPC code is the special LDPC code of a class, and its generator matrix G and check matrix H all are the arrays that is made of circular matrix, has segmentation circulation characteristics, so be called as quasi-cyclic LDPC code.From the angle of row, each provisional capital of circular matrix is the result of one of lastrow (first trip is footline) ring shift right; From the angle of row, each row of circular matrix all are that previous column (first is terminal column) circulation moves down one result.The set that the row vector of circular matrix consists of is identical with the set of column vector formation, therefore, circular matrix fully can by it first trip or first characterize.The generator matrix G of QC-LDPC code is by a * t b * b rank circular matrix G
I, j(1≤i≤a, the array that 1≤j≤t) consists of:
G(or H) the capable and b of continuous b row be called as respectively the capable and piece row of piece.The exponent number b that supposes circular matrix is not prime number, can be broken down into b=ux, and wherein, u and x are all non-1 positive integer.So, the front u of all circular matrixes is capable in capable, the rear c piece row of the piece of generator matrix G the m(1≤m≤a) has consisted of a u * bc rank matrix, is referred to as the sub-block row matrix, is denoted as U
mU
mCan be considered by bc u dimensional vector and consist of all U
mConsisted of an au * bc rank sub-block matrix U.
For CCSDS near-earth communication system, the corresponding code word (s, p) of generator matrix G, that the front a piece row of G are corresponding is information vector s, that rear c piece row are corresponding is verification vector p.Take the b bit as one section, information vector s is divided into a section, i.e. s=(s
1, s
2..., s
a); Verification vector p is divided into the c section, i.e. p=(p
1, p
2..., p
c).For the segment information of the i(1≤i≤a) vector s
i, s is arranged
i=(s
I, 1, s
I, 2..., s
I, b).CCSDS near-earth communication system has been recommended a kind of QC-LDPC code, wherein, a=14, c=2, t=16, b=511, a kind of decomposition method of b is u=7, x=73.
Characteristics by formula (1), (2) and circular matrix, Fig. 1 has provided the highly-parallel encoder that is applicable to QC-LDPC code in the CCSDS near-earth communication system, and it mainly is comprised of register, look-up table, 2b position two input XOR gate and b position four kinds of functional modules of two input XOR gate.
Register R
1～R
14Be used for cache information vector s=(s
1, s
2..., s
14), register R
15And R
16Be used for calculating and storage verification vector p=(p
1, p
2).
Look-up table L
1～L
aThe input of u position and the output of 2b position are all arranged, finish respectively different u position information bits and sub-block row matrix U
1~ U
aProduct.The u position information bit s of parallel input
M, un+1, s
M, un+2..., s
M, un+u(1≤m≤a, 0≤n＜x) consist of vectorial h
m={ s
M, un+1, s
M, un+2..., s
M, un+u.Look-up table L
mInput be h
m, each road output is h
mWith sub-block row matrix U
mThe product of respective column, total output has consisted of vector v
mIf the unit of substantially searching of look-up table is considered as one two input and door, need so altogether acb two inputs and door.
2b position two input XOR gate B
1～B
A-1With vector v
1~ v
aBe added together, obtain vector v
A+1In fact, v
A+1In each element be the vector { h
1, h
2..., h
aWith the product of sub-block matrix U respective column, v
A+1Vector { h
1, h
2..., h
aWith the product of sub-block matrix U.
B position two input XOR gate A
l(1≤l≤c) with vector v
A+1Continuous b bit be added to register R
A+lIn.
Two input XOR gate sums of all 2b position two input XOR gate and b position two input XOR gate are acb.
The invention provides a kind of QC-LDPC highly-parallel coding method based on look-up table, in conjunction with the highly-parallel encoder (as shown in Figure 1) of QC-LDPC code in the CCSDS near-earth communication system, its coding step is described below:
In the 1st step, input message vector s is saved to register R
1～R
a, zero clearing register R
A+1～R
t
The 2nd step, register R
1～R
14The serial u=7 position that moves to left, look-up table L
1～L
aDifference input vector h
1~ h
aWith output vector v
1~ v
a, 2b position two input XOR gate B
1～B
A-1To vector v
1~ v
aSummation obtains vector v
A+1, b position two input XOR gate A
l(1≤l≤c) with vector v
A+1L section b bit and register R
A+lThe results added of serial ring shift left u=7 position, and deposit back register R
A+l
The 3rd step repeated the 2nd and goes on foot x time, after finishing, and register R
1～R
14That store is information vector s=(s
1, s
2..., s
14), register R
15And R
16That store is verification vector p=(p
1, p
2);
The 4th step, parallel output code word (s, p).
Be not difficult to find out that from above step whole cataloged procedure needs x+t clock cycle altogether, this and traditional au road highly-parallel SRAA method are identical.
Fig. 2 has compared traditional au road highly-parallel SRAA method and resource consumption of the present invention.Notice that the unit of substantially searching with look-up table is considered as one two input and door here.Can know from Fig. 2 and to see, compare with au road highly-parallel SRAA method, the present invention used less register, XOR gate and with door, the amount of expending is respectively 8%, 14% and 14% of au road highly-parallel SRAA method.
As fully visible, compare with traditional au road highly-parallel SRAA method, the present invention has kept coding rate, can take full advantage of the look-up table function in the fpga logic resource, has that control is simple, resource consumption is few, power consumption is little, low cost and other advantages.
Above-described embodiment is more preferably embodiment of the present invention, and the common variation that those skilled in the art carries out in the technical solution of the present invention scope and replacement all should be included in protection scope of the present invention.
Claims (4)
1. highly-parallel encoder that is suitable for the QC-LDPC code that CCSDS near-earth communication system adopts, the generator matrix G of QC-LDPC code is by a * t b * b rank circular matrix G
I, jThe array that consists of, wherein, a=14, t=16, b=511, c=t-a=2,1≤i≤a, 1≤j≤t, a kind of decomposition method of b=ux is u=7, x=73, the corresponding code word (s, p) of generator matrix G, that the front a piece row of G are corresponding is information vector s, and that rear c piece row are corresponding is verification vector p, take the b bit as one section, information vector s is divided into a section, i.e. s=(s
1, s
2..., s
14), i segment information vector s
i=(s
I, 1, s
I, 2 ...,s
I, b), verification vector p is divided into the c section, i.e. p=(p
1, p
2), it is characterized in that described encoder comprises following parts:
Register R
1～R
16, register R
1～R
14Be used for cache information vector s=(s
1, s
2..., s
14), register R
15And R
16Be used for calculating and storage verification vector p=(p
1, p
2);
Look-up table L
1～L
a, the vectorial h that the input u position information bit that walks abreast respectively consists of
m={ s
M, un+1,s
M, un+2 ...,s
M, un+u, parallel output 2b bit vector v
m, wherein, 1≤m≤a, 0≤n＜x;
2b position two input XOR gate B
1～B
A-1, with vector v
1~ v
aBe added together, obtain vector v
A+1
B position two input XOR gate A
1And A
2, A
lWith vector v
A+1The continuous b bit of l section be added to register R
A+lIn, wherein, 1≤l≤c.
2. highly-parallel encoder as claimed in claim 1 is characterized in that, described look-up table L
1～L
aFinish respectively different u position information bits and sub-block row matrix U
1~ U
aProduct, look-up table L
mInput be h
m, each road output is h
mWith sub-block row matrix U
mThe product of respective column, total output has consisted of vector v
m
3. highly-parallel encoder as claimed in claim 1 is characterized in that, described vector v
A+1In each element be the vector { h
1, h
2..., h
aWith the product of sub-block matrix U respective column, v
A+1Vector { h
1, h
2..., h
aWith the product of sub-block matrix U.
4. highly-parallel coding method that is suitable for the QC-LDPC code of CCSDS near-earth communication system employing, the generator matrix G of QC-LDPC code is by a * t b * b rank circular matrix G
I, jThe array that consists of, wherein, a=14, t=16, b=511, c=t-a=2,1≤i≤a, 1≤j≤t, a kind of decomposition method of b=ux is u=7, x=73, the corresponding code word (s, p) of generator matrix G, that the front a piece row of G are corresponding is information vector s, and that rear c piece row are corresponding is verification vector p, take the b bit as one section, information vector s is divided into a section, i.e. s=(s
1, s
2..., s
14), i segment information vector s
i=(s
I, 1,s
I, 2 ...,s
I, b), verification vector p is divided into the c section, i.e. p=(p
1, p
2), it is characterized in that described encoder comprises following parts:
In the 1st step, input message vector s is saved to register R
1～R
14, zero clearing register R
15And R
16
The 2nd step, register R
1～R
14The serial u=7 position that moves to left, look-up table L
1～L
aDifference input vector h
1~ h
aWith output vector v
1~ v
a, 2b position two input XOR gate B
1～B
A-1To vector v
1~ v
aSummation obtains vector v
A+1, b position two input XOR gate A
lWith vector v
A+1L section b bit and register R
A+lThe results added of serial ring shift left u=7 position, and deposit back register R
A+l, wherein, 1≤l≤c;
The 3rd step repeated the 2nd and goes on foot x time, after finishing, and register R
1～R
14That store is information vector s=(s
1, s
2..., s
14), register R
15And R
16That store is verification vector p=(p
1, p
2);
The 4th step, parallel output code word (s, p).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210474330.5A CN102970046B (en) | 2012-11-21 | 2012-11-21 | QC-LDPC encoder and coding method in the near-earth communication of highly-parallel |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210474330.5A CN102970046B (en) | 2012-11-21 | 2012-11-21 | QC-LDPC encoder and coding method in the near-earth communication of highly-parallel |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102970046A true CN102970046A (en) | 2013-03-13 |
| CN102970046B CN102970046B (en) | 2015-10-28 |
Family
ID=47799951
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210474330.5A Expired - Fee Related CN102970046B (en) | 2012-11-21 | 2012-11-21 | QC-LDPC encoder and coding method in the near-earth communication of highly-parallel |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102970046B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103236855A (en) * | 2013-04-19 | 2013-08-07 | 荣成市鼎通电子信息科技有限公司 | Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in near field communication |
| CN103268212A (en) * | 2013-04-19 | 2013-08-28 | 荣成市鼎通电子信息科技有限公司 | Quasi-cyclic matrix high speed multiplier in deep space communication without memory |
| CN103873070B (en) * | 2014-03-20 | 2016-09-21 | 航天恒星科技有限公司 | A kind of high spped coding device for CCSDS specification 7/8 code check LDPC and coded method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002091593A1 (en) * | 2001-05-08 | 2002-11-14 | Ubinetics Limited | Configurable crc-encoder |
| CN101192833A (en) * | 2006-11-28 | 2008-06-04 | 华为技术有限公司 | A device and method for low-density checksum LDPC parallel coding |
-
2012
- 2012-11-21 CN CN201210474330.5A patent/CN102970046B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002091593A1 (en) * | 2001-05-08 | 2002-11-14 | Ubinetics Limited | Configurable crc-encoder |
| CN101192833A (en) * | 2006-11-28 | 2008-06-04 | 华为技术有限公司 | A device and method for low-density checksum LDPC parallel coding |
Non-Patent Citations (1)
| Title |
|---|
| ZONGWANG LI等: "Efficient encoding of Quasi-Cyclic Low-Density Parity-Check Codes", 《IEEE TRANSCATIONS ON COMMUNICATIONS》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103236855A (en) * | 2013-04-19 | 2013-08-07 | 荣成市鼎通电子信息科技有限公司 | Rotate left-based quasi-cyclic low density parity check (LDPC) serial encoder in near field communication |
| CN103268212A (en) * | 2013-04-19 | 2013-08-28 | 荣成市鼎通电子信息科技有限公司 | Quasi-cyclic matrix high speed multiplier in deep space communication without memory |
| CN103268212B (en) * | 2013-04-19 | 2016-02-10 | 荣成市鼎通电子信息科技有限公司 | Without the need to quasi-cyclic matrix high-speed multiplier in the deep space communication of storer |
| CN103873070B (en) * | 2014-03-20 | 2016-09-21 | 航天恒星科技有限公司 | A kind of high spped coding device for CCSDS specification 7/8 code check LDPC and coded method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102970046B (en) | 2015-10-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102932009B (en) | Based on QC-LDPC parallel encoding method in the DTMB of look-up table | |
| CN102932007B (en) | QC-LDPC encoder and coded method in the deep space communication of highly-parallel | |
| CN102857324B (en) | Low density parity check (LDPC) serial coder in deep space communication and based on lookup table and coding method | |
| CN102857236B (en) | Based on LDPC encoder and coding method in the CMMB of sum array | |
| CN102857238B (en) | LDPC (Low Density Parity Check) encoder and encoding method based on summation array in deep space communication | |
| CN102843150B (en) | Low-latency QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) parallel encoder and encoding method | |
| CN102932011B (en) | Based on QC-LDPC parallel encoding method in the CMMB of look-up table | |
| CN102857239B (en) | LDPC (Low Density Parity Check) serial encoder and encoding method based on lookup table in CMMB (China Mobile Multimedia Broadcasting) | |
| CN102916706B (en) | QC-LDPC encoder and coding method in the CMMB of highly-parallel | |
| CN102932008B (en) | Based on QC-LDPC parallel encoding method in the deep space communication of look-up table | |
| CN102868495B (en) | Lookup table based LDPC (low-density parity-check) serial encoder and encoding method in near-earth communication | |
| CN102843146A (en) | Low-latency LDPC (Low-Density Parity-Check) parallel encoder and encoding method in deep space communication | |
| CN102970046B (en) | QC-LDPC encoder and coding method in the near-earth communication of highly-parallel | |
| CN102891687B (en) | Summation array-based QC-LDPC (Quasi-Low-Density Parity-Check) parallel encoder and encoding method | |
| CN102938652B (en) | Based on parallel encoder and the coding method of the QC-LDPC code of look-up table | |
| CN102932013B (en) | Based on QC-LDPC parallel encoding method in the near-earth communication of look-up table | |
| CN102857237B (en) | Low-delay LDPC (low-density parity-check) parallel encoder and encoding method in terrestrial communication system | |
| CN102882531B (en) | Coder and coding method for LDPC (low-density parity-check) codes in DTMB (digital television terrestrial multimedia broadcasting) based on summation array | |
| CN102932010B (en) | The highly-parallel encoder of QC-LDPC code and coding method | |
| CN102843148B (en) | QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) serial encoder and encoding method based on lookup table | |
| CN104980165A (en) | Low-time-delay QC-LDPC parallel encoder in WPAN | |
| CN104980167A (en) | QC-LDPC parallel encoder, based on summation array, in CDR | |
| CN104993836A (en) | Lookup table-based QC-LDPC serial encoder in WPAN | |
| CN102843149B (en) | Based on LDPC encoder and coding method in the near-earth communication of sum array | |
| CN104980169A (en) | QC-LDPC encoder in highly parallel WPAN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: ZHANG YAN Free format text: FORMER OWNER: SUZHOU VESTAX INFORMATION TECHNOLOGY CO., LTD. Effective date: 20150820 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhang Yan Inventor before: Zhang Peng Inventor before: Jiang Lanxiang Inventor before: Cai Chaoshi |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: ZHANG PENG JIANG LANXIANG CAI CHAOSHI TO: ZHANG YAN |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20150820 Address after: 264300 Rongcheng experimental middle school, Shandong, Weihai Applicant after: Zhang Yan Address before: Kolding road high tech Zone of Suzhou City, Jiangsu province 215163 No. 78 Su Gaoxin Software Park Building No. 7 102 Applicant before: Suzhou Weishida Information Technology Co., Ltd. |
|
| ASS | Succession or assignment of patent right |
Owner name: RONGCHENG DINGTONG ELECTRONIC INFORMATION SCIENCE Free format text: FORMER OWNER: ZHANG YAN Effective date: 20150828 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20150828 Address after: Rongcheng City, Weihai City, Shandong province 264300 Jianye Street No. 228 Applicant after: Rongcheng Dingtong Electronic Information Technology Co., Ltd. Address before: 264300 Rongcheng experimental middle school, Shandong, Weihai Applicant before: Zhang Yan |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20151028 Termination date: 20161121 |