57 results about "Hilbert curve" patented technology

The invention discloses a three-dimensional geologic model subdivision method based on an earth space grid structure, which adopts a plurality of types of earth space grid structures including longitude and latitude grids, octahedral projection grids and Hilbert curve filling grids to carry out three-dimensional division on the earth surface, and combines a layered recursive grid division technology to obtain a three-dimensional geologic model. Multi-level grid unit generation and geometric mapping from coarse resolution to high resolution are achieved, grid parameters are dynamically adjusted according to geologic features, large-size grids are adopted in a simple area to improve efficiency, small-size grids are adopted in a complex area to capture details, redundant units are eliminated in combination with a grid optimization algorithm, and the efficiency is improved. The accuracy and the calculation efficiency of the model are improved; a global unique identifier is generated through a GeoSOT-3D hierarchical recursion technology, union set, intersection and difference set operations of grid units are completed in combination with efficient Boolean operation, and the integrity and topological consistency of geologic model subdivision are ensured.

The invention discloses a tree three-dimensional reconstruction method based on a ground laser radar point cloud, and the method comprises the following steps: carrying out the down-sampling and noise reduction preprocessing of the point cloud data of a single plant through a Hilbert curve; carrying out branch and leaf separation on the preprocessed data by adopting a LeWoS model, and extracting a clear trunk point cloud; and extracting an initial skeleton of the tree by using a semantic Laplacian contraction algorithm based on the trunk point cloud, and optimizing the initial skeleton by using a Laplacian smoothing algorithm. The method has the beneficial effects that the S-LBC algorithm has more advantages in the aspect of maintaining the integrity of the topological structure of the tree, the problems of skeleton breakage and structure simplification can be avoided, and the overall shape of the tree is more natural; according to the method, the robustness under different point cloud densities is achieved, even under the condition of data missing or point cloud sparseness, the overall structure of the tree can still be well reconstructed, and reliable technical support is provided for high-precision tree modeling.

The invention discloses a serialization-based point cloud over-segmentation method, device and equipment and a medium, and relates to the technical field of point cloud over-segmentation. The point cloud over-segmentation method comprises the following steps: obtaining point cloud data set preprocessing; serializing the preprocessed point cloud data into a Hilbert curve; dividing the serialized point cloud data into a plurality of initial segments based on spatial continuity, and obtaining a multi-scale segment set; the feature similarity between adjacent segments is calculated, and a similarity matrix is obtained and established to provide a basis for subsequent super-point clustering; carrying out super-point clustering on the initial segments based on a self-adaptive updating algorithm; updating super-point features through a cross attention mechanism, establishing dynamic association between points and super-points, and obtaining a new super-point structure; and according to the updated super-point features, constructing a super-point graph, performing enhancement processing through a graph convolutional network, fusing features from the backbone point cloud network and corresponding multi-level super-point features, then transmitting the fused features to a segmentation head for segmentation, and obtaining semantic segmentation output.

The invention discloses a spatial data index construction method based on hierarchical clustering and Hilbert dimensionality reduction, belongs to the technical field of spatial indexes, and aims at solving the problem that the retrieval speed of mass agricultural multi-dimensional data is low, overcoming the limitation that an existing database spatial data index is low in construction speed and high in memory occupation and achieving rapid data retrieval. The method comprises the following steps: collecting agricultural multi-dimensional data and carrying out attribute binding, constructing clusters by utilizing a hierarchical clustering algorithm and setting threshold truncation points to segment high-dimensional spatial data into clusters in similar spatial distribution, filling different clusters through a Hilbert curve to map disordered high-dimensional data into ordered one-dimensional data to generate cluster type one-dimensional data, data point codes are calculated by utilizing Hilbert codes and are sequenced, then a multi-segment linear model is trained through positions, codes and errors, and finally corresponding data points are determined and retrieved according to query conditions. The method has wide applicability and can be applied to various mass data with multiple data attributes.

The invention provides a gas detection method and a gas detection device.The method comprises the steps that gas spectral data are obtained, the gas spectral data are obtained by detecting mixed gas in a gas cell through a quantum cascade laser, and the mixed gas comprises gas to be detected; according to global index information of the gas spectrum data, obtaining a plurality of local index information, the global index information representing coordinate curves of a plurality of signals in different coordinate system quadrants in the gas spectrum data; on the basis of a Hilbert space mapping method, quadrant overturning and rotation processing is carried out on a coordinate system quadrant of the at least one piece of local index information, and initial global coordinates are obtained; calculating a new initial global coordinate by taking the initial global coordinate as new global index information, and determining the new initial global coordinate corresponding to the target order of the Hilbert curve as target spectral data; and inputting the target spectral data into the gas concentration detection model, and outputting gas concentration information of the to-be-detected gas.

