About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IJCNN 2016
Conference paper
O(1) time sorting algorithms using spiking neurons
Abstract
This paper presents the design and implementation of two spiking neural network based sorting algorithms with time complexity of O(1). These algorithms are inspired from artificial neural network based sorting algorithms. A number comparator circuit using spiking network as a building block has been proposed and been used in the sorting algorithms to compare numbers. This comparator circuit is generic and can be used in other algorithms. Results show that both these algorithms take constant time to sort any count of numbers once the circuit is setup with sufficient input lines and input sequence of numbers is configured in the network.