论文信息 - Complexity of 3-D optical interconnection-based residue addition processors

Complexity of 3-D optical interconnection-based residue addition processors

The complexity of residue addition processors that are implemented by 3-D optical interconnections has been investigated. The complexity is measured as the number of switching elements required to perform the operation. The complexity of these processors has been determined for moduli 2 through 17 that are prime or powers of prime numbers. The results are compared with the complexity of the 2-D architecture.<<ETX>>

M. M. Mirsalehi | U.-S. Rhee | M. Mirsalehi | U. Rhee

[1] Richard I. Tanaka,et al. Residue arithmetic and its applications to computer technology , 1967 .

[2] Stuart A. Collins. Numerical Optical Data Processor , 1977, Other Conferences.

[3] William W. Stoner,et al. Residue-Based Optical Processor , 1979, Other Conferences.

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

[5] J. Shamir. Three-dimensional optical interconnection gate array. , 1987, Applied optics.

[6] C C Guest,et al. Truth-table look-up optical processing utilizing binary and residue arithmetic. , 1980, Applied optics.

[7] J Shamir,et al. Three-dimensional optical Fredkin gate arrays applied to residue arithmetic. , 1989, Applied optics.

[8] S. H. Lee,et al. Residue Arithmetic Circuit Design Based On Integrated Optics , 1982, Photonics West - Lasers and Applications in Science and Engineering.

[9] J Shamir,et al. Residue arithmetic processing utilizing optical Fredkin gate arrays. , 1987, Applied optics.