Name
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 show that the minimal GPMPRM forms of these functions, on the average, have similar number of terms to their sum of products (SOP) counterparts while there are many functions for which the GPMPRM circuits are much smaller |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/12.537134 | Computers, IEEE Transactions |
Keywords | Field | DocType |
gray codes,fast computation,exclusive sum of products,reed-muller codes,similar number,exclusive sum,minimisation of switching nets,gpmprm circuit,efficient algorithm,canonical subfamily,two-dimensional data flow,generalized partially-mixed-polarity reed-muller expansion,generalized partially-mixed-polarity reed-muller,mcnc benchmark experimental result,gpmprm form,minimal gpmprm form,boolean functions,sum of products,logic circuits,field programmable gate arrays,gray code,data flow,reed muller codes,linear circuits | Boolean function,Canonical normal form,Discrete mathematics,Parallel computing,Gray code,Reed–Muller code,Electronic circuit,Mathematics,Data flow diagram,Computation | Journal |
Volume | Issue | ISSN |
45 | 9 | 0018-9340 |
Citations | PageRank | References |
12 | 0.85 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haomin Wu | 1 | 18 | 2.70 |
| M. A. Perkowski | 2 | 191 | 19.38 |
| Xiaoqiang Zheng | 3 | 755 | 30.88 |
| Nan Zhuang | 4 | 18 | 3.03 |