Paper
2 December 1992 Minimum-complexity optical architecture for look-up table computation in the residue number system
Author Affiliations +
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.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ravindra A. Athale, Michael W. Haney, James J. Levy, and Gary W. Euliss "Minimum-complexity optical architecture for look-up table computation in the residue number system", Proc. SPIE 1703, Optical Technology for Microwave Applications VI and Optoelectronic Signal Processing for Phased-Array Antennas III, (2 December 1992); https://doi.org/10.1117/12.138410
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Radon

Modulators

Spatial light modulators

Computing systems

Light emitting diodes

Semiconductor lasers

Computer architecture

RELATED CONTENT


Back to Top