The invention provides an optical high-dimensional data time domain compression calculation method and system based on Hilbert mapping, and the method comprises the steps: employing a Hilbert mapping method, enabling original high-dimensional data to be expanded into a one-dimensional vector from a memory according to the dimension and size Size of the original high-dimensional data and a Hilbert curve with the order n of the same dimension, and carrying out the time domain compression calculation of the original high-dimensional data, and a digital-to-analog converter drives a high-speed optical modulator to load the vector to the time-varying intensity of the optical carrier so as to form signal light. Then, the signal light enters a basic time domain optical operation unit to be further processed, including weighted secondary intensity modulation, or optical difference (or differential) operation used for extracting a neighborhood information change relation and the like. And finally, vector information carried by the processed one-dimensional time domain signal light is extracted and stored, Hilbert inverse mapping of a corresponding dimension is carried out on the vector information, and the vector information is restored into high-dimensional feature information for subsequent operations such as judgment, segmentation and the like by an artificial intelligence algorithm.

The invention discloses a point cloud registration method based on an attention mechanism and a state space model. The method comprises the following steps: obtaining a standard surface shape precision point cloud and a deformed surface shape precision point cloud of an astronomical instrument; carrying out different levels of downsampling processing on the point cloud; sequentially carrying out serialization of a Hilbert curve, a transposed Hilbert curve and a zero-order curve on the processed point clouds of different levels; inputting the serialized point cloud into a coarse registration network fusing an attention mechanism and a state space model to extract features, and obtaining a corresponding relation of point cloud features; and estimating initial point cloud rotation and translation transformation through a dense-sparse fine registration network based on the corresponding relationship, and finally optimizing initial transformation through a weighted singular value decomposition algorithm to obtain a final registration result. According to the point cloud registration method, the registration effect of the point cloud registration method in a large-scale precise point cloud scene is improved, good registration performance is also ensured, and the effect of point cloud registration in surface type detection of high-precision equipment such as astronomical instruments is greatly improved.

The present invention discloses a robot based on a pseudo-Hilbert curve, comprising a robot body and a controller. The robot body is composed of sixty-three telescopic units connected end to end according to a second-order pseudo-three-dimensional Hilbert curve. The telescopic unit comprises a telescopic rod, a telescopic rod bracket, a cube connection block and a driver. The cube connection block is a hollow structure. The driver is placed in the inner cavity of the cube connection block. The second bracket of the telescopic unit is used to be fixedly connected with the three-dimensional connection block of another telescopic unit. The telescopic rod is connected to the driver through a wire. The controller controls the driver to control the extension and retraction of each telescopic rod. The robot of the present invention is designed in combination with a pseudo-three-dimensional Hilbert curve. The movement of the robot body is achieved by controlling the extension and retraction of the telescopic rod. Its structure can effectively reduce the influence of fluid resistance in the environment and complete some operations in an environment with large or changing fluid resistance.

This invention provides a method, apparatus, device, and medium for UAV route planning based on Hilbert curves. The method includes: collecting real-time position, attitude, and environmental information of the UAV; constructing an initial UAV route using a Hilbert curve based on the UAV's mission requirements and the collected information; smoothing the initial UAV route and removing redundant paths using a Bézier curve to obtain an optimized UAV route; correcting the optimized UAV route based on real-time environmental changes to generate a safe route; and converting the safe route into executable control commands for the UAV to drive its operation, thereby solving the problems of insufficient space filling efficiency, poor adaptability to dynamic environments, and low path smoothness in dynamic path planning.

The invention belongs to the field of computer application, and discloses an error-limited Hilbert tree learning index construction method on a directed road network, which comprises the following steps of: projecting a space-time sample into a position-time grid, sorting cells of the grid based on a Hilbert curve, dividing the sorted sample into logic blocks, storing the logic blocks into a disk, and constructing a Hilbert tree learning index. Meanwhile, a binary tree for dividing nodes according to Hilbert curve serial numbers is established, the mapping relation between the Hilbert serial numbers and logic blocks is represented, and it is guaranteed that the mapping error of leaf nodes is smaller than a specified error. According to the method, the two-dimensional space is divided according to the Hilbert curve, uniform distribution of trajectory data in the position-time grid is ensured, and full recall of query data is ensured through error bounded, so that query performance on tilt data is improved.

