<s>
In	O
a	O
conventional	O
finite	B-Architecture
state	I-Architecture
machine	I-Architecture
,	O
the	O
transition	O
is	O
associated	O
with	O
a	O
set	O
of	O
input	O
Boolean	O
conditions	O
and	O
a	O
set	O
of	O
output	O
Boolean	O
functions	O
.	O
</s>
<s>
In	O
an	O
extended	B-Application
finite	I-Application
state	I-Application
machine	I-Application
(	O
EFSM	B-Application
)	O
model	O
,	O
the	O
transition	O
can	O
be	O
expressed	O
by	O
an	O
“	O
if	O
statement	O
”	O
consisting	O
of	O
a	O
set	O
of	O
trigger	O
conditions	O
.	O
</s>
<s>
EFSM	B-Application
Architecture	O
:	O
An	O
EFSM	B-Application
model	O
consists	O
of	O
the	O
following	O
three	O
major	O
combinational	O
blocks	O
(	O
and	O
a	O
few	O
registers	O
)	O
.	O
</s>
<s>
FSM-block	O
:	O
A	O
conventional	O
finite	B-Architecture
state	I-Architecture
machine	I-Architecture
realizing	O
the	O
state	O
transition	O
graphs	O
of	O
the	O
EFSM	B-Application
model	O
.	O
</s>
<s>
At	O
the	O
architecture	O
level	O
,	O
if	O
each	O
trigger	O
evaluation	O
&	O
data	O
operation	O
is	O
regarded	O
as	O
an	O
atomic	O
action	O
,	O
then	O
the	O
EFSM	B-Application
implies	O
an	O
almost	O
lowest-power	O
implementation	O
.	O
</s>
<s>
The	O
cycle	O
behavior	O
of	O
an	O
EFSM	B-Application
can	O
be	O
divided	O
into	O
three	O
steps	O
:	O
</s>
