DocumentCode :
980560
Title :
Cellular automata based scheme for solution of Boolean equations
Author :
Bhattacharjee, S. ; Sinha, S. ; Chattopadhyay, C. ; Chaudhu, P.P.
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
Volume :
143
Issue :
3
fYear :
1996
fDate :
5/1/1996 12:00:00 AM
Firstpage :
174
Lastpage :
180
Abstract :
The paper utilises a particular class of nongroup CA as a mathematical tool to derive solutions of XOR dominated Boolean equations. Some problems in digital circuits (such as logic synthesis, test pattern generation etc.) demand efficient schemes for the solution of Boolean equations. A large number of combinational benchmarks and real life circuits used in the fields of built in self test (BIST) structures, cryptography, error correcting codes etc. Can be found to have dominance of such XOR functionality. The proposed scheme is suited to such XOR dominated circuits. A comparison between the execution time of the proposed method and popular schemes based on tabular algebra shows a maximum speedup of up to ten times. In the worst case, the performance of the algorithm presented is equivalent to that of tabular algebra, which is inescapable since the problem is inherently NP hard
Keywords :
Boolean functions; built-in self test; cellular automata; computational complexity; digital circuits; logic CAD; BIST; Boolean equations; NP hard; XOR dominated Boolean equations; XOR dominated circuits; built in self test structures; cellular automata based scheme; combinational benchmarks; cryptography; digital circuits; error correcting codes; execution time; logic synthesis; mathematical tool; maximum speedup; nongroup CA; on time; real life circuits; tabular algebra; test pattern generation;
fLanguage :
English
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
Publisher :
iet
ISSN :
1350-2387
Type :
jour
DOI :
10.1049/ip-cdt:19960381
Filename :
503288
Link To Document :
بازگشت