Abstract

It has been shown previously that ternary functions can be constructed from binary elements. The paper proposes the application of Boolean algebra to a generalised procedure for the design of 3-valued functions using binary elements. The final logical layout is essentially symmetrical and uses complementary electronic devices. Component tolerance is the same as that for a binary system. The particular ternary functions chosen for discussion are modulo-3 addition and carry, using +1, 0 and ?1 as the arithmetic states.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.