基于三角形结构计算GRM展开系数的新算法  

New algorithm of the evaluation of generalized Reed-Muller coefficients based on triangle module

作　　者：姚茂群[1] 陈偕雄[2] 

机构地区：[1]杭州师范学院信息科学与工程学院,浙江杭州310012 [2]浙江大学信息与电子工程学系,浙江杭州310028

出　　处：《浙江大学学报（理学版）》2008年第5期538-540,545,共4页Journal of Zhejiang University（Science Edition）

基　　金：浙江省自然科学基金资助项目(Y104368)

摘　　要：分析了单变量、两变量和n变量逻辑函数GRM展开系数的递推三角形结构,相应的三角形的左边或右边表示某固定极性下的GRM展开系数.进一步分析表明极性为q的GRM展开系数即为自上向下由各行脚标中含q的项.在此基础上提出了基于三角形结构计算GRM展开系数的新算法.与已有算法相比,本文提出的算法在速度上优于其他算法.The recursive triangle modules of the Generalized Reed Muller（GRM） expansion coefficients for the single variable, two-variable and n-variable logic functions were analyzed. The GRM expansion coefficients with q polarity were formed by the left or right sides of the corresponding triangle cells, and may be also formed by the terms containing q in the subscript of ci in each line. Based on it, a new algorithm of the evaluation of the GRM expansion coefficients with fixed polarity based upon the triangle module was presented. The comparison result showed that this algorithm is faster than other ones in references.

关 键 词：三角形结构 GRM展开 固定极性 最小化技术 

分 类 号：TP17[自动化与计算机技术—控制理论与控制工程]