×

A search and decomposition algorithm for RM logic implementation. (Chinese. English summary) Zbl 1289.94090

Summary: Aiming at the deficiency of the published algorithms in searching and extracting the sub-cover suitable for Reed-Muller (RM) logic implementation in the cover of a logic function, an algorithm based on the disjointed cubes is proposed. By searching the majority cubes of the disjointed cubes and checking the results of the bit-wise operation of the cubes, the whole cover of the function is divided into two sub-covers, one for RM logic implementation and the other for the traditional Boolean logic implementation. The proposed algorithm is implemented using C programming and tested with MCNC benchmarks. Compared to the reported methods, the searching capacity of the proposed algorithm is extended and its computing efficiency is improved. Furthermore, the number of variables of the function has little effect on the speed of the proposed algorithm.

MSC:

94C05 Analytic circuit theory
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
PDFBibTeX XMLCite