Download presentation
Presentation is loading. Please wait.
Published byProsper Henderson Modified over 8 years ago
1
Sequential Circuit Design By : Pn Siti Nor Diana Ismail CHAPTER 6
2
Sequential Circuit Design Design procedure Finding state diagrams Finding state tables State assignment Designing with D flip-flops
3
Look example in Tutorial 4
4
Design procedure 1. Specification 2. Formulation 3. State assignment 4. FF input equation determination 5. Output equation determination 6. Technology mapping 7. Verification These are the proper procedure to design a complete sequential circuit.
5
Design procedure 1. Specification Usually this is given in form of statements. User need to extract important points. 2. Formulation Obtain state diagram and state table 3. State assignment Assign binary codes to the states 4. FF input equation determination Determine FF type Derive FF input equation from state table
6
Design procedure 5. Output equation determination Derive output equation from state table 6. Technology mapping Usually this is omitted Only use FF and basic gates in schematic 7. Verification
7
Finding state diagrams/state table When the diagram is given You need to find the state table On the other hand, when the state table is given You need to find the state diagram
8
Finding state diagrams/state table When the diagram is given You need to find the state table Try to find the state table for this
9
Finding state diagrams/state table When the diagram is given You need to find the state table
10
Finding state diagrams/state table On the other hand, when the state table is given You need to find the state diagram You can try on the same state table and diagram or on this one
11
State assignment For a 2 bit state (let’s say Q 1 Q 0 ) you will have at most 4 states 00 01 10 11 You may assign the states with variables Eg : A = 00, B = 01, C = 10, D = 11
12
Designing with D flip-flops A state table is given (you may want to convert it to a 1-D table)
13
Designing with D flip-flopsPresentStateInput Next State Output ABX D A = A D B = B Z 000000 001010 010000 011110 100000 101011 110100 111110
14
Designing with D flip-flops You will get the input equation from state table Use K-map to get the equation for D A D B Z
15
Designing with D flip-flops You will get these equations Now you can draw the schematic diagram using D FF
16
Exercise A sequential circuit has two FF, A and B, one input, X, and one output, Y. The state diagram is shown below. Design the circuit with D flip-flops.
17
Introduction to Memory Collection of cells capable of storing binary information Contains electronic circuits for storing & retrieve information Used to provide temporary or permanent storage capability
18
Memory Basic Process Info/content from memory is send to h/w (usually consist of registers & combinational logic) to be processed The processed info is then returned to the same or different memory address Input and Output devices may also interact with memory Memory Hardware for processing I/O Printers Mouse Keyboard Monitor Digital Camera Scanners Plotters Thumb Drive External Memory
19
Types of Memories Random Access Memory (RAM) Write operation – stores new info Read operation – transfer the stored info out of memory Read Only Memory (ROM) Perform read operation only
20
Memory data elements Typical data elements are: bit : a single binary digit byte : a collection of eight (8) bits accessed together word : a collection of binary bits whose size is a typical unit of access for the memory. (e.g., 1 byte, 2 bytes, 4 bytes, 8 bytes, etc.) Memory Data ─ a bit or a collection of bits to be stored into or accessed from memory cells. Memory Operations ─ operations on memory data supported by the memory unit. Typically, read and write operations over some data element (bit, byte, word, etc.).
21
Memory Organization Example: address bits = m = 10 data bits =16; n = 16 Address line = (2 m ) 2 10 = 1024 or 1K, labeled 0 to 1023 memory content = 16-bit so the memory has 1K words of 16- bit data or 1K x 16-bit memory Note : K (Kilo) = 2 10 M (Mega) = 2 20 G (Giga) = 2 30 Other Example : 64K = 2 16 = (2 6 * 2 10 ) 2M = 2 21 = (2 1 * 2 20 ) 4G = 2 32 = (2 2 * 2 30 ) What is the address bits (m)?
Similar presentations
© 2024 SlidePlayer.com Inc.
All rights reserved.