Abstract
Threshold (or relative magnitude) search is traditionally performed iteratively in a bit-serial manner in optical data-base/knowledge-base machines, which results in an execution time proportional to the operand size. We present a single-step threshold search algorithm and its optical implementation. The proposed algorithm performs magnitude comparison in constant time, independent of the operand size, and consequently it greatly increases the performance of optical data-base/knowledge-base processing operations such as searching, selection, retrieving, and sorting.
© 1993 Optical Society of America
Full Article | PDF ArticleMore Like This
Abram Detofsky, Peng Yin Choo, and Ahmed Louri
Opt. Lett. 23(17) 1372-1374 (1998)
Ahmed Louri and James A. Hatch
Appl. Opt. 33(35) 8153-8163 (1994)
Peng Yin Choo, Abram Detofsky, and Ahmed Louri
Appl. Opt. 38(26) 5594-5604 (1999)