A model of parallel sorting neural network of discrete-time-Reference-Cited by-同舟云学术

A model of parallel sorting neural network of discrete-time

Published:2020 Issue:1 Volume:1 Page:67-72
ISSN:
Container-title:Computer Design Systems. Theory and Practice
language:
Short-container-title:

Author:

Tymoshchuk P.¹

Affiliation:

1. Lviv Polytechnic National University

Abstract

A model of parallel sorting neural network of discrete-time is presented. The model is described by a system of differential equations and by step functions. The network has high speed, any finite resolution of input data and it can process unknown input data of finite values located in arbitrary finite range. The network is characterized by moderate computational complexity and complexity of hardware implementation. The results of computer simulation illustrating the efficiency of the network are provided.

Publisher

Lviv Polytechnic National University

Reference14 articles.

1. Knuth DE, 1973. The Art of Computer Programming, Sorting and Searching: Reading.

2. Akl SG, 1985. Parallel Sorting Algorithms: Academic.

3. Atkins M, 1989. Sorting by Hopfield nets, in Proceedings of International Joint Conference on Neural Networks: 65-68. DOI: https://doi.org/10.1109/IJCNN.1989.118679.

4. Takefuji Y and Lee KS, 1990. A super parallel sorting algorithm based on neural networks, IEEE Transactions on Circuits and Systems: CAS-37/11: 1425-1429. DOI: https://doi.org/10.1109/31.62417.

5. Chen W and Hsieh K, 1990. A neural sorting network with O(1) time complexity, in Proceedings of In-ternational Joint Conference on Neural Networks: III: 793-798. DOI: https://doi.org/10.1109/IJCNN. 1990.137551.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exploring cultural logic in becoming teacher: a collaborative autoethnography on transnational teaching and learning;Professional Development in Education;2020-12-18