Generalized partially-mixed-polarity Reed-Muller expansion and its fast computation | IEEE Journals & Magazine | IEEE Xplore

Generalized partially-mixed-polarity Reed-Muller expansion and its fast computation


Abstract:

Generalized partially-mixed-polarity Reed-Muller (GPMPRM) expansion, a canonical subfamily of exclusive sum of products (ESOP), is presented. An efficient algorithm in tw...Show More

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.
Published in: IEEE Transactions on Computers ( Volume: 45, Issue: 9, September 1996)
Page(s): 1084 - 1088
Date of Publication: 30 September 1996

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.