Collective process circuit that sorts
Comparing and sorting are common functions in natural and artificial systems. Many known algorithms that sort m numbers require time from O(m/sup 2/) to O(m). Algorithms to find the greatest number have been realised in neural networks and discrete time systems. Presented in the paper is a new circuit, the MAXOR, which incorporates a continuous time recursive collective process for finding the maximum of many inputs and sort inputs, like the spaghetti sort algorithm, when furnished with synchronous control. The resulting output is broadcast throughout the process. The precision /spl eta/ required of the circuit is only that needed to distinguish between the maximum and next lower inputs. Stability is assured within practical parameters where the output is observed to settle in linearised time O(m//spl eta/).