Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Low density parity check code decoding method based on chemical reaction network

A chemical reaction network and low-density parity technology, applied in the field of low-density parity-check code decoding, can solve problems such as low-density parity-check codes that have not yet appeared, and achieve the effect of low calculation energy consumption

Active Publication Date: 2018-10-09
SOUTHEAST UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in the prior art, there is no method for realizing LDPC decoding by using chemical reaction network

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
  • Low density parity check code decoding method based on chemical reaction network
  • Low density parity check code decoding method based on chemical reaction network
  • Low density parity check code decoding method based on chemical reaction network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] The technical solution of the present invention will be further introduced below in combination with specific implementation methods and accompanying drawings.

[0041] This specific embodiment discloses a low-density parity-check code decoding method based on a chemical reaction network, such as figure 1 As shown, for the j-th check node connected to the i-th 1 i 2 and i 3 In the case of data nodes, the following calculations are performed:

[0042] 11) Use z, x and c in formula (1) as z=j·i 1 , x=i 2 · j and c = i 3 Substitute j for calculation;

[0043] 12) Use z, x and c in formula (1) with z=j·i 2, x=i 1 · j and c = i 3 Substitute j for calculation;

[0044] 13) Use z, x and c in formula (1) as z=j·i 3 , x=i 2 · j and c = i 1 Substitute j for calculation;

[0045] Wherein, formula (1) that 11), 12) and 13) are aimed at is:

[0046] R+M z →R+M 1 z +M 2 z +M 3 z +M 4 z

[0047]

[0048]

[0049] Bringing in three times generates three g...

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 low density parity check code decoding method based on a chemical reaction network. The method performs probability number calculation by using a specific DNA strand concentration to represent a specific probability number and using a DNA strand displacement reaction. In the calculation process, several sets of DNA strand displacement reactions are pre-designed to performcalculations such as addition, subtraction, multiplication and division, and the respective group of reactions is sequentially controlled by a clock also composed of DNA strand displacement reactions. The invention is capable of implementing decoding calculations via pathways other than silicon.

Description

technical field [0001] The invention relates to a low density parity check code decoding method based on a chemical reaction network. Background technique [0002] Low-density parity-check codes (LDPC codes) were proposed by Gallager in 1962 and proved to have an error correction capability close to Shannon's limit. However, it has not received much attention due to limited computing power. Until the 1990s, the low-density parity-check code was gradually approaching to be realized, and gradually became a research hotspot. [0003] LDPC codes are generated by parity check matrices with sparse matrix properties. A (n, k) check matrix can convert k-bit information into n-bit codewords, and at the same time, the matrix can be mapped into a bipartite graph with n check nodes and k data nodes. Therefore, an iterative Belief Propagation (BP) algorithm can be used for the decoding process. In this algorithm, the data circulates in the check node and the data node and continuousl...

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
IPC IPC(8): H03M13/11G06N3/12
CPCG06N3/123H03M13/1111
Inventor 张川张星池尤肖虎
Owner SOUTHEAST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com