Issue No. 01 - January (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.123377
<p>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.</p>
Boolean functions; self-timed circuits; logic module; temporal logic; functional constraints; automatic synthesis; formal proof; correctness; Boolean functions; logic circuits; logic design; temporal logic.
I. David, R. Ginosar, M. Yoeli, "An Efficient Implementation of Boolean Functions as Self-Timed Circuits", IEEE Transactions on Computers, vol. 41, no. , pp. 2-11, January 1992, doi:10.1109/12.123377