The application discloses a non-full-field data synchronization method based on a Hilbert curve and related equipment thereof, and belongs to the technical field of big data. The application obtains the primary key information of non-full-field data, performs a hash operation on the primary key information to obtain a hash value corresponding to the primary key information, maps the hash value to a two-dimensional space where a Hilbert curve of full-amount data is located, obtains coordinate data of the hash value on the Hilbert curve, inputs the coordinate data into a preset Hilbert space curve algorithm model to obtain position information of the non-full-field data, obtains a synchronization mode corresponding to the non-full-field data, and synchronizes the non-full-field data based on the synchronization mode and the position information. In addition, the application also relates to the technical field of blockchains, and the non-full-field data can be stored on nodes of a blockchain network. The application can realize fast query and positioning of non-full-field data, quickly complete synchronization of non-full-field data, and improve the efficiency of data synchronization.

The invention relates to a spatial range query method based on HQuadTree, and belongs to the technical field of spatial database indexing. The method comprises two parts of spatial index construction and spatial range query. When the index is constructed, the Hilbert curve and the QuadTree are combined, and the HQuadTree index is created. When the query is executed, a query q is given, and the space range query is moderately drilled down by adopting a strategy of combining depth first with limited breadth expansion, so that the number of returned invalid objects can be effectively reduced. In addition, in order to avoid intersection judgment times in the drilling process, a rapid intersection judgment strategy is provided to reduce the judgment times, and therefore the efficiency can be effectively inquired.

The application belongs to the field of computer application, and discloses a directed road network error limited Hilbert tree learning index construction method, which projects a space-time sample into a position-time grid, sorts cells of the grid based on a Hilbert curve, then divides the sorted sample into logical blocks and stores the logical blocks into a disk, and simultaneously establishes a binary tree for dividing nodes according to Hilbert curve serial numbers, representing a mapping relationship between the Hilbert serial numbers and the logical blocks, and ensuring that the mapping error of leaf nodes is less than a specified error. The application divides a two-dimensional space according to the Hilbert curve, ensures that trajectory data in the position-time grid is uniformly distributed, ensures full recall of query data through bounded error, and thus improves the query performance on inclined data.

This invention discloses a liquid-cooled plate flow channel structure based on Hilbert curves, belonging to the field of power battery thermal management technology. It mainly involves a coolant flow channel network composed of multiple flow channel units. The coolant flow channel network includes multiple integrated main channels, each consisting of multiple flow channel units connected in series. Each flow channel unit includes a unit inlet end, a Hilbert curve flow channel, and a unit outlet end. The liquid-cooled plate has inlets on both sides of its long side and outlets on both sides of its short side, forming intersecting transverse flow channels. This invention utilizes the self-similarity and high spatial coverage of the Hilbert curve to achieve near-full coverage flow of the coolant, expanding the heat dissipation area. Furthermore, it enhances heat transfer through continuous turns and flow channel contraction-expansion, significantly improving temperature uniformity and heat dissipation efficiency, and solving problems such as localized overheating in traditional straight channels or serpentine flow channels.

The invention discloses a preparation method of a Hilbert tactile sensor, a sensor, a circuit and a system. The method comprises the following steps: determining the order, the structure and the size of the Hilbert tactile sensor to be prepared according to the control requirement of an application scene; a straight line is converted into a Hilbert curve of a corresponding order through fractal recursion, and the unit length and the line width required by the Hilbert curve of the corresponding order are deduced; respectively depositing conductive films on the two substrates according to the Hilbert curves of the corresponding orders in the step S2, heating and curing, leading out double electrodes, and packaging; and setting the at least two conductive films to be in mirror symmetry, and adding a gasket with a certain thickness to enable the at least two conductive films to be in a non-contact state, thereby obtaining the Hilbert tactile sensor. The Hilbert tactile sensor is designed into different resolutions through fractal recursion, so that multifunctional application of the tactile sensor is realized.

