FPRM Conversion Using Parallel Tabular Technique with Disjointed Products

With the deficiency of the published tabular techniques based algorithms which can only handle small functions in the conversion from AND/OR forms to the Fixed Polarity Reed-Mull (FPRM) forms, a novel parallel tabular technique using the disjoint products is proposed. By utilizing the disjointed products, the proposed algorithm is able to avoid the rapid increase of the minterms which leads the reported tabular technique based algorithms cannot run efficiently or even out of work. Furthermore, unlike the published algorithm for the large functions conversion, the circuit structure in progress has little effect on the performance of the proposed algorithm. The proposed algorithm is implemented in C language and tested under MCNC benchmarks. The experimental results show that the proposed algorithm can finish the polarity conversion fast for the larger circuits and the speed of the algorithm does not depend on the number of inputs of the circuits but the number of the disjointed products.