Universal CMOS Diamond-Graph Circuit for Embedded Computing

A basic diamond graph makes an H-bridge on the circuit. A complementary H-bridge exists separately in p-tree or n-tree can construct various series or parallel forms for different functions. The paper successfully builds retrograde and hierarchical self-dual diamond-graph CMOS H-bridge circuits. Compare with conventional L UTs and multiplexer-based universal circuits, the proposed diamond-graph CMOS circuits use fewer transistors and power to construct various functions. And the proposed circuit has neither the threshold drop problem nor the transistor chain charge/discharge path problem. The retrograde and hierarchical diamond-graph circuit can effectively implement three-input universal functions, and many complex functions, and the proposed layout module is regular and compact. The diamond-graph circuit family should be suitable for embedded AI edge computing and intelligent signal processing.