OSA's Digital Library

Optics Letters

Optics Letters

| RAPID, SHORT PUBLICATIONS ON THE LATEST IN OPTICAL DISCOVERIES

  • Vol. 23, Iss. 17 — Sep. 1, 1998
  • pp: 1372–1374

Optical implementation of a constant-time multicomparand bit-parallel magnitude-comparison algorithm using wavelength- and polarization-division multiplexing with application to parallel database processing

Abram Detofsky, Peng Yin Choo, and Ahmed Louri  »View Author Affiliations


Optics Letters, Vol. 23, Issue 17, pp. 1372-1374 (1998)
http://dx.doi.org/10.1364/OL.23.001372


View Full Text Article

Acrobat PDF (1048 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

We present a word- and bit-parallel magnitude-comparison architecture that permits multiple comparands to be compared with multiple relations in constant time. The proposed magnitude-comparison algorithm uses a novel polarization and wavelength-encoding scheme to achieve a fast, scalable realization. Distinctive features of the proposed architecture include (1) the use of a multiple-wavelength encoding scheme to increase processing parallelism and (2) multiple-comparand word- and bit-parallel comparison with an execution time that is independent of the data or word size.

© 1998 Optical Society of America

OCIS Codes
(200.2610) Optics in computing : Free-space digital optics
(200.4540) Optics in computing : Optical content addressable memory processors
(200.4560) Optics in computing : Optical data processing
(200.4860) Optics in computing : Optical vector-matrix systems
(200.4960) Optics in computing : Parallel processing

Citation
Abram Detofsky, Peng Yin Choo, and Ahmed Louri, "Optical implementation of a constant-time multicomparand bit-parallel magnitude-comparison algorithm using wavelength- and polarization-division multiplexing with application to parallel database processing," Opt. Lett. 23, 1372-1374 (1998)
http://www.opticsinfobase.org/ol/abstract.cfm?URI=ol-23-17-1372


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. A. Louri, Appl. Opt. 31, 3241 (1992).
  2. P. Mitkas and B. Berra, J. Parallel Distributed Comput. 17, 230 (1993).
  3. L. Irakliotis, G. Betzos, and P. Mitkas, in Associative Processors and Processing, A. Krieklis and C. Wheems, eds. (IEEE Computer Society, New York, 1997), p. 155.
  4. P. B. Berra, K. H. Brenner, W. T. Chatey, H. J. Caulfield, S. H. Lee, and H. Szu, Appl. Opt. 29, 195 (1990).
  5. M. Iwata, J. Tanida, and Y. Ichioka, Appl. Opt. 32, 1987 (1987).
  6. P. Guilfoyle, P. Mitkas, and P. Berra, Proc. SPIE 1297, 124 (1990).
  7. A. Louri and J. Hatch, Jr., Appl. Opt. 33, 8153 (1994).
  8. C. J. Date, An Introduction to Database Systems, 4th ed. (Addison-Wesley, Reading, Mass., 1986), p. 245.
  9. A. Louri and J. Hatch, Jr., Opt. Lett. 18, 992 (1993).

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited