CpE358/CS381. Switching Theory and Logical Design. Class 10



Similar documents
Counters & Shift Registers Chapter 8 of R.P Jain

Experiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa

CHAPTER IX REGISTER BLOCKS COUNTERS, SHIFT, AND ROTATE REGISTERS

Memory Elements. Combinational logic cannot remember

WEEK 8.1 Registers and Counters. ECE124 Digital Circuits and Systems Page 1

Chapter 7. Registers & Register Transfers. J.J. Shann. J. J. Shann

CpE358/CS381. Switching Theory and Logical Design. Class 4

Design Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters:

Digital Logic Design Sequential circuits

DIGITAL COUNTERS. Q B Q A = 00 initially. Q B Q A = 01 after the first clock pulse.

Counters are sequential circuits which "count" through a specific state sequence.

ETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies

Module 3: Floyd, Digital Fundamental

Digital Electronics Detailed Outline

DEPARTMENT OF INFORMATION TECHNLOGY

Latches, the D Flip-Flop & Counter Design. ECE 152A Winter 2012

Standart TTL, Serie Art.Gruppe

Asynchronous Counters. Asynchronous Counters

Flip-Flops and Sequential Circuit Design. ECE 152A Winter 2012

Flip-Flops and Sequential Circuit Design

Registers & Counters

Sequential Logic. (Materials taken from: Principles of Computer Hardware by Alan Clements )

Chapter 8. Sequential Circuits for Registers and Counters

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Counters and Decoders

Contents COUNTER. Unit III- Counters

Upon completion of unit 1.1, students will be able to

Systems I: Computer Organization and Architecture

ANALOG & DIGITAL ELECTRONICS

BINARY CODED DECIMAL: B.C.D.

Operating Manual Ver.1.1

To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC.

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 5. LECTURE: REGISTERS AND RELATED

Engr354: Digital Logic Circuits

Chapter 5. Sequential Logic

Sequential Logic Design Principles.Latches and Flip-Flops

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute. 2nd (Spring) term 2012/2013

Philadelphia University Faculty of Information Technology Department of Computer Science Semester, 2007/2008.

Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill

Cascaded Counters. Page 1 BYU

CHAPTER 11 LATCHES AND FLIP-FLOPS

The components. E3: Digital electronics. Goals:

University of St. Thomas ENGR Digital Design 4 Credit Course Monday, Wednesday, Friday from 1:35 p.m. to 2:40 p.m. Lecture: Room OWS LL54

Asynchronous counters, except for the first block, work independently from a system clock.

List of Experiment. 8. To study and verify the BCD to Seven Segments DECODER.(IC-7447).

Lecture 8: Synchronous Digital Systems

Digital Design. Assoc. Prof. Dr. Berna Örs Yalçın

Chapter 9 Latches, Flip-Flops, and Timers

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad

Flip-Flops, Registers, Counters, and a Simple Processor

Lab 1: Study of Gates & Flip-flops

Modeling Sequential Elements with Verilog. Prof. Chien-Nan Liu TEL: ext: Sequential Circuit

Course Requirements & Evaluation Methods

ASYNCHRONOUS COUNTERS

PLL frequency synthesizer

Lesson 12 Sequential Circuits: Flip-Flops

ECE380 Digital Logic

Modeling Registers and Counters

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

Take-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas

COMBINATIONAL CIRCUITS

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.

Unit 3 Boolean Algebra (Continued)

Digital Systems. Syllabus 8/18/2010 1

Combinational Logic Design Process

IC Overview: 74HC family

DIGITAL ELECTRONICS. Counters. By: Electrical Engineering Department

路 論 Chapter 15 System-Level Physical Design

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1)

DM74LS169A Synchronous 4-Bit Up/Down Binary Counter

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

Set-Reset (SR) Latch

EE360: Digital Design I Course Syllabus

Academic year: 2015/2016 Code: IES s ECTS credits: 6. Field of study: Electronics and Telecommunications Specialty: -

Gray Code Generator and Decoder by Carsten Kristiansen Napier University. November 2004

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

Aims and Objectives. E 3.05 Digital System Design. Course Syllabus. Course Syllabus (1) Programmable Logic

CS311 Lecture: Sequential Circuits

Master/Slave Flip Flops

EXPERIMENT 8. Flip-Flops and Sequential Circuits

Napier University. School of Engineering. Electronic Engineering A Module: SE42205 Digital Design

Counters. Present State Next State A B A B

CSE140: Components and Design Techniques for Digital Systems

