Photonic Computing Using The Modified Signed-Digit Number Representation

Drake, Barry; Bocker, Richard P.; Lasher, Mark; Patterson, Richard H.; Miceli, William J.

doi:10.1117/12.7973778

Cited by 124 publications

(34 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…No light ray is incident on M 2 . Light ray with vertically polarized light only will be incident on M 3 . P 3 will receive no electrical signal and P 4 will receive signal with high voltage.…”

Section: Figure 5 Optical Quadruple Not Gate Using New Quadruple Unimentioning

confidence: 99%

See 1 more Smart Citation

Optical New Quadruple Universal Gate (QUG) using SLM Based Savart Plate

2018

IJMTER

View full text Add to dashboard Cite

Abstract-The advantages of technology during the last two decades have generated a large demand for handling large volumes of data at high speed. To meet up the requirements, the concept of multi valued logic (MVL) came forward from the status of the two-valued or binary logic system in the one hand and on the other, these include the idea of optical processor for switches. The conventional binary system has reached its saturation point in terms of complexity and data-handling. MVL system consists of a number of intermediate states between the true and false state instead of the conventional binary logic which consists of only two states "true" and "false". In quadruple valued logic (QVL) system the additional two intermediate states are denoted as "partially known" and "partially unknown". In this paper we have designed and implemented Optical New Quadruple Universal Gate (QUG) using Spatial Light Modulator (SLM) and Savart Plate. We have also explained their principles of operation used a theoretical model to fulfill this task, finally confirming through numerical simulations.

show abstract

Section: Figure 5 Optical Quadruple Not Gate Using New Quadruple Unimentioning

confidence: 99%

“…The Avizienis introduced a signed digit number as the parallelism of optical beam [2]. The modified signed digit [3][4][5] or modified trinary [6][7][8] number system also suggested the carry free operation. However, the ternary logic system based on three states was introduced by Lukasiewicz [9].…”

Section: Introductionmentioning

confidence: 99%

Optical New Quadruple Universal Gate (QUG) using SLM Based Savart Plate

2018

IJMTER

View full text Add to dashboard Cite

show abstract

“…However, a conventional binary system limits computation speed because of its strong interdigit dependency due to carry propagation from the least-significant-bit position to the most-significant-bit position. Consequently, various parallel algorithms, especially those using signed-digit ͑SD͒ number representations, [1][2][3][4][5][6][7][8][9][10][11][12] have been developed in the past two decades to overcome the problem. The redundant nature of the SD representations enables addition of two arbitrary-length operands to be completed in less than three steps.…”

Section: Introductionmentioning

confidence: 99%

“…The redundant nature of the SD representations enables addition of two arbitrary-length operands to be completed in less than three steps. 1 Modified signed-digit ͑MSD͒, a subset of the SD representations, employs the digit set ͕1 ,0,1͖, where 1 denotes −1. Various carry-free MSD addition algorithms have been reported, and they are usually classified in terms of the involved step number, i.e., three-step, two-step, and onestep algorithms.…”

Section: Introductionmentioning

confidence: 99%

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

Qian

Karim

2005

Opt. Eng

View full text Add to dashboard Cite

Abstract.A two-step digit-set-restricted modified signed-digit ͑MSD͒ adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into ͕1 ,0͖ and ͕0,1͖, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration.

show abstract

“…Until now, all the suggested methods to encode bipolar numbers can be divided into three categories: 112 biasing, 16 122 separating positive and negative numbers with multiplexing techniques such as time multiplexing, 17 space and frequency multiplexing, 18 and 132 bipolar number representation. [19][20][21][22] For high-speed computation the third class is optimal because the architecture may be a fully parallel one; in addition, it needs no data correction, no storage and combination of the intermediate result, and thus the least preprocessing and postprocessing. In this class, twos-complement binary encoding was extensively utilized and a detailed algorithm can be found in Refs.…”

Section: Introductionmentioning

confidence: 99%

Modified direct twos-complement parallel array multiplication algorithm for complex matrix operation

Liu

Shao

et al. 1995

Appl. Opt.

View full text Add to dashboard Cite

A direct twos-complement parallel array multiplication algorithm is introduced and modified for digital optical numerical computation. The modified version overcomes the problems encountered in the conventional optical twos-complement algorithm. In the array, all the summands are generated in parallel, and the relevant summands having the same weights are added simultaneously without carries, resulting in the product expressed in a mixed twos-complement system. In a two-stage array, complex multiplication is possible with using four real subarrays. Furthermore, with a three-stage array architecture, complex matrix operation is straightforwardly accomplished. In the experiment, parallel two-stage array complex multiplication with liquid-crystal panels is demonstrated.

show abstract

Photonic Computing Using The Modified Signed-Digit Number Representation

Cited by 124 publications

References 12 publications

Optical New Quadruple Universal Gate (QUG) using SLM Based Savart Plate

Optical New Quadruple Universal Gate (QUG) using SLM Based Savart Plate

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

Modified direct twos-complement parallel array multiplication algorithm for complex matrix operation

Contact Info

Product

Resources

About