By Topic

Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Varma, D. ; Mentor Graphics Corp., Silicon Design Div., San Jose, CA, USA ; Trachtenberg, E.A.

Reed-Muller canonical networks are known to be easily testable implementations of logical functions. The authors present a procedure to synthesise minimal 0th polarity Reed-Muller networks for incompletely specified Boolean functions. They also present a procedure that uses reduced representations of Boolean functions in the form of logical covers to synthesise Reed-Muller networks. The latter procedure avoids exponentially long minterm representations, and hence alleviates some of the difficulties in applying spectral synthesis procedures to large Boolean functions. Both of these procedures are suitable for automation.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:138 ,  Issue: 2 )