Multilevel logic synthesis for arithmetic functions

The arithmetic functions, as a subclass of Boolean functions, have very compact descriptions in the AND and XOR operators. Any n-bit adder is a prime example. This paper presents a multilevel logic synthesis method which is particularly suited for arithmetic functions and utilizes their natural representations in the field GF(2). Algebraic factorization is performed to reduce the literal count. A direct translation of the AND/XOR representations of arithmetic functions into multilevel networks often results in excessive area, mainly due to the large area cost of XOR gates. We present a process of redundancy removal which reduces many XOR gates to single AND or OR gates without altering the functional behavior of the network. The redundancy removal process requires only to simulate a small and decidable set of primary input patterns. Preliminary results show that our method produces circuits, before and after technology mapping, with area improvement averaging 17% when compared to Berkeley SIS 1.2. The run time is reduced by at least 50%. The resulting circuits also have good testability and power consumption properties.

[1]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[2]  SUDHAKAR M. REDDY,et al.  Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.

[3]  Wolfgang Rosenstiel,et al.  Multilevel logic synthesis based on functional decision diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.

[4]  Sharad Malik,et al.  A synthesis-based test generation and compaction algorithm for multifaults , 1991, 28th ACM/IEEE Design Automation Conference.

[5]  Tsutomu Sasao.  And-Exor Expressions and their Optimization , 1993 .

[6]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[7]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[8]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[9]  Yuri Breitbart,et al.  The Computational Complexity of a Class of Minimization Algorithms for Switching Functions , 1979, IEEE Transactions on Computers.

[10]  Rolf Drechsler,et al.  Synthesis for testability: circuits derived from ordered Kronecker functional decision diagrams , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[11]  S. M Reddy,et al.  Easily testable realizations for logic functions , 1973 .

[12]  Jean-Pierre Deschamps,et al.  Discrete and switching functions , 1978 .

[13]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[14]  Malgorzata Marek-Sadowska,et al.  Logic Synthesis for Testability , 1996, Great Lakes Symposium on VLSI.

[15]  Wolfgang Rosenstiel,et al.  Efficient graph-based computation and manipulation of functional decision diagrams , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[16]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Tsutomu Sasao.  Logic Synthesis with Exor Gates , 1993 .

[18]  Malgorzata Marek-Sadowska,et al.  Minimisation of fixed-polarity AND/XOR canonical networks , 1994 .

[19]  M. Perkowski,et al.  Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation , 1993 .