Minimum-complexity optical architecture for look-up table computation in the residue number system

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.