A similarity transform for linear finite state machines

Authors:
Dimitri Kagaris
Affiliations:
Electrical and Computer Engineering Department, Southern Illinois University, Carbondale, IL
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 5
Cited 1

Modern control theory (3rd ed.)

Modern control theory (3rd ed.)
An O(n3) algorithm for the Frobenius normal form

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Shifted normal forms of polynomial matrices

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Control Systems Engineering

Control Systems Engineering
An Explicit Similarity Transform between Cellular Automata and LFSR Matrices

Finite Fields and Their Applications

Finding matching initial states for equivalent NLFSRs in the Fibonacci and the Galois configurations

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.10

Visualization

Abstract

A practical algorithm in terms of ease of implementation and speed is presented to find a similarity transform between any two similar linear finite state machines (LFSMs). The transform is based on the extemal-XOR LFSR companion matrix instead of the more usual internal-XOR LFSR companion matrix. The complexity of the algorithm amounts to that of inverting an n × n matrix, where n is the LFSM size.