Synthesis of Finite State Algorithms in a Galois Field GF[pn]

Authors:
W. R. English
Affiliations:
USAF Electronic Systems Division
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 7
Cited 0

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
A Transform for Logic Networks

IEEE Transactions on Computers
Nonlinear Sequential Circuits

IEEE Transactions on Computers
Divided Difference Methods for Galois Switching Functions

IEEE Transactions on Computers
A Theory of Galois Switching Functions

IEEE Transactions on Computers
Comments on "Nonlinear Sequential Circuits"

IEEE Transactions on Computers
Galois Switching Functions and Their Applications

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

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.