Exact ESCT minimization for functions of up to six input variables

  • Authors:
  • Dimitrios Voudouris;Marinos Sampson;George Papakonstantinou

  • Affiliations:
  • Department of Electrical and Computer Engineering, Division of Computer Science, Computing Systems Laboratory, National Technical University of Athens, 157 80 Zografou Campus, Greece;Department of Electrical and Computer Engineering, Division of Computer Science, Computing Systems Laboratory, National Technical University of Athens, 157 80 Zografou Campus, Greece;Department of Electrical and Computer Engineering, Division of Computer Science, Computing Systems Laboratory, National Technical University of Athens, 157 80 Zografou Campus, Greece

  • Venue:
  • Integration, the VLSI Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, an efficient algorithm for the synthesis and exact minimization of ESCT (exclusive or sum of complex terms) expressions for Boolean functions of at most six variables is proposed. This kind of logical expressions can be mapped to a special cellular architecture, called reversible wave cascade architecture. This topology is useful, because it has been proved to be reversible and moreover it may help in the design of quantum circuits. The proposed algorithm is the first one to give solution to the problem of finding minimal ESCT expressions for switching functions of up to six input variables.