This document proposes a new definition of "broad-sense synchronous circuits" that generalizes conventional definitions. Broad-sense synchronous circuits are defined as those with an order-preserving referential map, which determines the time points a circuit can refer to in its feedback. This definition includes traditionally synchronous circuits using flip-flops but does not require them, and excludes memory-equipped circuits that can refer to arbitrary past times. The proposed definition aims to locate an appropriate level of generality between existing too-narrow and too-broad definitions of synchronous circuits.
2. Introduction [1/5]
<existing1> : Synchronous circuits
= with D-FF(Flip-Flop) at feedback-loops :
combinational
circuit
D-FF
input output
state-out
clock
state-in
⇒ widely used and equivalent to state machines
2
3. Introduction [2/5]
<existing1> : Synchronous circuits
= with D-FF(Flip-Flop) at feedback-loops :
⇒ widely used and equivalent to state machines
3
D-FF
i
o
clk
D-FF
D-FF
i
o
clk
=
combinational circuit
4. Introduction [3/5]
From the point of view of “circuit classes”
This <existing1> definition seems too narrow
to be a general circuit class because it employs
the particular element: D-FF.
(What is so special about D-FFs?)
There is an another definition:
<existing2> : synchronous means that state transitions
are controlled by some signals.
4
5. Introduction [4/5]
Consider a circuit with a memory at the feedback-loop.
This matches <existing2>. But is it OK to call this synchronous...?
Theoretically, it can refer to any past states on demand, and so
it almost describes a general sequential circuit.
⇒ We don’t call it synchronous.
memory
write
control, address
read
combinational
circuit
input output
state-outstate-in
5
6. Introduction - summary
Definition by D-FFs <existing1> ⇒ too narrow
Controlled by some signals <existing2> ⇒ overbroad
want to find a new definition between these.
This study provides a new definition called
“broad-sense synchronous,” and this
locates between the existing two definitions.
6
7. Pre-structural Model [1/2]
Conventional circuit model
Pre-structural circuit model
f
input output
state-out
time t0
fstate-in
time t1
feedback-delay
input output
f
input output
state-out
time ta
fstate-in
time tb
time ordering
input output
refers to the last time
refers to a past 7
8. refers to the left
Pre-structural Model [2/2]
Pre-structural circuit can refer to a past that is
not necessarily the last time.
A D-FF synchronized cicuit refers to as below:
f f f
latched state
clock
refers to the left
8
9. Investigation of Referential Maps [1/4]
f
use a map r (called referential map) to
determine destinations to refer.
f f
t0 t1 t2
r(t1)= t0
r(t2)= t0
r : time → time 9
11. Investigation of Referential Maps [3/4]
memory-equipped circuit
t0 t1
control signals
read a state
at t1
write
the state
write
the state
t2 t3
read a state
at t0
11
memory
writeread
combinational
circuit
input output
state-outstate-in
control signals
12. Investigation of Referential Maps [4/4]
List of referential maps :
memory-equipped
: time ordering
: referential maps
D-FF synchronized
serial D-FF
synchronized
order-
preserving
not order-
preserving
12
13. Proposal / Validity
Proposal:
has an order-preserving referential map
= broad-sense synchronous
Validity:
1. includes conventional synchronous
⇒ broader concept
2. doesn’t employ any particular element
⇒ not too narrow
3. doesn‘t include memory-equipped
⇒ not overbroad
13
Editor's Notes
1
Synchronous circuits are usually defined as:
With D-FF(Flip-Flop) at feedback-loops, as shown here.
We call this existing1 definition.
A combinational circuit @like this, and D-FF is @here, at the feedback-loop.
These circuits are widely-used and equivalent to state machines.
This figure is a kind of general form, and describes various circuits such as:
(01:36)
On the left side, this circuit is a synchronous circuit, by the exsiting1 definition.
Because it is able to redraw as on the right side,
and this matches the previous general form.
This is an existing1 definition.
(02:02)
Here, if we observe from the point of view of “circuit classes,” such as combinational circuits, or sequential circuits, and so on.
This existing1 definition seems too narrow to be a general circuit class, because it employs the particular element: D-FF.
What is so special about D-FFs?
Meanwhile, there is an another definition:
existing2, synchronous means that output is controlled by some signals.
(02:48)
For this definition, we consider a circuit with a memory at the feedback-loop.
A same kind of @cobinational circuit, and a memory @at the feedback-loop.
This matches existing2, because state transitions are controlled by these control signals.
But is it OK to call this synchronous?
Theoretically, it can refer to any past states on demand, and so it almost describes a general sequential circuit.
Therefore, we don't call it synchronous.
(03:38)
Here is a summary of introduction.
About how define synchronous circuit,
definition by D-FFs, as existing1, seems too narrow.
Controlled by some signals, as existing2, seems overbroad.
So, we want to find a new definition between these.
This study provides a new definition called "broad-sense synchronous," and this locates between the existing two definitions.
(04:25)
To compose a new definition, we adopt a new circuit model, called "pre-structural model."
First, we confirm a conventional circuit model.
On the right side, the circuit at time t1 generates output by referring to current input, and a @state from previous time. The circuit refers to the last time.
On the lower side, pre-structural model is shown.
On the right side, the circuit at time tb refers current input and a past state. A past in general but not the last time.
(05:25)
Again, pre-structural circuit can refer a past that is not necessarily the last time.
For example, a D-FF synchronized circuit refers to as the figure here.
At the @clock edge, the state was latched.
Next, at @this time, the circuit refers to the latched state.
And next, at @this time, the circuit also refers to the latched state.
(06:10)
We use a map r, called referential map, to determine destinations to refer to.
About the previous example, at time t1, the circuit refers to t0, derives r t1 is equal to t0.
At time t2, the it also refers to t0, derives r t2 is equal to t0.
Here is the key idea of this study: we investigate these referential maps.
Finally, the function type of r is here, time to time.
(07:09)
This slide shows two examples.
The first one is the previous example: D-FF synchronized circuits.
On the right side, as seem earlier, it refers to the @latched states, at clock edges.
The second example is serial D-FF synchronized circuit, two D-FFs in series at the feedback-loop.
For this circuit, the referential map works as on the right.
It refers to the second last states: the @second last, the second last,..
(08:17)
The last example is memory-equipped circuit.
Although it depends on the control signals, this figure shows: at t2, the circuit refers to the state at t1. At t3, it refers to t0.
This kind of referential map is possible.
(08:43)
Here are three referential maps already shown.
First, D-FF synchronized, second, serial D-FF synchronized, and the last, memory-equipped.
These remind some characteristic on the order.
Two from the top preserve time ordering, at least they don't make it upside-down.
The last one does not preserve the time ordering. It makes the order upside-down.
(09:20)
Finally we propose a new definition: a circuit which has an order-preserving referential map should be called "broad-sense synchronous circuit."
The validity is as follows:
First, the new definition includes conventional synchronous circuit, thus, broader concept.
Secondly, it does not employ any particular element, thus, not too narrow.
Finally, it does not include memory-equipped circuit, this not overbroad.
That's all. Thank you for listening.
(10:11)