• DocumentCode
    1555216
  • Title

    Efficient algorithm for canonical Reed-Muller expansions of Boolean functions

  • Author

    Harking, B.

  • Author_Institution
    Abteilung Inf., Dortmund Univ., West Germany
  • Volume
    137
  • Issue
    5
  • fYear
    1990
  • fDate
    9/1/1990 12:00:00 AM
  • Firstpage
    366
  • Lastpage
    370
  • Abstract
    The paper presents a new method for computing all 2n canonical Reed-Muller forms (RMC forms) of a Boolean function. The method constructs the coefficients directly and no matrix-multiplication is needed. It is also usable for incompletely specified functions and for calculating a single RMC form. The method exhibits a high degree of parallelism.
  • Keywords
    Boolean functions; Boolean functions; algorithm; canonical Reed-Muller expansions;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings E
  • Publisher
    iet
  • ISSN
    0143-7062
  • Type

    jour

  • Filename
    58816
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1555216