Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
An encoding method and encoder technology, applied in the field of LDPC encoding methods and LDPC encoders, can solve the problems of single encoding parallelism and high complexity, and achieve the effect of reasonable configuration
Active Publication Date: 2020-01-24
NAT SPACE SCI CENT CAS
View PDF3 Cites 1 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0005]
The purpose of the present invention is to overcome the problems of high complexity and single encoding parallelism in the existing LDPC encodin
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0049] Embodiment 1 of the present invention provides a kind of LDPC coding method, and this method comprises:
[0050] Step 1) The CCSDS near-Earth satellite communication standard adopts (8176,7154) LDPC codes with a coding efficiency of 7 / 8. This code has good structural characteristics, and its generation matrix G is a matrix with a size of 7154×8176:
[0051]
[0052] As shown in formula (1), the generator matrix G is composed of 14×16 circular matrices with a size of 511×511, where I is the unit matrix, 0 is the zero matrix, and B i,j (i=1,...14; j=1,2) is a circular matrix, b i,j for B i,j first line.
[0053] The generator matrix G corresponds to the codeword (u, C). The first 14 blocks of G correspond to the information bit vector u, and the last 2 blocks correspond to the check bit vector C.
[0054] Step 2) Take 511 bits as a segment, divide the information bit vector u into 14 sub-vectors A i =(u (i-1)×511+1 u (i-1)×511+2 … u i×511 ), and at the same ti...
Embodiment 2
[0060] Embodiment 2 of the present invention proposes a low-complexity configurable LDPC encoder, its structure diagram is as follows figure 1 As shown, including: control module, data processing module, parallel coding module and output module;
[0061] The control module is used to control the output of the data processing module by M bits, and dynamically configure the parallel encoding module;
[0062] The data processing module is used to divide the information bit vector u into 14 sub-vectors A with a length of 511 1 ,…A 14 , and for each A i Perform 0-fill processing and expand it into an information bit vector E with a length of 512 i , according to the encoding parallelism M, the E i Divided into M sub-vectors with a length of N=512 / M bits i=1,2,...14, and encode M bits in parallel output to the parallel encoding module, where for The dth element, d=1,2,...N, c=1,2,...M;
[0063] The parallel encoding module is used to encode bits in parallel according to...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention discloses an LDPC encoding method and an LDPC encoder, and the method comprises the steps: 1), obtaining an I-row J-column b-order cyclic matrix Bi, j from a generation matrix G, i beinggreater than or equal to 1 and less than or equal to I, and j being greater than or equal to 1 and less than or equal to J; step 2) dividing the coded information bit vector u into I sections of information bit vectors A1,..., AI of which the lengths are b bits, performing zero supplement processing on each information bit vector A1,..., AI, and expanding the information bit vectors A1,..., AI into E1,..., EI; 3) according to the coding parallelism degree M, segmenting Ei into M equal-length sub-vectors; 4) segmenting a cyclic matrix Bi, j into M sub-cyclic matrixes; 5) calculating Cj as a check bit vector segment of which the length is b; and finally, obtaining a check bit vector C = (C1, C2,..., CJ). The LDPC encoding method provided by the invention has the advantages of low complexity, configurable encoding parallelism and high encoding rate, and has higher application value in a satellite high-speed data transmission system with harsh requirements on resources, power consumptionand encoding rate.
Description
technical field [0001] The invention relates to the technical field of satellite high-speed data transmission and channel coding, in particular to an LDPC coding method and an LDPC coder. Background technique [0002] With the continuous improvement of satellite observation load accuracy and the rapid development of satellite application technology, the demand for satellite-to-ground data transmission is growing rapidly. How to achieve high-speed data transmission under the condition of limited hardware resources, bandwidth, and power on the satellite is a key issue in the field of satellite communications. Research hotspots. The on-board power of China's satellite data transmission system is limited, the ground receiving stations are mainly concentrated in the territory, the transmission time window is small, the elevation angle changes in a large range, and the channel environment is complex. Technology has strong application requirements. [0003] Low Density Parity Che...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more