Self-dual diamond-graph CMOS H-bridge logic family

The self-dual graph is a beautiful topic in graph theory. Based on DeMorgan's theorem, all CMOS circuits are series-parallel graphs. Thus self-dual graphs are few in CMOS circuits. The paper reveals a self-dual diamond-graph CMOS H-bridge circuit family, and then displays the characteristics an...

Full description

Saved in:
Bibliographic Details
Published in2016 29th IEEE International System-on-Chip Conference (SOCC) pp. 300 - 305
Main Author Shun-Wen Cheng
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2016
Subjects
CMOS logic
Diamond
discrete mathematics
Graph theory
integrated circuits
Inverters
logic design
Logic gates
MOS devices
Signal generators
VLSI
Online AccessGet full text

Cover

More Information
Summary:The self-dual graph is a beautiful topic in graph theory. Based on DeMorgan's theorem, all CMOS circuits are series-parallel graphs. Thus self-dual graphs are few in CMOS circuits. The paper reveals a self-dual diamond-graph CMOS H-bridge circuit family, and then displays the characteristics and properties of the self-dual graphs on CMOS circuits. A basic diamond graph makes an H-bridge on the circuit. A complementary H-bridge which exists separately in p-tree or n-tree can construct various series or parallel forms for different functions. Because of the structure duality, all self-dual graph CMOS circuits can produce symmetric AOI and OAI functions, and the number of AOI and OAI functions is equal. For example, if a self-dual graph CMOS circuit can build AOI422 function, the circuit must also can make OAI422 function. Thus the self-dual graph CMOS circuits can realize symmetric function generators. Due to the above features, the self-dual graph CMOS circuits are suitable for intelligent signal processing and configurable computing.
ISSN:2164-1706
DOI:10.1109/SOCC.2016.7905496