This Article 
 Bibliographic References 
 Add to: 
Innovative Structures for CMOS Combinational Gates Synthesis
April 1994 (vol. 43 no. 4)
pp. 385-399

Design of multiple outputs CMOS combinational gates is studied. Two techniques for minimization of multiple output functions at the switching level are introduced. These techniques are based on innovative transistor interconnection structures named Delta and Lambda networks. The two techniques can be combined together to obtain further area reductions. Different synthesis algorithms are discussed, from exhaustive enumeration to branch and bound to heuristic techniques allowing to speed up the synthesis process. Simulation results for synthesis are introduced to compare the different algorithms. Design examples are also provided. Electrical simulations show that the dynamic behavior of such structures is comparable to the traditional static or domino implementations (obviously the new and traditional structures have the same static behavior).

[1] D. Brand, "Logic synthesis," inDesign Systems for VLSI Circuits, G. De Micheli, A. Sangiovanni-Vincentelli, and P. Antognetti, Eds. Norwell, MA: Martinus Nijhoff, 1987.
[2] J. A. Darringer, W. H. Joyner, C. L. Berman, and L. Trevillyan, "Logic synthesis through local transformations,"IBM J. Res. Develop., vol. 25, no. 4, pp. 272-280, July 1981.
[3] F. E. Hohn, "A matrix method for the design of relay circuits,"IRE Trans. Circuit Theory, pp. 154-161, June 1955.
[4] R. E. Miller, "Formal analysis and synthesis of bilateral switching networks,"IRE Trans. Electron. Comput., pp. 231-244, Sept. 1958.
[5] B. Gurunath and N. N. Biswas, "BANGALORE: An algorithm for the optimal minimization of programmable logic arrays,"Int. J. Electron., vol. 60, pp. 709-725, June 1986.
[6] K. Goto, "Five methods for simplification of logic function and comparison of their characteristics," inProc. IEEE ISCAS 1990, pp. 1122-1125.
[7] R. L. Rudell and A. L. M. Sangiovanni-Vincentelli, "ESPRESSO-MV: Algorithms for multiple-valued logic minimization," inProc. IEEE 1985 Custom Integrated Circuits Conf., May 1985, pp. 230-234.
[8] M. R. Dagenais, V. K. Agarwal, and N. C. Rumin, "McBOOLE: A new procedure for exact logic minimization,"IEEE Trans. Comput.-Aided Design, vol. CAD-5, pp. 229-237, Jan. 1986.
[9] J.A. Stankovic and K. Ramamritham, "The Design of the Spring Kernel,"Proc. Real-Time Systems Symp., IEEE Computer Society Press, Los Alamitos, Calif., 1987, pp. 146-157.
[10] B. Gurunath and N. N. Biswas, "An algorithm for multiple output minimization," inProc. IEEE ICCAD 1987, pp. 74-77.
[11] S. J. Hong, R. G. Cain, and D. L. Ostapko, "MINI: A heuristic approach for logic minimization,"IBM J. Res. Develop., vol. 18, no. 5, pp. 443-458, Sept. 1974.
[12] A. J. de Geus and W. Cohen, "A rule-based system for optimizing combinational logic,"IEEE Design Test Comput., vol. 2, pp. 22-32, Aug. 1985.
[13] M. Annaratone,Digital CMOS Circuit Design. Boston, MA: Kluwer Academic, 1986.
[14] G. Buonanno, D. Sciuto, and R. Stefanelli, "Optimization techniques for multiple output function synthesis," inProc. IEEE EDAC '91, Amsterdam, The Netherlands, Feb. 1991, pp. 545-551.
[15] G. Buonanno, D. Sciuto, and R. Stefanelli, "Innovative structures for CMOS combinational gates synthesis," Dept. Electron., Politecnico di Milano, Intern. Rep., Nov. 1991.

Index Terms:
logic design; logic gates; combinatorial circuits; minimisation of switching nets; CMOS integrated circuits; CMOS combinational gates; combinational gates synthesis; transistor interconnection structures; Lambda networks; Delta networks; synthesis algorithms; exhaustive enumeration; branch and bound; heuristic techniques; Combinatorial gates; multiple outputs functions; logic synthesis; CMOS gates; area minimization; delay analysis.
G. Buonanno, D. Sciuto, R. Stefanelli, "Innovative Structures for CMOS Combinational Gates Synthesis," IEEE Transactions on Computers, vol. 43, no. 4, pp. 385-399, April 1994, doi:10.1109/12.278478
Usage of this product signifies your acceptance of the Terms of Use.