Abstract
An algorithm is presented for the synthesis of combinational networks with a constrained arrangement of ANDs, ORs, NANDs, NORs, and inverters. The algorithn is easily presented to students in an introductory logic design course and has considerable application in modem practical logic design. Many texts available for a first course in logic design give very limited practical guidance for synthesis of networks under constraints outlined here. It is suggested that the algorithm presented here be furnished as supplementary material in the introductory course.
Full Text
Published Version
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