Efficient RM conversion algorithm for large multiple output functions
RM (Reed-Muller) expansions have shown advantages compared with the traditional SOP (Sum-of-Products) forms in the areas of arithmetic logic,reversible logic synthesis and Boolean quantum circuit design. A new algorithm is presented for the conversion between SOP and RM forms of multiple output functions. This procedure is based on the cube set expressions and therefore independent on number of input variables. A verification method is also proposed to make sure the algorithm is correct. The experimental results show that the conversion algorithm is effective in terms of time for very large Boolean functions up to 199 inputs and 67 outputs.
Xiao-ying Zhang Ling-li Wang Xue-gong Zhou
State Key Laboratory of ASIC & System,Fudan University,Shanghai 201203,P.R.China
国际会议
9th International Conference on Solid-State and Integrated-Circuit Technology(第9届固态和集成电路国际会议)
北京
英文
2300-2303
2008-10-20(万方平台首次上网日期,不代表论文的发表时间)