Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter 4 - 4.1 – 4.7, and 4.12 Chapter 5 - 5.1-5.3, 5.6-5.7 Chapter 6 - all sections.

Slides:



Advertisements
Similar presentations
Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.
Advertisements

Chapter 2 Logic Circuits.
التصميم المنطقي Second Course
Section 10.3 Logic Gates.
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Number Systems & Logic Gates Day 2. Octal Number System Base (Radix)8 Digits0, 1, 2, 3, 4, 5, 6, 7 e.g = =648 1 =88 0 =1 The digit.
Number Systems and Arithmetic
2.7 NAND and NOR logic networks
01 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Chapter 1 Number Systems and Codes 1. Outline 1. NUMBER SYSTEMS AND CODES 2. DIGITAL ELECTRONIC SIGNALS AND SWITCHES 3. BASIC LOGIC GATES 4. PROGRAMMABLE.
ES 244: Digital Logic Design Chapter 1 Chapter 1: Introduction Uchechukwu Ofoegbu Temple University.
Chapter 4 Gates and Circuits.
Binary Codes Computers and other digital systems "work" with binary numbers. I/P & O/P is usually done using decimal numbers, alphabetics, special symbols.
CSU0014 Assembly Languages Homepage: Textbook: Kip R. Irvine, Assembly Language for Intel-Based Computers,
CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Logic Design Dr. Yosry A. Azzam. Binary systems Chapter 1.
مدار منطقي مظفر بگ محمدي Course Structure & Grading Homework: 25% Midterm: 30% Final:50% There is 5% extra! ( =105!) Textbook:
Engineering 1040: Mechanisms & Electric Circuits Spring 2014 Number Systems.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
CS/EE 3700 : Fundamentals of Digital System Design Chris J. Myers Lecture 2: Intro. to Logic Circuits Chapter 2.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
Number systems, Operations, and Codes
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
1 Ethics of Computing MONT 113G, Spring 2012 Session 1 Digital Circuits, binary Numbers Course webpage:
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
1/16/ CSEE, UQ Lecture 3 Hardware Description Methods, Review of Switching Algebra.
Logic Design EE-2121 Manesh T. Digital Systems  Introduction  Binary Quantities and Variables  Logic Gates  Boolean Algebra  Combinational Logic.
CSC 331: DIGITAL LOGIC DESIGN COURSE LECTURER: E. Y. BAAGYERE. CONTACT: LECTURE TIME: 15:40 – 17:45 hrs. VENUE: SP-LAB.
CHAPTER 5 Combinational Logic Analysis
Figure 2.1. A binary switch. x1=x0= (a) Two states of a switch S x (b) Symbol for a switch.
ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Third Edition, by Allan R. Hambley, ©2005 Pearson Education, Inc. Chapter 7 Logic Circuits.
1’S COMPLEMENT REPRESENTATION 1’s complement of a number (binary) is obtained by changing all 1’s to 0 and all 0’s to 1. If one of these numbers is positive.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Number Systems with special emphasis on Binary Last lecture Spring 2016 BRAC University Dept. of EEE. 24/01/2016 Rachaen M. Huq1.
1 Digital Logic Design (41-135) Chapter 5 Number Representation & Arithmetic Circuits Younglok Kim Dept. of Electrical Engineering Sogang University Spring.
DATA REPRESENTATION IN COMPUTER MEMORY.  Describe the coding system:  Sign and magnitude  1’s Complement and 2’s Complement  Binary Coded Decimal.
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
Hoda Roodaki Boolean Algebra Hoda Roodaki
Logic gates.
Logic Gates and Boolean Algebra
EKT 124 / 3 DIGITAL ELEKTRONIC 1
Instructor: Alexander Stoytchev
CHAPTER 1 : INTRODUCTION
Introduction Molecules: made up of atoms of individual elements.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Fundamentals & Ethics of Information Systems IS 201
University of Gujrat Department of Computer Science
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Digital Electronics & Logic Design
Logic Gates L Al-zaid Math110.
ELL100: INTRODUCTION TO ELECTRICAL ENGG.
For OCR GCSE Computing Unit 1 - Theory
JC Technology Logic Gates.
Chapter 2 Introduction to Logic Circuits
KS4 Electricity – Electronic systems
13 Digital Logic Circuits.
Chapter 10.3 and 10.4: Combinatorial Circuits
Logic Gates Dr.Halimah Alshehri.
XOR Function Logic Symbol  Description  Truth Table 
Department of Electronics
ATS’s COLLEGE OF ENGINEERING, MIRAJ Subject:- Basic Electronics Lecturer:- Amit Totade.
Presentation transcript:

Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections Chapter 7 - all sections Chapter

1.6 Binary numbers An electronic signal in logic circuits carries one digit of information. –Each digit is allowed to take on only two possible values, usually denoted as 0 and 1. –-> Information in logic circuits is represented as combinations of 0 and 1 digits. Q: How to represent numbers (E.g., positive integers) using only binary digits 0 and 1? 2

Decimal (base-10) number system A decimal integer is expressed by an n-tuple comprising n decimal digits D = d n-1 d n-2 ∙ ∙ ∙ d 1 d 0 which represents the value V(D) = d n-1 ×10 n-1 + d n-2 ×10 n-2 + ∙ ∙ ∙ + d 1 × d 0 ×10 0 This is referred to as the positional number representation. 3

Binary (base-2) number system Logic circuits use the binary system whose positional number representation is B = b n-1 b n-2 ∙ ∙ ∙ b 1 b 0 b n-1 is the most significant bit (MSB), b 0 is the least significant bit (LSB), Every bit b i can only have two values: 0 or 1. 4

Numbers in decimal and binary Decimal representation Binary representation Decimal representation Binary representation

Conversion from binary to decimal Compute a weighted sum of every binary digit contained in the binary number B = b n-1 b n-2 ∙ ∙ ∙ b 1 b 0 V(B) = b n-1 ×2 n-1 + b n-2 ×2 n-2 + ∙ ∙ ∙ + b 1 ×2 1 + b 0 ×2 0 E.g., (1101) 2 = 1× × ×2 1 +1×2 0 =(13) 10 6

Conversion from decimal to binary Perform the successive division by 2 until the quotient becomes 0. Remainder 857 / 2 = 4281LSB 428 / 2 = / 2 = / 2 = / 2 = / 2 = / 2 = 61 6 / 2 = 30 3 / 2 = 11 1 / 2 = 01MSB 7

Chapter 2 Introduction to Logic Circuits

Outline 2.1 Variables and Functions 2.2 Inversion 2.3 Truth tables 2.4 Logic gates and networks 2.5 Boolean algebra 2.6 Synthesis using AND, OR and NOT gates 2.7 NAND and NOR logic networks 2.8 Design examples 9

Figure 2.1. A binary switch. x1=x0= (a) Two states of a switch S x (b) Symbol for a switch 2.1 Variables 10

Figure 2.2. A light controlled by a switch. (a) Simple connection to a battery S (b) Using a ground connection as the return path Battery Light Power supply S Light x x An application 11

Figure 2.3. Two basic functions. (a) The logical AND function (series connection) S Power supply S S Power supplyS (b) The logical OR function (parallel connection) Light x1x1 x2x2 x1x1 x2x2 Functions 12

S Power supplyS Light S X1X1 X2X2 X3X3 L(x 1, x 2, x 3 ) = (x 1 + x 2 ) x 3 A series-parallel connection 13

Figure 2.5. An inverting circuit. S Light Power supply R x 2.2 Inversion (complement, not) 14