Open Access
Add to BibSonomyAbstract
Sorting a sequence of N items requires at least O (NlogN) time steps on a conventional uniprocessor computer and O(log2 N) for most electronic parallel sorting networks, such as old-even merging network, bitonic merging network and perfect shuffle network. In this paper we provide an optical facility for sorting a sequence of N items in only O(1) time steps.
© 1990 Optical Society of America
PDF ArticleMore Like This
A Constant-Time Parallel Sorting Algorithm and its Optical Implementation Using Smart Pixels
Ahmed Louri, James A Hatch, and Jongwhoa Na
OMC5 Optical Computing (IP) 1995
Optoelectronic shuffle-exchange network for multiprocessing architectures
Michael W. Haney
TuX5 OSA Annual Meeting (FIO) 1990
Fully parallel, real-time optical architectures for superior time–frequency representations of signals
Payman Arabshahi, Robert J. Marks, and Les E. Atlas
ThK7 OSA Annual Meeting (FIO) 1990