The invention discloses an event flow action identification method based on a selection state space. The method comprises the following steps: step 1, carrying out noise reduction processing on original event stream data through a DBSCAN noise reduction algorithm; 2, scanning and serializing the event stream data after noise reduction through a Hilbert curve and a Zigzag curve, and converting an unstructured event stream into a serialized event stream; 3, encoding the serialized event stream data through a PointNet network to generate a spatial feature Token, extracting a time feature Token through a time aggregation module, and splicing the spatial feature Token and the time feature Token to obtain a complete spatial-temporal feature; and 4, inputting the spatial-temporal characteristics into a Bi-SSM module, and capturing bidirectional time dependence in an event stream through a bidirectional selection state space model, thereby realizing accurate recognition of the action. The method effectively solves the problems that in the prior art, calculation complexity is high, time information of event streams cannot be fully utilized, and model efficiency is low, and has the advantages of being low in calculation complexity and long in time sequence dependence modeling.

This application provides a method and apparatus for classifying encrypted traffic based on path signatures, relating to the field of artificial intelligence and also applicable to the financial field. The method includes: segmenting acquired encrypted traffic at the session granularity to obtain traffic paths; performing traffic path signatures on the traffic paths to obtain corresponding traffic path signature feature vectors; and inputting the traffic path signature feature vectors, after applying a Hilbert curve transform, into a pre-trained encrypted traffic classification model to obtain the encrypted traffic classification corresponding to the encrypted traffic. This application can generate signature information for encrypted traffic, thereby reflecting the geometric and statistical characteristics of encrypted traffic and exhibiting strong generalization ability.

The invention discloses a CNN-RNN-based nuclide identification method. The method comprises the steps of S1, gamma energy spectrum data acquisition and expansion; s2, gamma energy spectrum data preprocessing: performing smoothing and normalization processing on the energy spectrum data obtained in the step S1, mapping the processed energy spectrum data to 0-255, then transforming the processed energy spectrum data to a two-dimensional space through a Hilbert curve, generating a nuclide energy spectrum, and dividing the obtained nuclide energy spectrum data into a nuclide training set and a nuclide test set; s3, a nuclide identification model training and testing process: building a CNN-RNN model, decoding the nuclide training set obtained in the S2, and completing model training of the CNN-RNN model based on decoded data to obtain a trained CNN-RNN model; s2, testing the trained CNN-RNN model based on the nuclide test set obtained in S2, and when corresponding test indexes are met, exporting the corresponding CNN-RNN model as a nuclide identification model; and S4, completing the identification of the nuclide to be detected based on the obtained nuclide identification model. Therefore, the problem of the accuracy of nuclide identification is solved.

The invention relates to the technical field of location service privacy protection, in particular to a location privacy protection method based on regional confusion and differential privacy, which comprises the following steps: S1, dividing regions, processing a location set uploaded by a user, constructing a probability distribution matrix, and generating a user pseudo location; and S2, request forwarding: the relay server receives a user query request and generates a hidden area, forwards the query request to the LBS server based on the hidden area, and finally returns a query result to the user. According to the method, the positions are mapped and sorted through the Hilbert curve, so that the spatial proximity of the positions is accurately reflected; and the optimal clustering number k is adaptively determined in combination with a QK-means clustering algorithm, so that PLS division is more reasonable, and the accuracy and matching efficiency of region division are improved.

The present invention relates to the field of mechanical engineering and heat transfer. In particular, it provides a plate heat exchanger based on a surface constructed from the Hilbert curve, characterized in that it comprises a three-dimensional structure of substantially quadrangular shape, formed by a plurality of stacked metal plates; a metal shell operatively covering said substantially quadrangular three-dimensional structure; a set of double channels for the circulation of a fluid 1 and of a fluid 2, which completely covers each of the metal plates forming said plurality of metal plates, following a Hilbert curve of arbitrary order; and a first main collector double duct for the fluid 1 that has passed through the channels in the plates, and a second main collector double duct for the fluid 2 that has passed through the complementary channels of the plates.

