On the Use of Transeunt Triangles to Synthesize Fixed-Polarity Reed-Muller Expansions of Functions

@inproceedings{Butler2009OnTU,
  title={On the Use of Transeunt Triangles to Synthesize Fixed-Polarity Reed-Muller Expansions of Functions},
  author={Jon T. Butler and Svetlana N. Yanushkevich and Gerhard W. Dueck and Vlad P. Shmerko},
  year={2009}
}
Abstract : The transeunt triangle was originally proposed by Suprun [19] as the basis of an algorithm for synthesizing fixed-polarity Reed-Muller (FPRM) expansions of symmetric functions. However, he provided no proof that this technique produced the correct FPRM expansion. We provide such a proof, thus establishing the validity of the transeunt triangle technique. Further, we show the extent to which the transeunt triangle reduces the computational work needed. Because of the efficiency of the… CONTINUE READING

Figures and Tables from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Polynomial expression of symmetric Boolean functions

V. P. Suprun
  • Izvestija AN USSR. Techn. Kibernetika (in Russian), No. 4, pp. 123-127, May 1985.
  • 1985
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Fixed polarity Reed-Muller expressions of symmetric Boolean functions

V. P. Suprun
  • Proc. IFIP WG 10.5 Workshop on Application of the Reed-Muller Expansions in Circuit Design, pp. 246-249, 1995.
  • 1995
VIEW 2 EXCERPTS

Generating minimal covers of symmetric functions

  • IEEE Trans. on CAD of Integrated Circuits and Systems
  • 1993
VIEW 1 EXCERPT

Logic synthesis for arithmetic circuits using the Reed-Muller representation

  • [1992] Proceedings The European Conference on Design Automation
  • 1992
VIEW 1 EXCERPT

Multiple-valued generalized Reed-Muller forms

  • [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic
  • 1991
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…