论文信息 - Higher-ordered rules for symbolic substitution

Higher-ordered rules for symbolic substitution

Abstract Symbolic substitution rules are derived for arbitrary switching functions. The rules presented are based on additional inputs and multiple-valued logic. The result is that fewer applications of the rules are needed to complete an operation. The throughput of a system is effectively increased. In general, as more complex functions are implemented, more rules are needed.

S. P. Kozaitis

[1] Karl-Heinz Brenner,et al. Digital optical computing with symbolic substitution. , 1986 .

[2] Stanley L. Hurst,et al. Multiple-valued threshold logic: its status and its realization , 1986 .

[3] M J Murdocca. Digital optical computing with one-rule cellular automata. , 1987, Applied optics.

[4] Uzi Efron. Optical Information Processing: Systems, Materials, And Devices , 1987 .

[5] P. A. Ramamoorthy,et al. Optical Modified Signed Digit Adder Using Polarization-Coded Symbolic Substitution , 1987 .

[6] Nasser N Peyghambarian,et al. Symbolic Substitution Using ZnS Interference Filters , 1987 .

[7] Stanley L. Hurst,et al. Multiple-Valued Logic—its Status and its Future , 1984, IEEE Transactions on Computers.

[8] T B Henderson,et al. Modified signed-digit addition and subtraction using optical symbolic substitution. , 1986, Applied optics.

[9] Kenneth C. Smith. The Prospects for Multivalued Logic: A Technology and Applications View , 1981, IEEE Transactions on Computers.