The application discloses a land ownership space information construction method based on cadastral survey data, relates to the technical field of data processing, and comprises the following steps: adopting cadastral elements and ownership identification in cadastral survey results to perform coordinate unification, geometry repair, reference relationship calibration and ownership relationship calibration, and generating a cadastral space object sequence; performing Hilbert curve coding sorting on parcel space objects in the cadastral space object sequence, and dividing data sections according to cadastral sub-areas and continuous coding intervals, to generate a cadastral segmented directory; constructing a Hilbert global directory, an R-star tree local space index and a B-plus tree ownership attribute index through the cadastral segmented directory, and generating an ownership space construction index table. Through vectorized R-tree space connection, the application can perform batch judgment on the spatial relationship among parcel surfaces, boundary lines and boundary points, and can generate segmented ownership space results in combination with ownership attribute matching, so that the spatial relationship calculation efficiency and the ownership corresponding accuracy in a big data processing scene can be improved.

The present invention discloses a personalized trajectory privacy protection method based on differential perturbation, which belongs to the field of location services and information security. Considering the time correlation between positions at different times on the trajectory, the user determines the possible position set at the moment through the prior probability of the current moment position, and determines the possible position set at each moment according to the time correlation between positions at different times on the trajectory. In the position set, the geographical indistinguishability and the expected inference error are combined, and the minimum distance search algorithm based on the Hilbert curve is used to select a personalized position protection set for each possible position in the set. The Permute‑and‑Flip mechanism is applied to the position protection set to generate a probability distribution matrix to release the pseudo position. The method has simple steps and high protection flexibility. By setting different privacy budgets and expected inference boundary errors, it can meet the personalized privacy protection needs of users in different scenarios and balance location privacy and service quality.

The application provides a kind of laser radar point cloud fast query matching method based on local sensitive hash, first through laser radar scanning collection environment data, point cloud segmentation is carried out to the point cloud data collected using K-means clustering segmentation algorithm;Then the feature of data object is extracted, and the data set S after preprocessing is obtained;The point cloud data in voxel is generated one-dimensional index sequence using pseudo-hilbert curve generation algorithm;The pseudo-hilbert curve sequence obtained is encoded using LSH, and the index is constructed, the Euclidean distance between query point cloud and candidate point cloud is confirmed, and the nearest point cloud in voxel is confirmed.The method of the application improves the speed of point cloud feature extraction query based on local sensitive hash index method, shortens the query matching time and improves the query matching precision;LSH index gathers similar point clouds together by hashing coding pseudo-hilbert sequence, reduces the number of point clouds that need to calculate distance, thereby improves the retrieval efficiency.

The invention discloses a sea wave disaster early warning information precision verification method, and relates to the technical field of intelligent management, and the method comprises the following steps: dividing a three-dimensional space-time grid, calculating sea wave energy characteristics, reconstructing the monitoring data of a problem node, generating an analysis link, and carrying out the first verification of alarm information based on the time characteristics of a sea wave disaster; and updating the alarm information according to the first verification result. According to the method, the global sea area is divided into the three-dimensional grids with the unified temporal-spatial resolution, spatial-temporal alignment of multi-source monitoring data is achieved through three-dimensional Hilbert curve coding, the precision and consistency of sea wave energy feature extraction are improved, a comparison mechanism of theoretical energy and actual energy is constructed based on an inter-node energy propagation model, and the real energy feature extraction accuracy is improved. The reliability and robustness of monitoring data are improved, the accuracy and authority of early warning information are improved by constructing an analysis link, and the node with the highest error risk is preferentially processed by adopting a strategy of firstly verifying problem nodes and then rechecking reliable nodes.

The present invention discloses a data distributed clustering method and device based on local direction centrality. The method includes the following steps: S1. Submit the parameters required for the algorithm task in a distributed cluster environment and read the data to be clustered; S2. Construct a priority search K-means tree global index based on the complete data and share the index variables to each working node in the cluster; S3. Divide the complete data by combining data sampling and Hilbert curve partitioning method; S4. Parallelly execute CDC local clustering on each working node; S5. Perform inter-region cluster merging according to the maximum reachable distance of the local clusters to generate complete clusters; S6. Output the clustering result to the distributed file system. The method of the present invention performs distributed optimization and acceleration on the CDC clustering algorithm from two perspectives of algorithm process optimization and parallel processing optimization, aiming to improve the computing efficiency of the CDC algorithm and provide a feasible optimization scheme for the application of this algorithm in massive data mining and machine learning tasks.

