Shortest path acquisition method and device based on memristor pulse coupling neural network

A pulse-coupled nerve, shortest path technology, applied in biological neural network models, neural architecture, data processing applications, etc., can solve the problems of lack, low energy consumption, small chip area, etc., and achieve the effect of high parallelism and low energy consumption

Active Publication Date: 2022-02-01
ZHEJIANG LAB
View PDF20 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the von Neumann machine executes instructions sequentially, which does not match the parallelism of the pulse-coupled neural network algorithm
Although the ASICs of pulse-coupled neural 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
  • Shortest path acquisition method and device based on memristor pulse coupling neural network
  • Shortest path acquisition method and device based on memristor pulse coupling neural network
  • Shortest path acquisition method and device based on memristor pulse coupling neural network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] Specific embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings. It should be understood that the specific embodiments described here are only used to illustrate and explain the present invention, and are not intended to limit the present invention.

[0032] Such as figure 1 As shown, a shortest path acquisition method based on memristor pulse-coupled neural network includes the following steps:

[0033] Step S1, constructing a weighted graph of vertices and paths between vertices, for example: obtaining a map of Hangzhou from an electronic map, such as Figure 2a As shown, select 8 landmarks on the map and the distance between landmarks to form a weighted map, such as Figure 2b shown. Among them, A represents the artificial intelligence town, B represents the intersection of Wenyi West Road and Yunxi Road, C represents the intersection of Yuhangtang Road and Yunxi Road, D represents the intersection of Y...

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 shortest path acquisition method and device based on a memristor pulse coupling neural network, and the method comprises the steps: directly mapping edges and vertexes of a weighted graph to synapses and neurons on the memristor-based pulse coupling neural network, recording the activation time of the neurons and the connectivity of the given neurons, and obtaining the shortest path from the starting neuron to all other neurons through highly parallel pulse propagation. According to the pulse coupling neural network based on the memristor, high parallelism of physical characteristics of the memristor is fully utilized, and the shortest path is obtained with low time complexity and space complexity; and 100% path optimality is obtained in the eight-vertex weighted graph, and the energy consumption is as low as 0.33 [mu]J.

Description

technical field [0001] The invention relates to the technical field of non-volatile memory, in particular to a method and device for obtaining the shortest path based on a memristor pulse-coupled neural network, which is applied to solving the shortest path problem in graph calculation. Background technique [0002] Graph is an important data structure that can fully express the connection and dependency attributes of things in nature, so graph computing is widely used in the computer field. The shortest path problem is a classic problem in graph computing, which is to find a shortest path between the vertices of a given graph. Many problems can be efficiently solved by the shortest path method, such as path planning, signal pathway, drug development, etc. Traditional algorithms for solving the shortest path problem, such as Dijkstra's algorithm, use complex data structures, Floyd's algorithm, and have high time complexity Moreover, these two classic algorithms are execut...

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): G06N3/04G06Q10/04
CPCG06N3/049G06Q10/047
Inventor 高丽丽时拓张程高顾子熙王志斌李一琪
Owner ZHEJIANG LAB
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap