Manipulation and optimisation techniques for Boolean logic

In this study, new techniques and algorithms are presented for the derivation and optimisation of mixed polarity Reed Muller (MPRM) and mixed polarity dual Reed Muller (MPDRM) functions. The first algorithm is used for bidirectional conversion between fixed polarity dual Reed Muller (FPDRM) and MPDRM and to derive any polarity from another polarity. The second algorithm is used to generate reduced MPDRM expressions from FPDRM using a new procedure based on tabular techniques. The third algorithm is proposed for bidirectional conversion between sum of products (SOP)/product of sums (POS) and MPRM/MPDRM forms, respectively. It can also be used to derive any mixed polarity from another MPRM/MPDRM. The last algorithm is to find optimal MPRM/MPDRM among 3n different polarities using genetic algorithm (GA) for large functions but without generating all the polarity sets. The proposed algorithms are efficient in terms of memory size and CPU time and can be used for large functions. Experimental results are given using a personal computer with an Intel CPU of 2.4 GHz and 2 GB RAM. All algorithms are implemented using C and fully tested with benchmark examples.

[1]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[2]  Lingli Wang,et al.  Efficient polarity conversion for large Boolean functions , 1999 .

[3]  Marko Čepin Binary Decision Diagram , 2011 .

[4]  A.E.A. Almaini,et al.  Tabular techniques for generating Kronecker expansions , 1996 .

[5]  Rolf Drechsler,et al.  Exact minimisation of Kronecker expressions for symmetric functions , 1996 .

[6]  Decomposition of LC two-ports to obtain network system matrix , 1998 .

[7]  Maki K. Habib A new approach to generate fixed-polarity Reed–Muller expansions for completely and incompletely specified functions , 2002 .

[8]  Rolf Drechsler,et al.  A genetic algorithm for RKRO minimization , 1997 .

[9]  D. Green Reed-Muller canonical forms with mixed polarity and their manipulations , 1990 .

[10]  Jianping Hu,et al.  Novel Synthesis and Optimization of Multi-Level Mixed Polarity Reed-Muller Functions , 2005, Journal of Computer Science and Technology.

[12]  A. E. A. Almaini,et al.  Optimal expression for fixed polarity dual Reed-Muller forms. , 2007 .

[13]  P. Thomson,et al.  Tabular techniques for Reed—Muller logic , 1991 .

[14]  T. Sasao,et al.  GRMIN2: A heuristic simplification algorithm for generalised Reed-Muller expressions , 1996 .

[15]  Neil Urquhart,et al.  Optimization of MPRM functions using tabular techniques and genetic algorithms. , 2008 .

[16]  A. E. A. Almaini,et al.  Minimization of dual Reed-Muller forms using dual property. , 2007 .

[17]  D. Green Dual forms of Reed-Muller expansions , 1994 .

[18]  L. Wang,et al.  Exact minimization of large fixed polarity dual form of reed-muller functions , 2006, 2006 8th International Conference on Solid-State and Integrated Circuit Technology Proceedings.

[19]  E. C. Tan,et al.  Fast tabular technique for fixed-polarity Reed-Muller logic with inherent parallel processes , 1998 .

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

[21]  Tsutomu Sasao,et al.  Logic Synthesis and Optimization , 1997 .