Built-in test for VLSI: pseudorandom techniques
Built-in test for VLSI: pseudorandom techniques
Error-control coding for computer systems
Error-control coding for computer systems
Shift Register Sequences
Two-Pattern Test Capabilities of Autonomous TPG Circuits
Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
Application of GF(2p) CA in Burst Error Correcting Codes
VLSID '00 Proceedings of the 13th International Conference on VLSI Design
Cellular Automata Based Authentication (CAA)
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Cellular automata based authentication (CAA)
ICCC '02 Proceedings of the 15th international conference on Computer communication
Exploring Cycle Structures of Additive Cellular Automata
Fundamenta Informaticae - Membrane Computing
Exploring Cycle Structures of Additive Cellular Automata
Fundamenta Informaticae - Membrane Computing
| Hi-index | 14.98 |
This paper extends the theory of autonomous Linear Machines (LMs). The theory of the Extension Field has provided the foundation for the design of such machines referred to as Extended Linear Machines (ELM). An analytical framework has been reported to completely characterize the vector subspace generated by an ELM and also different variations of LMs having cyclic, as well as noncyclic vector subspaces. This formulation has resulted in a single algorithm that characterizes each of the vector subspaces in terms of cyclic and noncyclic subspaces. An ELM significantly reduces the computation time for characterizing the model and study of the behavior of the physical system compared to conventional binary linear machines.