The Alex language for circuit description

  • Authors:
  • Sh. E. Bozoyan;V. S. Yeghiazaryan

  • Affiliations:
  • Russian-Armenian (Slavonic) University, Yerevan, Armenia 375051;Russian-Armenian (Slavonic) University, Yerevan, Armenia 375051

  • Venue:
  • Programming and Computing Software
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers the Alex language designed for describing digital circuits. This is a generalization of the nonbracket language notation ("Polish Notation") based on the deduction principle; i.e., an axiomatic theory has been constructed with a circuit notation being a theorem. We prove a metatheorem (theorem on the circuit notation) that sets necessary and sufficient conditions for a given sequence of symbols to be a theorem in this theory (i.e., a description of a circuit). The assumptions of this theorem can easily be verified and, therefore, used as means of syntactic control for the correctness of the circuit description. The description of circuits in the Alex language is optimal: the record length is equal to the number of links between the circuit elements. A specific feature of this language is that any subcircuit with a single output in the circuit record is depicted as a continuous segment of symbols. This feature makes it possible to easily perform equivalent transformations of the circuit on the basis of its record, by replacing some segments of symbols with other segments that are functionally equivalent. Some examples are provided to demonstrate the implementation of the algorithm of functional simulation of circuits described in Alex.