Introduction to CMOS VLSI Design (E158) Lecture 8: Clocking of VLSI Systems

Decimal Number (base 10) Binary Number (base 2)

Fig1-1 2-bit asynchronous counter

A Lesson on Digital Clocks, One Shots and Counters

ECE232: Hardware Organization and Design. Part 3: Verilog Tutorial. Basic Verilog

A Lesson on Digital Clocks, One Shots and Counters

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design


2.0 Chapter Overview. 2.1 Boolean Algebra

Sequential Circuit Design

3.Basic Gate Combinations

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

DM74LS191 Synchronous 4-Bit Up/Down Counter with Mode Control

Transcription:

CpE358/CS38 Switching Theory and Logical Design Class CpE358/CS38 Summer- 24 Copyright 24-373

Today Fundamental concepts of digital systems (Mano Chapter ) Binary codes, number systems, and arithmetic (Ch ) Boolean algebra (Ch 2) Simplification of switching equations (Ch 3) Digital device characteristics (e.g., TTL, CMOS)/design considerations (Ch ) Combinatoric logical design including LSI implementation (Chapter 4) Flip-flops and state memory elements (Ch 5) Sequential logic analysis and design (Ch 5) Counters, shift register circuits (Ch 6) Hazards, Races, and time related issues in digital design (Ch 9) Synchronous vs. asynchronous design (Ch 9) Memory and Programmable logic (Ch 7) Minimization of sequential systems Introduction to Finite Automata CpE358/CS38 Summer- 24 Copyright 24-374

Course Roadmap Logic Circuits with gates CpE358/CS38 Summer- 24 Copyright 24-375

Course Roadmap Combinatorial Circuits Logic Circuits with gates CpE358/CS38 Summer- 24 Copyright 24-376

Course Roadmap Combinatorial Circuits Logic Circuits with gates Logic Circuits with memory CpE358/CS38 Summer- 24 Copyright 24-377

Course Roadmap Combinatorial Circuits Logic Circuits with gates Sequential Circuits Logic Circuits with memory CpE358/CS38 Summer- 24 Copyright 24-378

Course Roadmap Combinatorial Circuits Logic Circuits with gates Sequential Circuits Logic Circuits with memory Specific Specific functions CpE358/CS38 Summer- 24 Copyright 24-379

Course Roadmap Combinatorial Circuits Logic Circuits with gates Sequential Circuits Logic Circuits with memory Specific Specific functions Registers and Counters CpE358/CS38 Summer- 24 Copyright 24-38

Shift Register 2 3 4 5 6 S I D D D D D D D S O Clk Present Input Next Output 2 3 4 5 6 S I S I 2 3 4 5 S = 6 N-bit S/R S I S O SISO Register Serial-in, Serial-out CpE358/CS38 Summer- 24 Copyright 24-38

Shift Register Variants 2 3 4 5 6 S I D D D D D D D S O Clk 2 N- SIPO Register S I N-bit S/R S O Serial-in, Parallel-out CpE358/CS38 Summer- 24 Copyright 24-382

Shift Register Variants D D D 2 2 D 3 3 D 4 4 D 5 5 D 6 6 D D D D D D D Clk D D D 2 D N- N-bit S/R PIPO Register Parallel-in, Parallel-out 2 N- CpE358/CS38 Summer- 24 Copyright 24-383

Shift Register Variants D N-2 D N- N- S I D D D S O Clk P/S D D D 2 D N- P/S S I N-bit S/R S O Serial/Parallel Register Parallel-in/Serial-in, Parallel-out/Serial-out 2 N- CpE358/CS38 Summer- 24 Copyright 24-384

Tandem S/Rs Serial registers 2N-bit S/R S I N-bit S/R S O S I N-bit S/R S O CpE358/CS38 Summer- 24 Copyright 24-385

Generic Moore Machine j Outputs m n B/ Transition Controls A/ C/ Inputs k All state-to-state transitions are potentially allowable. CpE358/CS38 Summer- 24 Copyright 24-386

S/R-based Moore Machine S/R j Outputs n B/ Transition Controls A/ C/ Inputs k Only specific state-to-state transitions are allowable. CpE358/CS38 Summer- 24 Copyright 24-387

Shift Register Sequences Transition Controls Output Mapping S I I N-bit S/R S O CpE358/CS38 Summer- 24 Copyright 24-388

Shift Register Sequences Input Transition Controls Output Mapping S I I N-bit S/R S O S I = ABCDE S I = BCDE BCDE S I = S I = S I = S I = BCD BCD BCD BCD CpE358/CS38 Summer- 24 Copyright 24-389