The invention relates to the technical field of geographic information processing, in particular to a real estate surveying and mapping resource sharing system and method, and the system comprises a heterogeneous primitive analysis module which constructs a spatial topological incidence matrix and generates a standardized semantic feature set, and a distributed index module which generates spatial position hash codes by using a Hilbert curve to perform fragmentation storage, the vision field verification module uses a ray crossover algorithm to calculate a space inclusion state and generate a dynamic access authorization token, and the increment synchronization module calculates a geometric element difference package to complete instant redrawing. According to the method, topological dislocation caused by source data format difference is eliminated by constructing a heterogeneous semantic mapping matrix, bandwidth occupation and loading delay are reduced based on a differential transmission mechanism of viewpoint coordinates, and self-adaptive adjustment of access granularity is realized by utilizing a dynamic geofencing algorithm; the problem of I / O blocking under high-concurrency requests is solved by adopting distributed hash fragment index logic, and accurate distribution and real-time synchronization of resources are ensured.

The present invention relates to a color image encryption method based on a four-dimensional memristive hyperchaotic system. The present invention includes the following steps: S1: Construct a four-dimensional memristive hyperchaotic system and discretize the system. S2: Read the color plaintext image information and split the color image to be encrypted into three primary color component matrices. S3: Obtain the initial value containing the plaintext information; combine the initial value with the discrete memristive hyperchaotic system for iteration to obtain a hyperchaotic sequence. S4: Preprocess the hyperchaotic sequence so that the chaotic sequence is applicable to image data to obtain a key sequence. S5: Use the key sequence to perform encryption operations on the rows and columns of the R, G, and B channels of the color plaintext image respectively. The initial key of the present invention contains the Hash value of the original image, and completes the permutation and diffusion operations of the image under the introduction of the Hash table structure and the Hilbert curve, making the relationship between the plaintext, ciphertext, and key more complex.

The invention discloses a wind power generation power estimation method based on data fusion processing, and relates to the technical field of wind power generation power prediction, and the method comprises the steps: collecting real-time multi-modal data, carrying out the preprocessing, generating a real-time feature set, extracting a power sequence, calculating the number of IMFs through a cyclic autocorrelation function and a similarity coefficient, and carrying out the prediction of the IMFs. The method comprises the following steps: performing EEMD decomposition in combination with noise amplitude to obtain an IMF sequence, dividing a wind power plant into equal-proportion grids, mapping geographic coordinates of a fan into a two-dimensional grid index, converting the two-dimensional grid index into one-dimensional codes through a Hilbert curve algorithm, constructing space-time grids in combination with time binary codes, mapping multi-dimensional feature vectors to generate an aggregation space-time feature cube, and performing power prediction; according to the method, the input quality and precision of the prediction model are improved through time alignment and feature extraction of the multi-modal data, and the prediction robustness and the system adaptability are improved by using EEMD decomposition and space-time grid modeling.

The invention discloses a wood detection method and system based on a quantum image enhancement algorithm, and relates to the technical field of image processing, and the method comprises the steps: placing a to-be-detected wood sample in a terahertz imaging device, collecting a multi-view reflection signal, obtaining a frequency domain signal through FFT transformation, and mapping a frequency spectrum into a two-dimensional image to form an initial view image set; performing quantum DNA coding on the pixel value of each image, performing mapping by adopting four bases to generate a DNA image matrix, rearranging pixel addresses by using a Hilbert curve traversal method, and outputting a disturbed image; converting the disturbance image into a one-dimensional time sequence signal, and establishing an AR model to obtain a preliminary enhanced image; according to the method, the separability and identifiability of the defect edge are effectively improved, and three-dimensional expression and highlight display of the geometric morphology of the defect are realized through three-channel pseudo-color mapping and three-dimensional voxel grid modeling.

The invention discloses a large-scale spiking neural network efficient partitioning method based on a connection mode index, and the method comprises the following steps: aiming at the characteristics of brain-like computing hardware, carrying out the topological sorting, carrying out the locality-keeping index sorting of neurons through employing a Hilbert curve, and carrying out the resource-limited segmentation algorithm based on binary search, neurons with common pre-synaptic inputs are clustered into the same computing core. According to the method, a pulse sharing mechanism of hardware can be utilized to the maximum extent, the pulse broadcast flow of the network-on-chip is remarkably reduced, and core resource waste caused by axon memory limitation is reduced. Compared with the prior art, the compiling speed is increased by several orders of magnitude when the network with the gigons of neuron scale is processed, and the communication delay and the energy consumption during operation are greatly optimized at the same time.