中文摘要：

为了改善生成Reed-Muller展开式的灵活性,提出了基于RSE范式的Reed-Muller展开式算法.根据将析取主范式转化为Ring-Sum-Expansion范式的过程,先使用真值表输入项构造预处理表,再从真值表中抽取使输出项为真的二进制码,通过预处理表直接解出每一个输出项的Reed-Muller展开式.对算法进行复杂度分析比较表明,与通常所用的GRM递归算法和GRM矩阵相乘Reed-Muller展开式算法相比,该算法在生成展开式时具有更好的灵活性,可以单独生成指定输出项的Reed-Muller展开式,不同于常用算法必须要一次生成全部输出项的Reed-Muller展开式.

英文摘要：

In order to improve the agility of the Reed-Muller expansion algorithm,Reed-Muller expansion algorithm based on Ring-Sum-Expansion is presented.According to the process of transforming Disjunctive-Normal-Form into Ring-Sum-Expansion,the input of the true table is used to build pretreatment table firstly.Secondly,binary code is extracted from the input which makes the output true of the true table.Finally,Reed-Muller expansion can be solved respectively according to the binary code and the pretreatment.The complexity of the algorithm is analyzed and compared with other algorithms.The results show that compared with current GRM（generalized Reed-Muller expressions） recursion algorithm and GRM matrix algorithms,the proposed algorithm has more agility.It can create appointed output variable＇s Reed-Muller expansion separately which current algorithms can not do.