S/R Data Scrambler/Encryptor Fracasi scrambler: S/R Sequential Function F(x) S/R Sequential Function F(x) Input Data + + Descrambled Data CpE358/CS38 Summer- 24 Copyright 24-39

S/R Data Scrambler/Encryptor Fraccassi scrambler: N-bit S/R N-bit S/R N-bit S/R + + + + N-bit S/R N-bit S/R N-bit S/R Input Data + + Descrambled Data CpE358/CS38 Summer- 24 Copyright 24-39

Course Roadmap Combinatorial Circuits Logic Circuits with gates Sequential Circuits Logic Circuits with memory Specific Specific functions Registers and Counters CpE358/CS38 Summer- 24 Copyright 24-392

Generic Moore Machine j Outputs m n B/ Transition Controls A/ C/ Inputs k All state-to-state transitions are potentially allowable. CpE358/CS38 Summer- 24 Copyright 24-393

Counter Moore Machine Counter j Outputs m n B/ Transition Controls A/ C/ Inputs k -to-state transitions follow a counting sequence Inputs (if any) may be used to set counting range, direction, starting point CpE358/CS38 Summer- 24 Copyright 24-394

Counters Binary Ripple Counter J A K A CpE358/CS38 Summer- 24 Copyright 24-395

Counters Binary Ripple Counter J A J B K K A B CpE358/CS38 Summer- 24 Copyright 24-396

Counters Binary Ripple Counter J A B C J J K K K A B C CpE358/CS38 Summer- 24 Copyright 24-397

Binary Ripple Counter (idealized) Counters J A B C J J K K K A B C CpE358/CS38 Summer- 24 Copyright 24-398

