Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees

DOI10.1109/TC.1979.1675398MaRDI QIDQ4198636zbMATH OpenOpenAlexFDO

Authors H. Allen Curtis

Publication date 1979

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1979.1675398

zbMATH Keywords

incomplete Boolean functionsirredundant coversNAND arraysNAND tree circuits

Mathematics Subject Classification ID

Recommendations

• On the synthesis of NAND or NOR networks having multi-level
• Characterization of all optimal networks for a simultaneous computation of AND and NOR
• Graph-Based Algorithms for Boolean Function Manipulation
• Complementary Function Approach to the Synthesis of Three-Level NAND Network
• scientific article; zbMATH DE number 4096781

This page was built for publication: Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198636)