One-step optical trinary signed-digit arithmetic using redundant bit representations

A simple one-step fully parallel trinary signed-digit arithmetic is proposed for parallel optical computing. This technique performs multidigit carry-free addition and borrow-free subtraction in constant time. The trinary signed-digit arithmetic operations are based on redundant bit representation of the digits. Optical implementation of the proposed arithmetic can be carried out using correlation or matrix multiplication based schemes. An efficient matrix multiplication based optical implementation that employs a fixed number of minterms for any operand length is developed. It is shown that only 30 minterms (less than recently reported techniques) are enough for implementing the one-step trinary addition and subtraction.