Circuit schematic generation and optimization in VLSI circuits

We present a novel methodology converting Boolean expressions into circuit schematic directly such that the number of transistors is minimized. Three algorithms are developed to help this conversion. Here the pull-up/pull-down complementary circuit and transmission gate are investigated in the design procedure. The novel circuit schematic combining the above structures is developed to minimize the number of transistors. Note that the number of transistors effects on the layout area, power dissipation and overall performance in circuit design.

[1]  Tadeusz Luba,et al.  Decomposition of Boolean Functions Specified by Cubes , 2003, J. Multiple Valued Log. Soft Comput..

[2]  Sergiu Rudeanu Boolean functions and equations , 1974 .

[3]  Valeria Bertacco,et al.  Boolean function representation using parallel-access diagrams , 1996, Proceedings of the Sixth Great Lakes Symposium on VLSI.

[4]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[5]  Lech Jozwiak,et al.  Functional Decomposition based on Information Relationship Measures Extremely Effective and Efficient for Symmetric Functions. , 1999 .

[6]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.