Structural division procedure for efficient IC analysis

Brutscheck, Michael; Berger,; Franke, Marco; Schwarzbacher, Andreas; Becker, Ulrik

doi:10.1049/cp:20080632

Cited by 4 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It only allows actions upon transition into a state. This concept is useful in cases where a number of finite state machines are required to work together, and when it is convenient to consider a purely combinatorial part as a form of FSM to suit the design tools (Brutscheck, 2008).…”

Section: Discussion In String Matchingmentioning

confidence: 99%

A Discussion of Finite State Machine in String Search Based on Function & Class FSM Implimentations

M.O

O.O²

2017

IJARCSSE

View full text Add to dashboard Cite

The simplest type of computing machine that is worth considering is called a 'finite state machine'. As it happens, the finite state machine is also a useful approach to many problems in software architecture, only in this case you don't build one you simulate it. Essentially a finite state machine consists of a number of states -finite naturally! When a symbol, a character from some alphabet say, is input to the machine it changes state in such a way that the next state depends only on the current state and the input symbol. Notice that this is more sophisticated than you might think because inputting the same symbol doesn't always produce the same behaviour or result because of the change of state. A few examples based on the C++ implementation of the finite state algorithm based on the function & class objects is presented.

show abstract

Section: Discussion In String Matchingmentioning

confidence: 99%

A Discussion of Finite State Machine in String Search Based on Function & Class FSM Implimentations

M.O

O.O²

2017

IJARCSSE

View full text Add to dashboard Cite

show abstract

Section: How Does It Do It?mentioning

confidence: 99%

A Discussion of Finite State Machine in String Search Based on Function & Class FSM Implementations

M.O

O.O²

2018

IJERMT

View full text Add to dashboard Cite

Abstract:he simplest type of computing machine that is worth considering is called a 'finite state machine'. As it happens, the finite state machine is also a useful approach to many problems in software architecture, only in this case you don't build one you simulate it. Essentially a finite state machine consists of a number of states -finite naturally! When a symbol, a character from some alphabet say, is input to the machine it changes state in such a way that the next state depends only on the current state and the input symbol. Notice that this is more sophisticated than you might think because inputting the same symbol doesn't always produce the same behaviour or result because of the change of state. A few examples based on the C++ implementation of the finite state algorithm based on the function & class objects is presented.

show abstract

“…The determination of pin types is the first analysis step which was described in detail in [6]. This is followed by a preliminary investigation of the IC under test which results in combinatorial, sequential linear or sequential nonlinear behaviour as described in [7]. Here, it was demonstrated that a real IC can be abstracted using the model of automaton [8].…”

Section: Introductionmentioning

confidence: 99%

Identification of deterministic sequential finite state machines in unknown CMOS ICs

Brutscheck¹,

Schmidt

Franke

et al. 2009

IET Irish Signals and Systems Conference (ISSC 2009)

Self Cite

View full text Add to dashboard Cite

Until now the efficient identification of unknown CMOS integrated circuits (ICs) has attracted a lot of interest. In particular, different invasive and non-invasive strategies have been developed for IC identification. However, invasive procedures always lead to the destruction of device under test. The non-invasive approaches published so far have the disadvantage that ICs are analysed by using very complex and time consuming algorithms. This paper presents a novel non-invasive procedure to determine nonlinear binary multi-input multi-output (MIMO) ICs solely by their input-output behaviour. The algorithm presented in this paper identifies unknown ICs by the abstraction of traditional automata theory. The overall identification procedure was simulated and fully tested on IEEE ISCAS benchmark models as well as user defined models of real ICs. The results are presented in this paper. For every circuit analysed the function has been successfully determined by the proposed identification procedure.

show abstract

Structural division procedure for efficient IC analysis

Abstract: Follow this and additional works at:

Cited by 4 publications

References 6 publications

A Discussion of Finite State Machine in String Search Based on Function & Class FSM Implimentations

A Discussion of Finite State Machine in String Search Based on Function & Class FSM Implimentations

A Discussion of Finite State Machine in String Search Based on Function & Class FSM Implementations

Identification of deterministic sequential finite state machines in unknown CMOS ICs

Contact Info

Product

Resources

About