FAQ

Reed–Muller expansion

Known as: Reed-Muller expansion 
In Boolean logic, a Reed–Muller (or Davio) expansion is a decomposition of a boolean function. For a boolean function we set with respect to : as the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2014
01219702014

Related topics

Related topics

3 relations
Binary decision diagramDecomposition

Broader (1)

Boolean algebra

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Reed–Muller expansion
Decomposition
Boolean algebra
Binary decision diagram

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Variable-Length Chromosome Evolutionary Algorithm for Reversible Circuit Synthesis
A variable-length chromosome evolutionary algorithm for reversible circuit synthesis (VLEA RC) is presented to improve the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2009
2009
Representing the Genetic Code as a Function on a Galois Field Using the Reed-Muller Expansion
The information needed for the biotic activities of an organism is stored in a coded form in its DNA. This code is universal for… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2008
2008
Techniques for dual forms of Reed-Muller expansion conversion
Dual Forms of Reed–Muller (DFRM) are implemented in OR/XNOR forms, which are based on the features of coincidence operation. Map… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
An Algorithm for Synthesis of Reversible Logic Circuits
Reversible logic finds many applications, especially in the area of quantum computing. A completely specified n-input, n-output… (More)
  • figure 3
  • figure 2
  • figure 1
  • figure 5
  • figure 6
Is this relevant?
Review
2005
Review
2005
Quaternary Fixed-Polarity Reed-Muller expansion computation through operations on disjoint cubes and its comparison with other methods
A new algorithm for calculating quaternary Fixed-Polarity Reed–Muller (FPRM) spectra is described in this paper. The presented… (More)
  • table 2
  • table 3
  • table 4
  • table 5
  • table 7
Is this relevant?
2004
2004
Walsh-Hadamard spectral minimization of fixed polarity Reed-Muller expansions
By investigating links between Reed-Muller expansions and Walsh-Hadamard spectra an exact and non-exhaustive algorithm for the… (More)
  • table 1
Is this relevant?
2002
2002
Efficient Calculation of the Reed-muller Form by Means of the Walsh Transform
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2000
2000
Comments on "Sympathy: fast exact minimization of fixedpolarity Reed-Muller expansion for symmetric functions"
The above paper1 finds an optimal fixed-polarity Reed–Muller expansion of an -variable totally symmetric function using an OFDD… (More)
  • table I
  • table II
Is this relevant?
1993
1993
The mapping synthesis of ternary functions under fixed polarities
This paper proposes a mapping method simplifying the Reed-Muller expansion (“RM expansion”) of a ternary function under fixed… (More)
  • table 1
  • figure 4
Is this relevant?
1970
1970
Minimization of Exclusive or and Logical Equivalence Switching Circuits
 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?