EFFICIENT ALGORITHM FOR CANONICAL REED-MULLER EXPANSIONS OF BOOLEAN FUNCTIONS

被引：34

作者：

HARKING, B

机构：

[1] Univ Dortmund, Dortmund

来源：

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES | 1990年 / 137卷 / 05期

关键词：

D O I：

10.1049/ip-e.1990.0045

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The paper presents a new method for computing all 2n canonical Reed-Muller forms (RMC forms) of a Boolean function. The method constructs the coefficients directly and no matrix-multiplication is needed. It is also usable for incompletely specified functions and for calculating a single RMC form. The method exhibits a high degree of parallelism.

引用

页码：366 / 370

页数：5

共 12 条

[1]

AKERS SB, 1959, J SOC IND APPL MATH, V7, P487

[2] EFFICIENT COMPUTER METHOD FOR EXOR LOGIC DESIGN [J].

BESSLICH, PW .

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1983, 130 (06) :203-206

[3]

BESSLICH PW, 1986, 2ND INT S SPECTR TEC

[4]

BIOUL G, 1973, PHILIPS RES REP, V28, P17

[5] ON MINIMAL MODULO 2 SUMS OF PRODUCTS FOR SWITCHING FUNCTIONS [J].

EVEN, S ;

KOHAVI, I ;

PAZ, A .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (05) :671-&

[6] INATENESS PROPERTIES OF AND-EXCLUSIVE-OR LOGIC CIRCUITS [J].

FISHER, LT .

IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (02) :166-172

[7]

FLEISHER H, 1987, IEEE T COMPUT, V36, P247, DOI 10.1109/TC.1987.1676890

[8] REED-MULLER EXPANSIONS OF INCOMPLETELY SPECIFIED FUNCTIONS [J].

GREEN, DH .

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1987, 134 (05) :228-236

[9] EASILY TESTABLE REALIZATIONS FOR LOGIC FUNCTIONS [J].

REDDY, SM .

IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (11) :1183-+

[10] AREA-TIME TRADEOFFS FOR MATRIX MULTIPLICATION AND RELATED PROBLEMS IN VLSI MODELS [J].

SAVAGE, JE .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (02) :230-242

← 1 2 →