GENERALIZED PARTIALLY-MIXED-POLARITY REED-MULLER EXPANSION AND ITS FAST COMPUTATION

Authors
WU HM PERKOWSKI MA ZANG XQ ZHUANG N
Citation
Hm. Wu et al., GENERALIZED PARTIALLY-MIXED-POLARITY REED-MULLER EXPANSION AND ITS FAST COMPUTATION, I.E.E.E. transactions on computers, 45(9), 1996, pp. 1084-1088
Citations number
17
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
45
Issue
9
Year of publication
1996
Pages
1084 - 1088
Database
ISI
SICI code
0018-9340(1996)45:9<1084:GPREAI>2.0.ZU;2-H
Abstract
Generalized Partially-Mixed-Polarity Reed-Muller (GPMPRM) expansion, a canonical subfamily of Exclusive Sum of Products (ESOP), is presented . An efficient algorithm in two-dimensional data flow is proposed for computation of the GPMPRM forms. MCNC benchmark experimental results s how that the minimal GPMPRM forms of these functions, on the average, have similar number of terms to their Sum of Products (SOP) counterpar ts while there are many functions for which the GPMPRM circuits are mu ch smaller.