Abstract

There is discussion of a technique of using multi-level logic synthesis to design pass transistor logic (PTL) based on algebraic factorisation. Techniques already applied to conventional AND-OR type networks are shown to be not useful for factorisation of PTL networks. Starting with the set of all prime pass implicants, the steps of selecting a cover and factorising a function, using a greedy heuristic, are combined. From many examples using MCNC benchmark circuits, the algorithm achieves a considerable improvement (an average of 14% and up to 50% savings) over PTL circuits obtained from conventional two-level design methods.

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.