sequential circuit analysis & design dr. aiman h. el-maleh computer engineering department king...
TRANSCRIPT
![Page 1: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/1.jpg)
Sequential Circuit Analysis & DesignSequential Circuit Analysis & Design
Dr. Aiman H. El-Maleh
Computer Engineering Department
King Fahd University of Petroleum & Minerals
Dr. Aiman H. El-Maleh
Computer Engineering Department
King Fahd University of Petroleum & Minerals
![Page 2: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/2.jpg)
1-2
OutlineOutline
Sequential Circuit Model Timing of Sequential Circuits Latches and Flip flops Sequential Circuit Timing Constraints Sequential Circuit Analysis Sequential Circuit Design Procedure Sequential Circuit Design Examples
Sequential Circuit Model Timing of Sequential Circuits Latches and Flip flops Sequential Circuit Timing Constraints Sequential Circuit Analysis Sequential Circuit Design Procedure Sequential Circuit Design Examples
![Page 3: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/3.jpg)
1-3
Sequential Circuit ModelSequential Circuit Model
A Sequential circuit consists of:• Data Storage elements: (Latches / Flip-Flops) • Combinatorial Logic:
• Implements a multiple-output function• Inputs are signals from the outside• Outputs are signals to the outside• State inputs (Internal): Present State from storage elements• State outputs, Next State are inputs to storage elements
A Sequential circuit consists of:• Data Storage elements: (Latches / Flip-Flops) • Combinatorial Logic:
• Implements a multiple-output function• Inputs are signals from the outside• Outputs are signals to the outside• State inputs (Internal): Present State from storage elements• State outputs, Next State are inputs to storage elements
![Page 4: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/4.jpg)
1-4
Sequential Circuit ModelSequential Circuit Model
Combinatorial Logic• Next state function: Next State = f(Inputs, State)• 2 output function types : Mealy & Moore• Output function: Mealy Circuits Outputs = g(Inputs, State)• Output function: Moore Circuits Outputs = h(State)
Output function type depends on specification and affects the design significantly
Combinatorial Logic• Next state function: Next State = f(Inputs, State)• 2 output function types : Mealy & Moore• Output function: Mealy Circuits Outputs = g(Inputs, State)• Output function: Moore Circuits Outputs = h(State)
Output function type depends on specification and affects the design significantly
![Page 5: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/5.jpg)
1-5
Sequential Circuit ModelSequential Circuit Model
Mealy Circuit
Moore Circuit
![Page 6: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/6.jpg)
1-6
Timing of Sequential CircuitsTwo ApproachesTiming of Sequential CircuitsTwo Approaches Behavior depends on the times at which storage elements ‘see’ their
inputs and change their outputs (next state present state) Asynchronous
• Behavior defined from knowledge of inputs at any instant of time and the order in continuous time in which inputs change
Synchronous• Behavior defined from knowledge of signals at discrete instances
of time• Storage elements see their inputs and change state only in relation
to a timing signal (clock pulses from a clock)• The synchronous abstraction allows handling complex designs!
Behavior depends on the times at which storage elements ‘see’ their inputs and change their outputs (next state present state)
Asynchronous• Behavior defined from knowledge of inputs at any instant of time
and the order in continuous time in which inputs change Synchronous
• Behavior defined from knowledge of signals at discrete instances of time
• Storage elements see their inputs and change state only in relation to a timing signal (clock pulses from a clock)
• The synchronous abstraction allows handling complex designs!
![Page 7: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/7.jpg)
1-7
Data Storage Logic StructuresData Storage Logic Structures
Feedback across Two inverting buffers Connected in series
Problem: No separate input to change data stored Set-Reset Latch (SR-Latch)
Feedback across Two inverting buffers Connected in series
Problem: No separate input to change data stored Set-Reset Latch (SR-Latch)
![Page 8: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/8.jpg)
1-8
Basic NOR-NOR Set–Reset (SR) LatchBasic NOR-NOR Set–Reset (SR) Latch
S = 1, R = 1 is a forbidden input pattern
![Page 9: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/9.jpg)
1-9
Basic NOR-NOR Set–Reset (SR) LatchBasic NOR-NOR Set–Reset (SR) Latch
![Page 10: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/10.jpg)
1-10
Basic NAND-NAND Set–Reset (SR) LatchBasic NAND-NAND Set–Reset (SR) Latch
S = 1 (S’=0), R = 1 (R’=0) is a forbidden input pattern
![Page 11: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/11.jpg)
1-11
Clocked SR LatchClocked SR Latch
![Page 12: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/12.jpg)
1-12
D LatchD Latch
Now S R can not become 1 1 So we got rid of the remaining unwanted condition
(SR =11 with C = 1) This latch is transparent: with C = 1, Input D is
‘connected’ to output Q
Now S R can not become 1 1 So we got rid of the remaining unwanted condition
(SR =11 with C = 1) This latch is transparent: with C = 1, Input D is
‘connected’ to output Q
D Latch
![Page 13: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/13.jpg)
1-13
The Transparent Latch as a Storage ElementThe Transparent Latch as a Storage Element
![Page 14: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/14.jpg)
1-14
Master Slave D Flip Flop (Rising-Edge Trigerred)Master Slave D Flip Flop (Rising-Edge Trigerred)
When CLK=0, the master is activated and the value on D is copied to Qm. The slave is unactivated and keeps its previous value.
When CLK=1, the master is unactivated and its hold the last value stored at Qm while the slave is activated and copies the value of Qm.
When CLK=0, the master is activated and the value on D is copied to Qm. The slave is unactivated and keeps its previous value.
When CLK=1, the master is unactivated and its hold the last value stored at Qm while the slave is activated and copies the value of Qm.
![Page 15: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/15.jpg)
1-15
Another Rising Edge-Triggered D-type Flip-FlopAnother Rising Edge-Triggered D-type Flip-Flop
![Page 16: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/16.jpg)
1-16
D Flip-Flop Timing ParametersD Flip-Flop Timing Parameters
![Page 17: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/17.jpg)
1-17
Sequential Circuit Timing ConstraintsSequential Circuit Timing Constraints
TD = worst case delay through combinational logic
TSU = FF set up time – Minimum time before the clock edge where the input data must be ready and stable
TclkQ = Clock to Q delay – Time between clock edge and data appearing at the output of the FF
THold = FF hold time – Minimum time after the clock edge where data has to remain stable (held stable)
Based on the FF & combinational logic timing parameters, the following timing constraints are obtained for correct operation of the circuit: Tclk ≥ Tclkq1 + TD + Tsu
TD = worst case delay through combinational logic
TSU = FF set up time – Minimum time before the clock edge where the input data must be ready and stable
TclkQ = Clock to Q delay – Time between clock edge and data appearing at the output of the FF
THold = FF hold time – Minimum time after the clock edge where data has to remain stable (held stable)
Based on the FF & combinational logic timing parameters, the following timing constraints are obtained for correct operation of the circuit: Tclk ≥ Tclkq1 + TD + Tsu
![Page 18: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/18.jpg)
1-18
State InitializationState Initialization
When a sequential circuit is turned on, the state of the flip flops is unknown (Q could be 1 or 0)
Before meaningful operation, we usually bring the circuit to an initial known state, e.g. by resetting all flip flops to 0’s
This is often done asynchronously through dedicated direct S/R inputs to the FFs
It can also be done synchronously by going through the clocked FF inputs
When a sequential circuit is turned on, the state of the flip flops is unknown (Q could be 1 or 0)
Before meaningful operation, we usually bring the circuit to an initial known state, e.g. by resetting all flip flops to 0’s
This is often done asynchronously through dedicated direct S/R inputs to the FFs
It can also be done synchronously by going through the clocked FF inputs
![Page 19: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/19.jpg)
1-19
Sequential Circuit AnalysisSequential Circuit Analysis
![Page 20: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/20.jpg)
1-20
Sequential Circuit AnalysisSequential Circuit Analysis
Given a sequential Circuit Objective: Derive outputs & state behavior (outputs
and next state) from (present states and inputs) Two equivalent approaches to represent the results:
• State table: A truth table-like approach• State diagram: A graphical, more intuitive way of
representing the state table and expressing the sequential circuit operation
Given a sequential Circuit Objective: Derive outputs & state behavior (outputs
and next state) from (present states and inputs) Two equivalent approaches to represent the results:
• State table: A truth table-like approach• State diagram: A graphical, more intuitive way of
representing the state table and expressing the sequential circuit operation
![Page 21: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/21.jpg)
1-21
State Table CharacteristicsState Table Characteristics
State table – a multiple variable table with the following four sections: CL Inputs:• Present State – the values of the state variables for each
allowed state (FF outputs)• External Inputs CL Outputs:• Next-state – the value of the state (FF outputs) at time
(t+1) based on the present state and the inputs. Determined by FF inputs
• Outputs – the value of the outputs as a function of the present state and (sometimes- Mealy) the inputs.
State table – a multiple variable table with the following four sections: CL Inputs:• Present State – the values of the state variables for each
allowed state (FF outputs)• External Inputs CL Outputs:• Next-state – the value of the state (FF outputs) at time
(t+1) based on the present state and the inputs. Determined by FF inputs
• Outputs – the value of the outputs as a function of the present state and (sometimes- Mealy) the inputs.
![Page 22: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/22.jpg)
1-22
Sequential Circuit Analysis ExampleSequential Circuit Analysis Example
![Page 23: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/23.jpg)
1-23
Sequential Circuit Analysis ExampleSequential Circuit Analysis Example
![Page 24: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/24.jpg)
1-24
Sequential Circuit Analysis ExampleSequential Circuit Analysis Example
![Page 25: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/25.jpg)
1-25
Sequential Circuit Analysis ExampleSequential Circuit Analysis Example
![Page 26: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/26.jpg)
1-26
Moore and Mealy ModelsMoore and Mealy Models
![Page 27: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/27.jpg)
1-27
Moore Sequential Circuit Analysis ExampleMoore Sequential Circuit Analysis Example
![Page 28: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/28.jpg)
1-28
Sequential Circuit Design ProcedureSequential Circuit Design Procedure
1. Specification – e.g. Verbal description 2. Formulation – Interpret the specification to
obtain a state diagram and a state table 3. State Assignment - Assign binary codes to
symbolic states 4. Flip-Flop Input Equation Determination - Select
flip-flop types and derive flip-flop input equations from next state entries in the state table
5. Output Equation Determination - Derive output equations from output entries in the state table
6. Verification - Verify correctness of final design
1. Specification – e.g. Verbal description 2. Formulation – Interpret the specification to
obtain a state diagram and a state table 3. State Assignment - Assign binary codes to
symbolic states 4. Flip-Flop Input Equation Determination - Select
flip-flop types and derive flip-flop input equations from next state entries in the state table
5. Output Equation Determination - Derive output equations from output entries in the state table
6. Verification - Verify correctness of final design
![Page 29: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/29.jpg)
1-29
Example: Bit Sequence Recognizer 1101Example: Bit Sequence Recognizer 1101 1. Specifications: Detect the occurrence of bit sequence
1101 whenever it occurs on input X and indicate this detection by raising an output Z high
2. Formulation: State Diagram
1. Specifications: Detect the occurrence of bit sequence 1101 whenever it occurs on input X and indicate this detection by raising an output Z high
2. Formulation: State Diagram
![Page 30: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/30.jpg)
1-30
Example: Bit Sequence Recognizer 1101Example: Bit Sequence Recognizer 1101 From the State Diagram, we can fill in the 2-D State
Table There are 4 states, one input, and one output. Two dimensional table with four rows, one for each
current state.
From the State Diagram, we can fill in the 2-D State Table
There are 4 states, one input, and one output. Two dimensional table with four rows, one for each
current state.
State Diagram State Table
![Page 31: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/31.jpg)
1-31
Example: Bit Sequence Recognizer 1101Example: Bit Sequence Recognizer 1101 3. State Assignment: From abstract symbols to binary
bit representation of states Each of the m symbolic states must be assigned a unique
binary code Minimum number of state bits (state variables) (FFs)
required is nb, such that 2nb ≥ ns
If 2nb > ns, this leaves (2nb – ns) unused states Utilize them as don’t care conditions to simplify CL design But may need caution: e.g. what if the circuit enters an
unused state by mistake
3. State Assignment: From abstract symbols to binary bit representation of states
Each of the m symbolic states must be assigned a unique binary code
Minimum number of state bits (state variables) (FFs) required is nb, such that 2nb ≥ ns
If 2nb > ns, this leaves (2nb – ns) unused states Utilize them as don’t care conditions to simplify CL design But may need caution: e.g. what if the circuit enters an
unused state by mistake
nb= log2 ns.
![Page 32: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/32.jpg)
1-32
Example: Bit Sequence Recognizer 1101Example: Bit Sequence Recognizer 1101 Also which code is given to which state? different CL
implementations may influence optimization, e.g. (with 2 FFs) State A is assigned 00 or 01 or 10 or 11?
There are possible encodings = 16 Let A = 00 (to suit being a Reset state), B = 01, C = 11, D
= 10
Also which code is given to which state? different CL implementations may influence optimization, e.g. (with 2 FFs) State A is assigned 00 or 01 or 10 or 11?
There are possible encodings = 16 Let A = 00 (to suit being a Reset state), B = 01, C = 11, D
= 10
)!2/(!2 snn nbb
![Page 33: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/33.jpg)
1-33
Example: Bit Sequence Recognizer 1101Example: Bit Sequence Recognizer 1101 For optimization of FF input equations we express
A(t+1), B(t+1), Z(t) in terms of A(t), B(t) and X(t) (using one dimensional state table)
For optimization of FF input equations we express A(t+1), B(t+1), Z(t) in terms of A(t), B(t) and X(t) (using one dimensional state table)
![Page 34: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/34.jpg)
1-34
Example: Bit Sequence Recognizer 1101Example: Bit Sequence Recognizer 1101
![Page 35: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/35.jpg)
1-35
State Diagram (Moore Model)State Diagram (Moore Model)
![Page 36: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/36.jpg)
1-36
Sequential Circuit Design: Serial ComparatorSequential Circuit Design: Serial Comparator It is required to design a sequential circuit that
compares two n-bit numbers A=An-1A2A1A0 and B=Bn-
1B2B1B0, applied to the sequential circuit serially from the least significant bits to the most significant bits.
The circuit produces two outputs GT and LT. • If A>B, then output signal GT is set to 1 and LT is set to 0. • If A<B, then output signal LT is set to 1, and GT is set to 0. • Otherwise, both signals will be set to 0, which indicates that
the two numbers are equal (i.e. A=B).
It is required to design a sequential circuit that compares two n-bit numbers A=An-1A2A1A0 and B=Bn-
1B2B1B0, applied to the sequential circuit serially from the least significant bits to the most significant bits.
The circuit produces two outputs GT and LT. • If A>B, then output signal GT is set to 1 and LT is set to 0. • If A<B, then output signal LT is set to 1, and GT is set to 0. • Otherwise, both signals will be set to 0, which indicates that
the two numbers are equal (i.e. A=B).
![Page 37: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/37.jpg)
1-37
Sequential Circuit Design: Serial ComparatorSequential Circuit Design: Serial Comparator
![Page 38: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/38.jpg)
1-38
Sequential Circuit Design: Serial ComparatorSequential Circuit Design: Serial Comparator
![Page 39: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/39.jpg)
1-39
Sequential Circuit Design: Y = 3*x + 1Sequential Circuit Design: Y = 3*x + 1
It is required to design a sequential circuit that has a single input X and a single output Y.
The circuit receives an unsigned number serially through the input X from the least significant bit (LSB) to the most significant bit (MSB), and computes the equation Y=3*X+1 and generates the output serially from the least significant bit to the most significant bit.
It is required to design a sequential circuit that has a single input X and a single output Y.
The circuit receives an unsigned number serially through the input X from the least significant bit (LSB) to the most significant bit (MSB), and computes the equation Y=3*X+1 and generates the output serially from the least significant bit to the most significant bit.
![Page 40: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/40.jpg)
1-40
Sequential Circuit Design: Y = 3*x + 1Sequential Circuit Design: Y = 3*x + 1
State Diagram State Diagram
![Page 41: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/41.jpg)
1-41
Sequential Circuit Design: Y = 3*x + 1Sequential Circuit Design: Y = 3*x + 1
![Page 42: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/42.jpg)
1-42
BCD to Excess-3 Serial Code ConverterBCD to Excess-3 Serial Code Converter Assume that once the machine is reset, a continues
stream of BCD digits will be transmitted serially and converted to Excess-3 digits.
Assume that once the machine is reset, a continues stream of BCD digits will be transmitted serially and converted to Excess-3 digits.
![Page 43: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/43.jpg)
1-43
BCD to Excess-3 Serial Code ConverterBCD to Excess-3 Serial Code Converter
State Diagram State Table
![Page 44: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/44.jpg)
1-44
BCD to Excess-3 Serial Code ConverterBCD to Excess-3 Serial Code Converter
![Page 45: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/45.jpg)
1-45
BCD to Excess-3 Serial Code ConverterBCD to Excess-3 Serial Code Converter
Karnaugh maps for the encoded state bits and output bit (Bout)
![Page 46: Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh](https://reader035.vdocuments.site/reader035/viewer/2022062712/56649ca65503460f94968bd0/html5/thumbnails/46.jpg)
1-46
BCD to Excess-3 Serial Code ConverterBCD to Excess-3 Serial Code Converter