Coding method of one kind of low-density parity checking codes for deep space application

A technology of low-density parity and coding method, applied in error detection coding using multi-bit parity bits, error correction/detection using block codes, data representation error detection/correction, etc. Implementing complexity and other issues to achieve the effect of reducing hardware resources, reducing complexity, and low complexity

Active Publication Date: 2018-04-13
TIANJIN UNIV
View PDF6 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The invention provides an encoding method for a class of low-density parity-check codes for deep space applications. The invention has lower implementation complexity, can be implemented with fewer operations, and greatly reduces the hardware required by the encoder Resources to meet the needs of deep space application scenarios, see the following description for details:

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
  • Coding method of one kind of low-density parity checking codes for deep space application
  • Coding method of one kind of low-density parity checking codes for deep space application
  • Coding method of one kind of low-density parity checking codes for deep space application

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0034] Below in conjunction with Table 1-Table 3, the schemes in Embodiments 1 and 2 are further introduced, see the following description for details:

[0035] In the CCSDS standard, the structure of the parity check matrix H of the LDPC code with the code rate r of 1 / 2, 2 / 3 and 4 / 5 is as follows figure 1 shown. Among them, I M Indicates the identity matrix of M×M, 0 M Represents an M×M all-zero matrix, M represents the size of the sub-matrix, and its values ​​are shown in Table 1 under different information code block length k and code rate r.

[0036] Table 1 The value of the size M of the LDPC code submatrix

[0037]

[0038] Π K , K∈{1,2,...,26} represents the M×M permutation matrix, Π K The non-zero elements in the i-th row are located at the π-th K (i) column, where i∈{0,...,M-1}, π K The value of (i) is determined by formula (1):

[0039]

[0040] in, Represents rounding down, mod represents modulo operation, θ K , φ K The value of (j, M) can be seen ...

Embodiment 2

[0060] Taking the LDPC code with a code length of 1024 and a code rate of 1 / 2 as an example, combine Figure 1-Figure 3 Carry out feasibility verification to the scheme in embodiment 1-3, see the following description for details:

[0061] Step 1: Express the parity check matrix as H=[H m ,H c ] 3M×5M , H m The dimension is 3M×2M, H c The dimension of is 3M×3M, and the sub-matrix size M=512.

[0062] Step 2: Calculate the intermediate vector For LDPC codes with code rate 1 / 2, H m has the following form:

[0063]

[0064] The information bit vector m can be expressed as in and The dimension of is M×1, then there are:

[0065]

[0066]

[0067] where the vector t 1 , t 2 The dimension of is M×1, and the circuit realization structure is as follows Figure 4 shown.

[0068] Step 3: The matrix H c Decomposed into four sub-matrices,

[0069] which is in C=[0 M Π 7 +Π 8 ], D=[I M ],

[0070] Construct matrix T=(D+CA -1 B) -1 =(I M +(Π 7 +Π ...

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

No PUM Login to view more

Abstract

The invention discloses a coding method of one kind of low-density parity checking codes for deep space application, and relates to the field of digital communication error control coding. According to the method, a verification matrix is partitioned to obtain a dense and relatively-small matrix, and therefore the implementation complexity of matrix multiplication operation in the coding process is reduced; the complexity of other operation is also low with the help of multiplication operation of a sparse matrix and vectors; and with the help of the above two points, low-complexity coding forthe kind of LDPC codes is achieved. Accordingly, the implementation complexity of coding operation of the kind of LDPC codes can be effectively reduced, and the LDPC codes are very suitable for beingapplied in space communication.

Description

technical field [0001] The invention relates to the field of digital communication error control coding, in particular to a coding method for a class of low-density parity check codes for deep space applications. Background technique [0002] In space applications, due to the large path propagation loss in the transmission of signals in a large-scale space, the signal received by the receiving end has an extremely low signal-to-noise ratio. Therefore, it is necessary to use high coding gain channel coding technology to ensure the reliability of information. transmission. CCSDS (Space Data System Advisory Committee) proposes to apply graph theory-based LDPC (Low Density Parity Check) codes to a new generation of space telemetry channels. As the code length continues to increase, this type of LDPC code can achieve a linear increase in the minimum distance, so it can obtain better error correction performance. [0003] For deep space applications, the hardware resources and e...

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
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H03M13/11
Inventor 陈为刚刘元松韩昌彩
Owner TIANJIN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products