An Efficient Implementation of Boolean Functions as Self-Timed Circuits

  • Authors:
  • Ilana David;Ran Ginosar;Michael Yoeli

  • Affiliations:
  • Technion, Haifa, Israel;Technion, Haifa, Israel;Technion, Haifa, Israel

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1992

Quantified Score

Hi-index 14.99

Visualization

Abstract

The authors propose a general synthesis method for efficiently implementing any family of Boolean functions over a set of variables, as a self-timed logic module. Interval temporal logic is used to express the constraints that are formulated for the self-timed logic module. A method is provided for proving the correct behavior of the designed circuit, by showing that it obeys all the functional constraints. The resulting circuit is compared with alternative proposed self-timed methodologies. This approach is shown to require less gates than other methods. The proposed method is appropriate for automatic synthesis of self-timed systems. A formal proof of correctness is provided.