论文信息 - Complexity of residue position-coded lookup table array processors.

Complexity of residue position-coded lookup table array processors.

Residue position-coded lookup table processing is reviewed. Position-coded modulo m lookup tables with gate complexities equal to m(2), 2m, 4 radicalm, and factored m(2) are discussed. The complexity of a 2-D array processor is analytically calculated and a comparison made for all four types of lookup table. A preliminary analysis is presented that compares the complexities of the residue processor with that of its electronic digital counterpart.

A P Goutzoulis

[1] A P Goutzoulis,et al. Residue arithmetic techniques for optical processing of adaptive phased array radars. , 1986, Applied optics.

[2] E. C. Malarkey,et al. Prototype position-coded residue look-up table using laser diodes , 1987 .

[3] John N. Polky,et al. A Residue Number System Implementation of the LMS Algorithm Using Optical Waveguide Circuits , 1983, IEEE Transactions on Computers.

[4] C. Burrus,et al. Novel hybrid optically bistable switch: The quantum well self‐electro‐optic effect device , 1984 .

[5] Thomas K. Gaylord,et al. Optical Digital Truth Table Look-Up Processing , 1985 .

[6] J W Goodman,et al. Optical computation using residue arithmetic. , 1979, Applied optics.

[7] D Casasent,et al. Optical residue arithmetic: a correlation approach. , 1979, Applied optics.