Issue No. 03 - March (1981 vol. 30)

ISSN: 0018-9340

pp: 225-229

W.R. English , USAF Electronic Systems Division

ABSTRACT

This correspondence describes a method for achieving synthesis of finite state algorithms by the use of a set of logic elements that execute field operations from the Galois field GF[pn]. The method begins with a definition of the algorithm to be synthesized in a completely specified finite state flow table form. A polynomial expansion of this flow table function is derived. A canonical sequential circuit corresponding to this polynomial expansion is defined. Subsequently, the given algorithm is synthesized using the canonical circuit by specification of a number of arbitrary constants in the canonical circuit. A mechanical method for deriving constants used in the canonical circuits is given. Finally, some estimates on complexity of the given circuit structure are stated assuming the most fundamental logic element structures.

INDEX TERMS

sequential networks, Finite-state algorithms, finite-state machines, Galois field arithmetic

CITATION

W. English, "Synthesis of Finite State Algorithms in a Galois Field GF[p<sup>n</sup>]," in

*IEEE Transactions on Computers*, vol. 30, no. , pp. 225-229, 1981.

doi:10.1109/TC.1981.1675759

CITATIONS

SEARCH