Binary Ripple Counter (more realistic) Counters J A B C J J K K K A B C { { { { { { { CpE358/CS38 Summer- 24 Copyright 24-399

Cascading Counters T CpE358/CS38 Summer- 24 Copyright 24-4

Cascading Counters T T CpE358/CS38 Summer- 24 Copyright 24-4

Cascading Counters T T T CpE358/CS38 Summer- 24 Copyright 24-42

Cascading Counters T T T T N CpE358/CS38 Summer- 24 Copyright 24-43

Cascading Counters T T T T N CpE358/CS38 Summer- 24 Copyright 24-44

Ripple Counters vs. Synchronous Counters F JAR (A,B,C) J A B C F JBR (A,B,C) J F JBR (A,B,C) J F KAR (A,B,C) K F KBR (A,B,C) K F KBR (A,B,C) K F JAS (A,B,C) J A B C F JBS (A,B,C) J F JBS (A,B,C) J F KAS (A,B,C) K F KBS (A,B,C) K F KBS (A,B,C) K CpE358/CS38 Summer- 24 Copyright 24-45

Synchronous Counters BCD Counter: table Present Next CpE358/CS38 Summer- 24 Copyright 24-46

Synchronous Counters BCD Counter: J-K inputs BA DC BA DC J A K A J B K B Present Next J C J D K C K D J-K operation: CpE358/CS38 Summer- 24 Copyright 24-47

J A J B J C J D BCD Counter: J-K inputs BA DC CpE358/CS38 Summer- 24 Synchronous Counters BA DC K A K B K C K D Copyright 24 J-K operation: Present Next -48

J A J B J C J D BCD Counter: J-K inputs BA DC CpE358/CS38 Summer- 24 Synchronous Counters BA DC K A K B K C K D Copyright 24 J-K operation: Present Next -49

J A J B J C J D BCD Counter: J-K inputs BA DC CpE358/CS38 Summer- 24 Synchronous Counters BA DC K A K B K C K D Copyright 24 J-K operation: Present Next -4

J A J B J C J D BCD Counter: J-K inputs BA DC CpE358/CS38 Summer- 24 Synchronous Counters BA DC K A Copyright 24 K B J A = K A = J B = AD K C K B = A K D J C = AB K C = AB J D = ABC K D = A Present Next -4

Synchronous Counters BCD Counter J A B C J J J D K K K K J A = K A = J B = AD K B = A J C = AB K C = AB J D = ABC K D = A Present J D K D J C K C J B K B J A K A Next Present J D K D J C K C J B K B J A K A Next CpE358/CS38 Summer- 24 Copyright 24-42

Synchronous Counters BCD Counter Present J D K D J C K C J B K B J A K A Next Present J D K D J C K C J B K B J A K A Next CpE358/CS38 Summer- 24 Copyright 24-43

Varieties of Counters Counters with Parallel Load Normal counter operation Load C I D 3 D 2 D D Next C O D D D 2 D 3 C I C O LD 2 3 ABCD ABCD WYZ WYZ CpE358/CS38 Summer- 24 Copyright 24-44

Varieties of Counters Counters with Parallel Load Normal counter operation Load C I D 3 D 2 D D Next C O D D D 2 D 3 C I C O LD 2 3 ABCD ABCD WYZ WYZ CpE358/CS38 Summer- 24 Copyright 24-45

Varieties of Counters Counters with Parallel Load Loading next state in parallel Load C I D 3 D 2 D D Next C O D D D 2 D 3 = ABCD C I C O LD 2 3 --> ABCD ABCD ABCD WYZ WYZ CpE358/CS38 Summer- 24 Copyright 24-46

Varieties of Counters Counters with Parallel Load Load C I D 3 D 2 D D Next C O D D D 2 D 3 C I C O LD 2 3 ABCD ABCD WYZ WYZ CpE358/CS38 Summer- 24 Copyright 24-47

Varieties of Counters Counters with Parallel Load Load C I D 3 D 2 D D Next C O D D D 2 D 3 C I C O LD 2 3 ABCD ABCD WYZ WYZ CpE358/CS38 Summer- 24 Copyright 24-48

Cascading Synchronous Counters D D D 2 D 3 D D D 2 D 3 D D D 2 D 3 C I A C O LD C I C O B C LD LD C I C O 2 3 2 3 2 3 A A 2A 3A C OA B CpE358/CS38 Summer- 24 Copyright 24-49

Programmable Synchronous Counters LSB D D D 2 D 3 D D D 2 D 3 MSB D D D 2 D 3 C I A C O LD C I B C O LD C I C C O LD 2 3 2 3 2 3 Assume D 3C D A = b b b 9 b 8 b 7 b 6 b 5 b 4 b 3 b 2 b b Next C OA C OB C OC b b b 9 b 8 b 7 b 6 b 5 b 4 b 3 b 2 b b b b b 9 b 8 b 7 b 6 b 5 b 4 b 3 b 2 b b + ABCD EFGH ABCD EFGH+ ABCD ABCD+ b b b 9 b 8 b 7 b 6 b 5 b 4 b 3 b 2 b b CpE358/CS38 Summer- 24 Copyright 24-42

Applications of Programmable Counters Programmable divide by N frequency divider: 2 K -N CI CO CI CI CO CI CO CI LD LD LD LD /N CpE358/CS38 Summer- 24 Copyright 24-42

Applications of Programmable Counters Reference Oscillator Voltage Divide Phase Lowpass Controlled f By K Comparator Filter R f R /K Oscillator f S Synthesized Frequency Phase Locked Loop f S /N Divide By N Channel Selection, N f S = N K f R PLL frequency synthesizers used in TV, radio, cellular phones, PCs, modems, etc. CpE358/CS38 Summer- 24 Copyright 24-422

Applications of Programmable Counters Master f m Divide by f m /A A Divide by B f m /B Complex Digital System (e.g., PC) Divide by C f m /C CpE358/CS38 Summer- 24 Copyright 24-423

Timing Signal Generation Master f m Phase A Phase B Complex Digital System (e.g., PC) Phase C CpE358/CS38 Summer- 24 Copyright 24-424

Only FF is set at any given time Ring Counters s D D D D D A B C D E A B C D E CpE358/CS38 Summer- 24 Copyright 24-425

Switch-tail Ring Counters (Johnson Counter) A B C D D D D D A B C D E s D E CpE358/CS38 Summer- 24 Copyright 24-426

Summary Fundamental concepts of digital systems (Mano Chapter ) Binary codes, number systems, and arithmetic (Ch ) Boolean algebra (Ch 2) Simplification of switching equations (Ch 3) Digital device characteristics (e.g., TTL, CMOS)/design considerations (Ch ) Combinatoric logical design including LSI implementation (Chapter 4) Flip-flops and state memory elements (Ch 5) Sequential logic analysis and design (Ch 5) Counters, shift register circuits (Ch 6) Hazards, Races, and time related issues in digital design (Ch 9) Synchronous vs. asynchronous design (Ch 9) Memory and Programmable logic (Ch 7) Minimization of sequential systems Introduction to Finite Automata CpE358/CS38 Summer- 24 Copyright 24-427

Homework due in Class 2 Show all work Problems 6-, 6-23, 6-29 CpE358/CS38 Summer- 24 Copyright 24-428