A Galois field-based logic synthesis with testability

In deep-submicron very-large-scale integration (VLSI) systems, efficient circuit testability is one of the most demanding requirements. An automatic synthesis technique for designing efficiently testable logic circuits is one of the ways to tackle the problem. To this end, this study introduces the generalised theory and a new fast efficient graph-based decomposition technique for the functions over finite fields defined over the set GF(N), where N is a power of a prime number, which utilises the data structure of the multiple-output decision diagrams. In particular, the proposed technique can decompose any N valued arbitrary function over the fields conjunctively and disjunctively. The proposed technique is capable of generating testable circuits. The experimental results show that the proposed method is more economical in terms of literal count compared to the existing approaches. Furthermore, the authors have shown that the basic block can be tested with only eight test vectors.

[1]  M. Anwar Hasan,et al.  Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.

[2]  Valeria Bertacco,et al.  The disjunctive decomposition of logic functions , 1997, ICCAD 1997.

[3]  Shin-ichi Minato,et al.  Fast factorization method for implicit cube set representation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Dhiraj K. Pradhan.  A Theory of Galois Switching Functions , 1978, IEEE Transactions on Computers.

[5]  Carl Sechen,et al.  Boolean division and factorization using binary decision diagrams , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Bernd Steinbach,et al.  Decomposition of multi-valued functions into min- and max-gates , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.

[7]  S. Wicker.  Error Control Systems for Digital Communication and Storage , 1994 .

[8]  Dhiraj K. Pradhan,et al.  Constant Function Independent Test Set for Fault Detection in Bit Parallel Multipliers in GF(2^m) , 2007, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07).

[9]  Dhiraj K. Pradhan,et al.  A Galois Field Based Logic Synthesis Approach with Testability , 2008, 21st International Conference on VLSI Design (VLSID 2008).

[10]  Rolf Drechsler,et al.  Synthesis of fully testable circuits from BDDs , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Richard E. Blahut.  Fast Algorithms for Signal Processing and Error Control , 1985 .

[12]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[13]  Munehiro Matsuura,et al.  A method to decompose multiple-output logic functions , 2004, Proceedings. 41st Design Automation Conference, 2004..

[14]  Adnan Aziz,et al.  Area-oriented synthesis for pass-transistor logic , 1998, Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273).

[15]  K. Karplus.  REPRESENTING BOOLEAN FUNCTIONS WITH IF-THEN-ELSE DAGs , 1988 .

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

[17]  Giovanni De Micheli,et al.  Algorithms for technology mapping based on binary decision diagrams and on Boolean operations , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Dhiraj K. Pradhan,et al.  A Technique for Representing Multiple Output Binary Functions with Applications to Verification and Simulation , 2007, IEEE Transactions on Computers.

[19]  M. Ciesielski,et al.  BDS: a BDD-based logic optimization system , 2000, Proceedings 37th Design Automation Conference.

[20]  Maciej J. Ciesielski,et al.  BDD decomposition for efficient logic synthesis , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[21]  R. Brayton,et al.  Software synthesis from synchronous specifications using logic simulation techniques , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[22]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[23]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.