HOW 1s AND 0s RULE THE WORLD Utku Altunkaya. Outline Introduction Basic Logic Operations Logic Circuits Base-2 (Binary) Number System Analog vs. Digital.

Slides:



Advertisements
Similar presentations
EET260 Introduction to digital communication
Advertisements

CT455: Computer Organization Logic gate
Digital Logic Design Gate-Level Minimization
Programmable Logic Controllers.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
التصميم المنطقي Second Course
Bits and Data Storage. Basic Hardware Units of a Computer.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
(2.1) Fundamentals  Terms for magnitudes – logarithms and logarithmic graphs  Digital representations – Binary numbers – Text – Analog information 
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Basic Logic Operations and Standard Logic Gates (Lecture #1) ECE 331 – Digital System Design.
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
4. Electrons and electronics 4.5 Digital electronics.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Chapter 1 Data Storage © 2007 Pearson Addison-Wesley. All rights reserved.
WELCOME. LOGIC GATE WHAT WE ARE GOING TO LEARN? The Logic Gate. Analogue and Digital signal. Bit and Byte. Boolean Theorem. Description and Circuit analyses.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
Logic Signals and Gates. Binary Code Digital logic hides the pitfalls of the analog world by mapping the infinite set of real values for a physical quantity.
Logic Gates & Boolean Algebra Chin-Sung Lin Eleanor Roosevelt High School.
Data Storage © 2007 Pearson Addison-Wesley. All rights reserved.
School of Computer and Communication Engineering, UniMAP Mohd ridzuan mohd nor DKT 122/3 - DIGITAL SYSTEM I Chapter.
CO5023 Introduction to Digital Circuits. What do we know so far? How to represent numbers (integers and floating point) in binary How to convert between.
1 Fundamentals of Computer Science Combinational Circuits.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Basic Logic Operations and Standard Logic Gates [Lecture:1] Instructor: Sajib Roy Lecturer, ETE, ULAB ETE 204 – Digital Electronics.
ECE DIGITAL LOGIC LECTURE 5: BINARY LOGIC AND DIGITAL LOGIC GATES Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/28/2016.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Combinational Logic Logic gates. and, or, not Derived gates. nand, nor, xor John F. Wakerly – Digital Design. 4 th edition. Chapter 4.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
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.
1 Binary Signals Logic gate circuits are designed to input and output only two types of signals: “high” (1) and “low” (0), as represented by a variable.
Digital logic COMP214  Lecture 1 Dr. Sarah M.Eljack Chapter 1 1.
Computer Architecture & Operations I
Computer Architecture & Operations I
Dr. Ameria Eldosoky Discrete mathematics
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Logic Gates & Boolean Algebra
Everything is a number Everything in a computer memory and on storages is a number. Number  Number Characters  Number by ASCII code Sounds  Number.
Combinational Logic Logic gates. and, or, not Derived gates.
ECE 331 – Digital System Design
Logic Gates.
CSCI-100 Introduction to Computing
Exclusive OR Gate.
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
Principles & Applications
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Logic Gates.
Logic Gates.
Digital Logic.
Logic Gates.
13 Digital Logic Circuits.
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Digital Logic.
Logic Gates.
Logic Circuits I Lecture 3.
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Digital Electronics and Logic Circuit
Presentation transcript:

HOW 1s AND 0s RULE THE WORLD Utku Altunkaya

Outline Introduction Basic Logic Operations Logic Circuits Base-2 (Binary) Number System Analog vs. Digital Signals and Systems Implementation Technologies for Digital Circuits

Introduction All digital systems are built around the fundamentals of the base-2 (binary) number system, which uses only 1s and 0s to represent numbers. Anything that can be expressed as a binary number can be processed by a digital system.

Introduction Here are a few concepts and acronyms related to digital systems that are widely used in daily life: Bits, bytes, kilo-, mega-, and gigabytes Microprocessors, RAM, ROM CD-ROM, CD- Audio, MP3 compression DVD, MPEG and DivX compression Internet, modem, ADSL, kbps, mbps…

Logic Operations THE AND GATE The AND gate implements the Boolean AND function where the output is logic 1 only when all inputs to the AND gate are logic 1. The standard symbol and the truth table for a two-input AND gate is: The Boolean expression for the AND gate is Y = A · B

Logic Operations THE OR GATE The OR gate implements the Boolean OR function where the output is logic 1 when any input to the OR gate is logic 1. The standard symbol and the truth table for a two-input OR gate is: The Boolean expression for the OR gate is Y = A + B

Logic Operations THE NOT GATE The NOT gate (Inverter) implements the Boolean NOT function where the output is the inverse of the input. The standard symbol and the truth table for the NOT gate is: The Boolean expression for the NOT gate is Y = A. From these three basic logical gates it is possible to implement any Boolean expression in hardware. Some simple combinations of these functions have their own gate names and symbols; these are NAND, NOR, XOR, and XNOR gates.

Logic Operations THE NAND GATE The NAND gate is an AND gate followed by a NOT gate. The output of a NAND gate is logic 0 when all inputs are logic 1. The standard symbol and the truth table for a two-input NAND gate is: The Boolean expression for the NAND gate is Y = (A · B)

Logic Operations THE NOR GATE The NOR gate is a combination of an OR followed by a NOT gate. The output is logic 0 when any of the inputs is logic 1. The standard symbol and the truth table for a two-input NOR gate is: The Boolean expression for the OR gate is Y = (A + B)

Logic Operations THE XOR GATE (EXCLUSIVE-OR) The output of this gate is logic 1 if an odd number of its inputs are logic 1; otherwise, the output of this gate is logic 0. The standard symbol and the truth table for a two-input XOR gate is: The Boolean expression for the XOR gate is Y = (A · B) + (A · B)

Logic Operations THE XNOR GATE (EXCLUSIVE-NOR) The output of this gate is logic 1 if an even number of its inputs are logic 1; otherwise, the output of this gate is logic 0. The standard symbol and the truth table for a two-input XNOR gate is: The Boolean expression for the XOR gate is Y = [(A · B) + (A · B)]

Logic Circuits A logic circuit is a compound circuit consisting of the basic logic gates AND, OR, NOT, NAND, NOR, XOR, and XNOR. A combinational logic circuit produces its output according to the logic values of its current inputs. The 'past' inputs do not influence the output of the circuit. Circuits that are able to 'remember' the past are called sequential circuits.

Logic Circuits ABCL=(A · B)M=A+BN=(L · M)P=N+CQ=(N · C)R=(P · Q)

Base-2 (Binary) Number System

Analog vs. Digital A continuous valued signal is called an analog signal. A discrete time, quantized and binary coded signal is called a digital signal.

Analog to Digital: Sampling The figure at the right shows a continuous-time, analog (continuous-valued) signal.

Analog to Digital: Sampling The first step in digitizing an analog signal is sampling, which is done by taking samples of the original analog signal at equally spaced, fixed points in time.

Analog to Digital: Sampling The time distance between these sampling points is called the sampling period, and the number of samples taken per second is denoted as the sampling frequency. Sampling period is the inverse of the sampling frequency: T s =1/f s

Analog to Digital: Sampling As the sampling period gets smaller (and thus the sampling frequency gets higher) the sampled signal provides a better and better representation of the original signal.

Analog to Digital: Sampling The samples are still analog in nature, but together they form a discrete-time signal. The sampled signal must now be quantized, and then binary codes must be assigned to each sample to obtain the digital signal.

Analog to Digital: Quantization Quantization is achieved by rounding the value of each sample to a predetermined quantization level.

Analog to Digital: Quantization The range between the minimum and maximum values of the signal is divided into a number of equally spaced levels, and the distance between two adjacent levels is called the quantization step.

Analog to Digital: Quantization As the number of quantization levels increase, the quantization step gets smaller, enabling a better representation of the original signal.

Analog to Digital: Quantization The result of the quantization operation is a discrete-valued, discrete-time signal. Finally, to obtain the digital signal, each quantization level will now be assigned a unique binary number code.

Analog to Digital: Coding In this example, the sampled signal is quantized using 0.01V steps between the values 0V to 2.55V, giving 256 discrete quantization levels. These levels are then numbered using 8-bit binary codes ranging from 0 ( ) to 255 ( ).

Analog to Digital: Coding The digital representation of the analog signal is thus a series of 1s and 0s forming 8-bit (1 byte) binary numbers for each sample. This information can now be stored in a file on a computer, or transmitted over the Internet.

Digital Information The amount of data required to represent a digital signal is determined by the signals sampling frequency and the number of quantization levels. As these increase, so does the amount of data. In order to keep the amount of required data as small as possible, sampling frequency and quantization levels must be carefully chosen and these quantities should be no more than what is absolutely necessary to represent the analog signal to be digitized.

Digital Information As an example, Audio CDs use 16-bit samples and the sampling frequency is 44.1 kHz. Since the audio recording is stereo, two channels (left and right) are digitized and stored on the CD. The amount of data required for 1 second of audio is thus: 2 channels x 16 bits/sample x samples/s = bits/s = 1.35Mbits/s bits/s = ( / 8) bytes/s = Kbytes/s

Implementation Technologies for Digital Circuits Programmable Logic Devices Application Specific Integrated Circuits Microprocessors & Microcontrollers Digital Signal Processors FPGAs

Your Questions

Thank You