1 a sequential parity checker parity checker x z clock(p) (data input) odd parity – total number...
TRANSCRIPT
![Page 1: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/1.jpg)
1
A Sequential Parity Checker
Parity Checker
X Z
Clock(P)
(Data Input)
Odd Parity – Total number of 1 bits is odd.Even Parity – Total number of 1 bits is even.
0000000 10110110 01010101 1
7 data bits parity bit
Example: Odd parity
This is a simple example of asequential network with one input plus clock.
Designed for serial data input-- data enters the network sequentially,one bit at a time.
For an odd parity checker, Z = 1 (at a given time) if the total numberof 1’s received is odd.
![Page 2: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/2.jpg)
2
A Sequential Parity Checker
State Graph
Network Timing Diagram
State Table State Table for T-FF implementation
State Encoding:
S0 Q = 0
S1 Q = 1
![Page 3: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/3.jpg)
3
Moore Sequential Network
-a sequential network whoseoutput is a function of the present state only.
X = 1 0 1 0 1A = 0 1 1 1 1 0B = 0 1 1 0 0 1Z = (0) 1 1 0 0 1
![Page 4: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/4.jpg)
4
Mealy Sequential Network
-a sequential network whose output is a function of both the present state and the input.
X = 1 0 1 0 1A = 0 0 0 1 1 0B = 0 1 1 1 1 0Z = 1(0)1 0(1)0 1
A “false” value arises becausethe network has assumed a newstate but the old input associatedwith the previous state is stillpresent.
![Page 5: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/5.jpg)
5
1. Determine the FF input equations and the output equations from the network.2. Derive the next-state equation for each FF from its input equations using the characteristic equation D FF Q+ = D
T-FF Q+ = T Q
SR-FF Q+ = S + R’Q JK-FF Q+ = JQ’ + K’Q
3. Plot a next state map for each FF4. Combine these maps to form the state table.
Deriving the State Table
![Page 6: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/6.jpg)
6
The FF input eqns. and output eqn. areJA = X KA = XB’ Z = B
JB = X KB = X A’
The next state eqns. for the FF’s areA+ = JAA’ + K’AA = XA’ + (X’ + B)A
B+ = JB B’ + K’BB = XB’ + (X A’)’B = XB’+(XA’+ X’A)B
Moore Sequential Network
![Page 7: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/7.jpg)
7Moore State Tables
Moore Sequential Network
Moore State Graph
![Page 8: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/8.jpg)
8
Mealy Sequential Network
The next-state and output eqns. are
![Page 9: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/9.jpg)
9
Mealy Sequential Network
Mealy State Graph
Mealy State Tables
input/output
![Page 10: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/10.jpg)
10
Mealy Sequential Network
-- Another Example
-two inputs and two outputs
![Page 11: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/11.jpg)
11
Mealy Sequential Network -- General
Model D-FF’s
Combinational subnetworkrealizes the n outputfunctions and the k next state functions, which serveas inputs to the D=FF’s.All FF’s change state synchronous with clock pulse.After FF’s change state thenew FF outputs are fed back into the combinationalsubnetwork awaiting the nextclock pulse.
![Page 12: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/12.jpg)
12
Moore Sequential Network -- General
Model D-FF’s
-Similar to Mealy.In the combinationalsubnetwork the output section is drawn separately from theinput section. (Output is onlya function of the present state.)
![Page 13: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/13.jpg)
13
State Table with Multiple Inputs and Outputs
Let X=0 rep. the input combination X1X2= 00, X=1 rep. X1X2= 01, etc.
Let Z=0 rep. the output combination Z1Z2= 00, Z=1 rep. Z1Z2= 01, etc.
Obtain the following table in terms of a single input variable X and a singleoutput variable Z.
(S0 , 1) = S2 (S2 , 3) = S1 Next State functions … S+ = (S,X)
(S0 , 1) = 2 (S2 , 3) = 1 Output function …….. Z = (S,X)
![Page 14: 1 A Sequential Parity Checker Parity Checker X Z Clock(P) (Data Input) Odd Parity – Total number of 1 bits is odd. Even Parity – Total number of 1 bits](https://reader031.vdocuments.mx/reader031/viewer/2022031813/56649d055503460f949d8ffc/html5/thumbnails/14.jpg)
14
What do you have to know?
• Analysis of clocked sequential networks
• State Graph, State Table, Network Realization
• Timing Diagrams
• Deriving State Table
• Moore and Mealy State machines
• General Models for Sequential Networks