Dynamic Analysis and FPGA Implementation of New Chaotic Neural Network and Optimization of Traveling Salesman Problem
A neural network is a model of the brain’s cognitive process, with a highly interconnected multiprocessor architecture. The neural network has incredible potential, in the view of these artificial neural networks inherently having good learning capabilities and the ability to learn different input f...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/5521192 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A neural network is a model of the brain’s cognitive process, with a highly interconnected multiprocessor architecture. The neural network has incredible potential, in the view of these artificial neural networks inherently having good learning capabilities and the ability to learn different input features. Based on this, this paper proposes a new chaotic neuron model and a new chaotic neural network (CNN) model. It includes a linear matrix, a sine function, and a chaotic neural network composed of three chaotic neurons. One of the chaotic neurons is affected by the sine function. The network has rich chaotic dynamics and can produce multiscroll hidden chaotic attractors. This paper studied its dynamic behaviors, including bifurcation behavior, Lyapunov exponent, Poincaré surface of section, and basins of attraction. In the process of analyzing the bifurcation and the basins of attraction, it was found that the network demonstrated hidden bifurcation phenomena, and the relevant properties of the basins of attraction were obtained. Thereafter, a chaotic neural network was implemented by using FPGA, and the experiment proved that the theoretical analysis results and FPGA implementation were consistent with each other. Finally, an energy function was constructed to optimize the calculation based on the CNN in order to provide a new approach to solve the TSP problem. |
|---|---|
| ISSN: | 1076-2787 1099-0526 |