AND-XOR Network Synthesis with Area-Power Trade-off

As AND-XOR network results in much better realization and requires fewer product terms than AND-OR realization, it network has encouraged researchers to look for efficient minimization and synthesis tools for their realization. Among several canonical representations of AND-XOR networks, popular and most testable one is the fixed polarity Reed Muller (FPRM) form. In this paper we have used GA (genetic algorithm) to select the polarities of the variables of the AND-XOR network. The polarity is selected based on the optimization of area, dynamic power and leakage power of the resulting circuit. This is the first ever effort to incorporate leakage power consideration in the variable polarity selection process. Here, we have presented new leakage power model of AND, OR and XOR gates at 90nm technology. The area (in terms of number of product terms) results obtained are superior to those reported in the literature. It also enumerates the trade-offs present in the solution space for different weights associated with area, dynamic power and leakage power of the resulting AND-XOR network.

[1]  Tsutomu Sasao EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Elena Dubrova,et al.  AOXMIN-MV: A Heuristic Algorithm for AND-OR-XOR Minimization , 1999 .

[3]  Santanu Chattopadhyay,et al.  Synthesis of Highly Testable Fixed-Polarity AND-XOR Canonical Networks-A Genetic Algorithm-Based Approach , 1996, IEEE Trans. Computers.

[4]  Marek A. Perkowski,et al.  Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[5]  Suman Purwar An Efficient Method of Computing Generalized Reed-Muller Expansions from Binary Decision Diagram , 1991, IEEE Trans. Computers.

[6]  D. H. Green Reed-Muller expansions of incompletely specified functions , 1987 .

[7]  Tsutomu Sasao Easily Testable Realizations for Generalized Reed-Muller Expressions , 1997, IEEE Trans. Computers.

[8]  Kaushik Roy,et al.  Low-Power CMOS VLSI Circuit Design , 2000 .

[9]  S. Aborhey Reed-Muller tree-based minimisation of fixed polarity Reed-Muller expansions , 2001 .

[10]  Tsutomu Sasao,et al.  Minimization of AND-OR-EXOR Three-Level Networks with AND Gate Sharing (Special Issue on Synthesis and Verification of Hardware Design) , 1997 .

[11]  Tsutomu Sasao,et al.  On the complexity of mod-2l sum PLA's , 1990 .

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

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  P.W. Besslich,et al.  An efficient program for logic synthesis of mod-2 sum expressions , 1991, Euro ASIC '91.

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

[16]  Md. Mozammel Huq Azad Khan and Md. Shamsul Alam Mapping of fixed polarity Reed-Muller coefficients from minterms and the minimization of fixed polarity Reed-Muller expressions , 1997 .

[17]  Kaushik Roy,et al.  Intrinsic leakage in deep submicron CMOS ICs-measurement-based test solutions , 2000, IEEE Trans. Very Large Scale Integr. Syst..

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

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

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

[21]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[22]  Tsutomu Sasao,et al.  An optimization of AND-OR-EXOR three-level networks , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.