A systematic study for representing a finite state machine as a polynomial over Galois Field is presented. A Discrete Fourier Transform method is developed for computing the coefficients of polynomials. The representation of the machines which inputs and outputs possess different word lengths is presented. The cyclic subgroup property of the polynomial coefficients is revealed. This property considerably reduces the amount of computation. The conversion between one and multiple variable machines is discussed. The Ring-Sum representation and Fast Reed-Muller Transformation are also discussed.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Galois Field Representation of Finite State Machines


    Beteiligte:


    Erscheinungsdatum :

    2021-09-20


    Format / Umfang :

    30 pages




    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Galois Fields

    B. Dorsch | NTIS | 1966


    Testing Automotive Systems Modeled by Finite State Machines

    Kempf, Gero G. / Eckrich, Michael J. / Rumpf, Oliver J. | SAE Technical Papers | 1994


    Testing automotive systems modeled by finite state machines

    Eckrich,M.J. / Kempf,G.G. / Rumpf,O.J. et al. | Kraftfahrwesen | 1994


    Grassfire transform using finite-state machines [4567-19]

    Waltz, F. M. / Miller, J. W. V. / SPIE | British Library Conference Proceedings | 2002


    Testing Automotive Systems Modeled by Finite State Machines

    Eckrich, M. J. / Kempf, G. G. / Rumpf, O. J. et al. | British Library Conference Proceedings | 1994