By Topic

Efficient derivation of Reed-Muller expansions in multiple-valued logic systems

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 $13
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)
Harking, B. ; Fachbereich Inf., Dortmund Univ., Germany ; Moraga, Claudio

A method for computing Reed-Muller expansions for multivalued logic functions is presented. All coefficients are constructed directly without the use of matrix multiplication. Due to the high degree of parallelism, the complexity of the algorithm in terms of the area-time tradeoff (AT2) yields a better result than a butterfly algorithm does

Published in:

Multiple-Valued Logic, 1992. Proceedings., Twenty-Second International Symposium on

Date of Conference:

27-29 May 1992