Professional Documents
Culture Documents
Logic Design
Sau-Hsuan Wu
A 4-bit register is composed of 4 D-type FFs which share a common clock, clear (Clr) and chip enable (CE)
Logic Design
Sau-Hsuan Wu
Logic Design
Sau-Hsuan Wu
Data are passed from one register to another. In this case, whether Ai or Bi is sent to Di depends on En
Logic Design
Sau-Hsuan Wu
A 8-bit register with tri-state output enable (En), and its corresponding symbol
Logic Design
Sau-Hsuan Wu
Registers use output enable (for releasing data) and chip enable (for accepting data) to transfer data on a bus
Logic Design
Sau-Hsuan Wu
Logic Design
Sau-Hsuan Wu
A shift register is a register whose data can be shifted right or left A 4-bit right-shift register
10
Logic Design
Sau-Hsuan Wu
11
Logic Design
Sau-Hsuan Wu
A right-shift register with inverted rotation feedback Two possible output patterns which depend on the initial state This is called Johnson counter
12
13
Logic Design
Sau-Hsuan Wu
A synchronous counter is a counter whose FFs are all driven by a clock. While for a asynchronous counter, the output of FF serves as a driving clock of the next FF A 3-bit synchronous counter implemented with T-FFs
14
Logic Design
Sau-Hsuan Wu
Design the functions of TC , TB , and TA with a state table and a truth table First, draw a stable which lists the present state and the next state, then draw the truth table of the functions
15
Logic Design
Sau-Hsuan Wu
16
Logic Design
Sau-Hsuan Wu
For D-FFs, DA is equal to the next state of FF A. So we only need a state table for counters designed with D-FFs
17
Logic Design
Sau-Hsuan Wu
18
Logic Design
Sau-Hsuan Wu
Design of up-down counter The state table and the state graph of a up-down counter
19
Logic Design
Sau-Hsuan Wu
One can verify the function by setting U=0 and D=1, or vice versus. For example, U=0 and D=1
20
Logic Design
Sau-Hsuan Wu
21
Logic Design
Sau-Hsuan Wu
22
Logic Design
Sau-Hsuan Wu
23
Logic Design
Sau-Hsuan Wu
Design of loadable up-dn counter with count enable? Realize this counter with GAL 22V10 Due on the next meet
24
25
Logic Design
Sau-Hsuan Wu
A five state counter Define the next states of three unused states 001101110 as unspecified The counter can be realized with T-FFs
T =present state next state List the truth table for the next states of TA , TB , TC Use the Karnaugh map
26
Logic Design
Sau-Hsuan Wu
Notice that T = Q+ Q So, first design Q+ = f (A,B,C) Use Karnaugh map for Q=0 and Q=1, respectively
27
Logic Design
Sau-Hsuan Wu
28
Logic Design
Sau-Hsuan Wu
After simplification
TA C B TB C A CB TC C B CB
Notice that even if the next state of 001101 and 110 are not specified at the beginning, they are assigned certain values implicitly while being used as the don t care conditions for circuit simplifications
29
Logic Design
Sau-Hsuan Wu
Circuit realization
30
Logic Design
Sau-Hsuan Wu
When CBA=001, TC TB TA = 110, then C+B+A+ =111 When CBA=101, TC TB TA = 011, then C+B+A+ =110 When CBA=110, TC TB TA = 101, then C+B+A+ =011
31
Logic Design
Sau-Hsuan Wu
An alternative design with D-FFs This is much easier since DC = C+, DB = B+ and DA = A+ So, the functions are
DC B DB C BA DA CA BA A (C B)
32
33
Logic Design
Sau-Hsuan Wu
In counter design, we mainly derive the input equations of FFs. This can be done either with the true table of the present states and the next states, or with the next-state map
34
Logic Design
Sau-Hsuan Wu
35
Logic Design
Sau-Hsuan Wu
36