Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.