An algorithm for reed-muller extraction

A novel algorithm is proposed to detect a function whether it can be implemented by Pure Reed-Muller (PRM) logic or not in this paper. Compared with those published algorithms, the proposed algorithm has no limitation of the number of input variables and can finish judgment and give PRM expression at the same time. The result of testing under MCNC benchmarks shows our algorithm works well and can simplify some functions largely by expressed as PRM.