基于不相交项并行列表技术的FPRM实现

FPRM Conversion Using Parallel Tabular Technique with Disjointed Products

针对传统列表技术在逻辑函数从AND/OR形式转化成固定极性Reed-Muller(FPRM)过程中只能处理小规模电路的不足,该文提出一种基于不相交乘积项的并行列表技术。该技术能有效避免转化算法因逻辑函数输入变量增加引起最小项数量激增而导致效率低下甚至无法工作这种情况。另外,不同于已发表的用于实现大电路的转化算法,待处理的电路结构对该方法的性能影响很小。提出的算法用C语言编程实现,并用MCNC标准电路进行测试。实验结果表明所提算法可以对更大规模电路实现快速FPRM转换,并且算法速度对电路输入个数不敏感,但与待处理逻辑函数的不相交乘积项的数量有关。

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.