EE365 Adv. Digital Circuit Design Clarkson University Lecture #1 Course Outline Number Systems.

Slides:



Advertisements
Similar presentations
Binary Addition Rules Adding Binary Numbers = = 1
Advertisements

Numbers & Arithmetic Hakim Weatherspoon CS 3410, Spring 2011 Computer Science Cornell University See: P&H Chapter , 3.2, C.5 – C.6.
Arithmetic Operations and Circuits
Cpe 252: Computer Organization1 Lo’ai Tawalbeh Lecture #2 Standard combinational modules: decoders, encoders and Multiplexers 1/3/2005.
King Fahd University of Petroleum and Minerals
EE365 Adv. Digital Circuit Design Clarkson University Lecture #7 Intro to MSI PLDs and Decoders.
Chapter 6 Arithmetic. Addition Carry in Carry out
EE365 Adv. Digital Circuit Design Clarkson University Lecture #6
ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
1 Lecture 8: Binary Multiplication & Division Today’s topics:  Addition/Subtraction  Multiplication  Division Reminder: get started early on assignment.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #2 Boolean Laws and Methods.
EECC341 - Shaaban #1 Lec # 3 Winter Binary Multiplication Multiplication is achieved by adding a list of shifted multiplicands according.
ECE 331 – Digital System Design
DIGITAL SYSTEMS TCE1111 Representation and Arithmetic Operations with Signed Numbers Week 6 and 7 (Lecture 1 of 2)
EE365 Adv. Digital Circuit Design Clarkson University Lecture #8 Buffers, Drivers, Encoders, MUXs & XORs.
Computer ArchitectureFall 2007 © August 29, 2007 Karem Sakallah CS 447 – Computer Architecture.
Chapter 1 The Big Picture. QUIZ 2 5 Explain the abstractions we normally apply when using the following systems: DVD player Registering for classes on.
Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See: P&H Chapter 2.4, 3.2, B.2, B.5, B.6.
Chapter 12 Digital Logic Circuit Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Wrap-Up. Goals Introduce fundamental concepts – Binary numbers – Addition/Subtraction – Boolean Algebra Hardware correlation – Logic gates – Logic reduction.
1 Arithmetic and Logical Operations - Part II. Unsigned Numbers Addition in unsigned numbers is the same regardless of the base. Given a pair of bit sequences.
Data Representation – Binary Numbers
1 Bits are just bits (no inherent meaning) — conventions define relationship between bits and numbers Binary numbers (base 2)
ECE 4110– Sequential Logic Design
Chapter 7 Arithmetic Operations and Circuits Binary Arithmetic Addition –When the sum exceeds 1, carry a 1 over to the next-more-significant column.
#1 Lec # 2 Winter EECC341 - Shaaban Positional Number Systems A number system consists of an order set of symbols (digits) with relations.
ECEN2102 Digital Logic Design Lecture 1 Numbers Systems Abdullah Said Alkalbani University of Buraimi.
Chapter 2 Number Systems + Codes. Overview Objective: To use positional number systems To convert decimals to binary integers To convert binary integers.
CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION.
Lecture 1 Binary Representation Topics Terminology Base 10, Hex, binary Fractions Base-r to decimal Unsigned Integers Signed magnitude Two’s complement.
Topic: Arithmetic Circuits Course: Digital Systems Slide no. 1 Chapter # 5: Arithmetic Circuits.
Number Systems. Why binary numbers? Digital systems process information in binary form. That is using 0s and 1s (LOW and HIGH, 0v and 5v). Digital designer.
مدار منطقي مظفر بگ محمدي Course Structure & Grading Homework: 25% Midterm: 30% Final:50% There is 5% extra! ( =105!) Textbook:
CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION
Lecture 4 Last Lecture –Positional Numbering Systems –Converting Between Bases Today’s Topics –Signed Integer Representation Signed magnitude One’s complement.
1 DLD Lecture 18 Recap. 2 Recap °Number System/Inter-conversion, Complements °Boolean Algebra °More Logic Functions: NAND, NOR, XOR °Minimization with.
IKI Data Types & Representations Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture Notes.
Numbers and Arithmetic Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See: P&H Chapter , 3.2, C.5 – C.6.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Logic and Computer Design.
ECE 2110: Introduction to Digital Systems Signed Addition/Subtraction.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #9 Math Units ROMs.
Computer Architecture Lecture 32 Fasih ur Rehman.
Topics covered: Arithmetic CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Kavita Bala CS 3410, Spring 2014 Computer Science Cornell University.
Csci 136 Computer Architecture II – Multiplication and Division
Lecture 2 Binary Arithmetic Topics Terminology Fractions Base-r to decimal Unsigned Integers Signed magnitude Two’s complement August 26, 2003 CSCE 211.
Outline Binary Addition 2’s complement Binary Subtraction Half Adder
ECE 331 – Digital System Design Multi-bit Adder Circuits, Adder/Subtractor Circuit, and Multiplier Circuit (Lecture #12)
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
ECE 2110: Introduction to Digital Systems
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
Integer Operations Computer Organization and Assembly Language: Module 5.
MicroProcessors Lec. 4 Dr. Tamer Samy Gaafar. Course Web Page —
1 CS 352 Introduction to Logic Design Lecture 1 Ahmed Ezzat Number Systems and Boolean Algebra, Ch-1 + Ch-2.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
CHAPTER 3 BINARY NUMBER SYSTEM. Computers are electronic machines which operate using binary logic. These devices use two different values to represent.
More on Digital Logic Devices and Circuits Trac D. Tran ECE Department The Johns Hopkins University Baltimore, MD
CSE 260 Digital Logic Design Md. Shamsul Kaonain Khadija Rasul Aniqua Zereen.
Week 1(Number System) Muhammad Ammad uddin Logic Design Lab I (CEN211)
More Binary Arithmetic - Multiplication
CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION
Principles & Applications
Digital Systems Section 14 Registers. Digital Systems Section 14 Registers.
lecturer | ASIC design engineer
HALF ADDER FULL ADDER Half Subtractor.
ELL100: INTRODUCTION TO ELECTRICAL ENGG.
Computer Organization and Design
Presentation transcript:

EE365 Adv. Digital Circuit Design Clarkson University Lecture #1 Course Outline Number Systems

No mid-course exams (only final exam) Design Problems heavily weighted Optional homeworks Quizzes (every few days) correspond to HWs Textbook: does everyone have it? Office Hours: where/when Contact information (phone, , AIM) Rissacher EE365 Syllabus Lect #1

Schedule Notes (suggest printing before class) Handouts Class Location (some will be in computer lab) Links Rissacher EE365 Course Website Lect #1

Interrupt me at anytime for questions Discussions encouraged Grade not based on attendance Feel free to excuse yourself at any time (e.g., if you’re falling asleep go stretch your legs and buy a mountain dew, or leave after quiz is over) Bring scrap paper: I may give in-class practice problems Rissacher EE365 Lecture Structure Lect #1

Heavily weighted May take some time, start early & use the weekends Will have at least one in-class help session for each project. Each project will require you to hand in files on floppy or CD (your choice)… make sure you have a supply before the first project is due Rissacher EE365 Projects Lect #1

General Topics: Basic Logic Review Logic Laws/Theorems/Methods VHDL Transistor-Level Logic Implementation Electrical Behavior (timing, hazards, etc.) MSI Devices (Gates, Encoders, MUXs, registers, etc.) Sequential Logic LSI/VLSI Devices (memory, CPLDs, FPGAs) Rissacher EE365 Overview Lect #1

Will be covered later today Rissacher EE365 Number Systems & Math Lect #1

DeMorgan’s Law, Sum of Products, Product of Sums Minterm, Maxterm Karnaugh Maps Commutativity, Associativity, etc. Rissacher EE365 Logic Laws & Methods Lect #1

Rissacher EE365 VHDL Lect #1 entity and2 is port ( a, b : in bit; y : out bit ); end and2; architecture basic of and2 is begin and2_behavior : process begin y <= a and b after 2 ns; wait on a, b; end process and2_behavior; end basic;

Rissacher EE365 Transistor-Level Logic Implementation Lect #1

Rissacher EE365 Electrical Behavior Lect #1 Propagation Delay Fan-In, Fan-Out Timing Hazards etc

Rissacher EE365 MSI Devices Lect #1 Encoders, Decoders, Multiplexers, Registers, PLDs, Comparators, Adders, Subtractors, ALUs, etc.

Rissacher EE365 Sequential Logic Lect #1

Rissacher EE365 LSI/VLSI Devices Lect #1 ROMs SRAM DRAM CPLDs FPGAs

Rissacher EE365Lect #1 Number Systems Binary Hex Octal Addition/Subtraction Negative Numbers

Rissacher EE365Lect #1 Number Systems 2n2n 10 n 8n8n 16 n Where n is the bit #, or decimal place

Rissacher EE365Lect #1 Binary Addition

Rissacher EE365Lect #1 Binary Subtraction

Rissacher EE365Lect #1 Negative Binary Numbers Signed-Magnitude Two’s Complement

Rissacher EE365Lect #1 Signed-Magnitude MSB represents the sign Other bits represent the value = = -85

Rissacher EE365Lect #1 Two’s Complement MSB represents the sign Other bits represent the value if positive Complement + 1 of other bits represents the value if negative creates a continuous number line so that if we start with most negative number and count up, we see that each successive number can be obtained e.g., 17 = , complement = = = -17

Rissacher EE365Lect #1 Two’s Complement Addition/Subtraction Ignore carry bits into MSB For subtraction, simply negate one of the numbers

Rissacher EE365Lect #1 Binary Multiplication/Division Very similar to the multiplication and long division methods that we learned in elementary school

Rissacher EE365Lect #1 Binary Multiplication Multiplication is achieved by adding a list of shifted multiplicands according to the digits of the multiplier Un-signed example:

Rissacher EE365Lect #1 Binary Multiplication Instead of listing all shifted multiplicands before adding, we can add each shifted multiplicand to a partial product (move convenient in a digital system):

Rissacher EE365Lect #1 Two’s Complement Multiplication A sequence of two’s-complement additions is similar except for the last step where the shifted multiplicand (corresponding to the MSB) must be negated:

Rissacher EE365Lect #1 Binary Division Use long division, shift and subtract (shown below) Direct two’s complement method not discussed here, but sign can be handled by negating the quotient if the dividend and divisor had different signs

Rissacher EE365Lect #1 Next Time Logic Theorems Sum-of-Products vs. Product-of-Sums Minterms/Maxterms Logic Function Representations

Rissacher EE365Lect #1 Homework me your contact information and preferred methods of reaching you Please include , phone, messenger names, etc. my address: