Share Email Print
cover

Proceedings Paper

Minimum-complexity optical architecture for look-up table computation in the residue number system
Author(s): Ravindra A. Athale; Michael W. Haney; James J. Levy; Gary W. Euliss
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

An optical outer product architecture is presented which performs residue arithmetic operations via position-coded look-up tables. The architecture can implement arbitrary integer- valued functions of two independent variables in a single gate delay. The outer product configuration possesses spatial complexity (gate count) which grows linearly with the size of the modulus, and therefore with the system dynamic range, in contrast to traditional residue look-up tables which have quadratic growth in spatial complexity. The use of linear arrays of sources and modulators leads to power requirements that also grew linearly with the size of the modulus. Design and demonstration of a proof-of-concept experiment are also presented.

Paper Details

Date Published: 2 December 1992
PDF: 8 pages
Proc. SPIE 1703, Optical Technology for Microwave Applications VI and Optoelectronic Signal Processing for Phased-Array Antennas III, (2 December 1992); doi: 10.1117/12.138410
Show Author Affiliations
Ravindra A. Athale, George Mason Univ. (United States)
Michael W. Haney, BDM International, Inc. (United States)
James J. Levy, BDM International, Inc. (United States)
Gary W. Euliss, George Mason Univ. (United States)


Published in SPIE Proceedings Vol. 1703:
Optical Technology for Microwave Applications VI and Optoelectronic Signal Processing for Phased-Array Antennas III
Shi-Kay Yao; Brian M. Hendrickson, Editor(s)

© SPIE. Terms of Use
Back to Top