Lab 3 : Multiplier Overview.

Slides:



Advertisements
Similar presentations
Kuliah Rangkaian Digital Kuliah 7: Unit Aritmatika
Advertisements

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Combinational Circuits ENEL 111. Common Combinationals Circuits NAND gates and Duality Adders Multiplexers.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Lab 4 Preview Friday, 18 August. SEQUENTIAL CIRCUITS Design Using Flip-flops Review of Digital I.
Chapter 3 Combinational Logic Design
ECE 301 – Digital Electronics
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Figure 1.1 The Altera UP 3 FPGA Development board
ALTERA UP2 Tutorial 1: The 15 Minute Design. Figure 1.1 The Altera UP 1 CPLD development board. ALTERA UP2 Tutorial 1: The 15 Minute Design.
CS 105 Digital Logic Design
ECE 3130 – Digital Electronics and Design Lab 3 Multiplexers, Parity Generators, and Boolean functions using MUX Fall 2012 Allan Guan.
Combinational Circuits
Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.
ReVieW Combinational & Sequential Logic Circuit EKT 221 / 4 DIGITAL ELECTRONICS II.
Adders and Multipliers Review. ARITHMETIC CIRCUITS Is a combinational circuit that performs arithmetic operations, e.g. –Addition –Subtraction –Multiplication.
Morgan Kaufmann Publishers
Combinational Logic Design CS341 Digital Logic and Computer Organization F2003.
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
ECE 3130 – Digital Electronics and Design
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
Advanced Digital Circuits ECET 146 Week 5 Professor Iskandar Hack ET 221G, Me as I typed this slides.
Advanced Digital Circuits ECET 146 Week 5 Professor Iskandar Hack ET 221B,
Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
1 Lecture 9 Demultiplexers Programmable Logic Devices  Programmable logic array (PLA)  Programmable array logic (PAL)
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
DIGITAL 2 : EKT 221 Date : 15 th July 2005 Lecture : 1 hrs.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Lab 2 : Overview Combinational System.
Arithmetic Circuits. Half Adder ABSumCarry
Sneha.  A combinational circuit that performs the addition of two bits is called a half adder.  It has two inputs.  It has two outputs.
Chapter 0 - reVieW Combinational Logic Circuit, Combinational Logic Circuit, Propagation Delay, Propagation Delay, Programmable Logic. Programmable Logic.
COE4OI5 Engineering Design Chapter 1: The 15 minutes design.
EKT 121 / 4 DIGITAL ELECTRONICS 1
Combinational Logic Design
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits
Combinational Circuit Design. Digital Circuits Combinational CircuitsSequential Circuits Output is determined by current values of inputs only. Output.
Chapter 0 – Week 2 Combinational Logic Design. What have been discussed Design hierarchy –Top – down –Bottom – up CAD HDL Logic synthesis.
Gates AND, OR, NOT NAND, NOR Combinational logic No memory A set of inputs uniquely and unambiguously specifies.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-4 Verification 1Created by: Ms.Amany AlSaleh.
LAB #5 Modular Design and Hierarchy using VHDL
SERIAL MULTIPLIER Part 1
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Lab 2 : Overview Combinational System.
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Digital Logic Design 1st Exam Solution
Computer Architecture CST 250
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
XOR, XNOR, and Binary Adders
FIGURE 4.1 Block diagram of combinational circuit
XOR, XNOR, & Binary Adders
Boolean Algebra.
ECE 301 – Digital Electronics
Week 7: Gates and Circuits: PART II
COMS 361 Computer Organization
XOR, XNOR, and Binary Adders
XOR Function Logic Symbol  Description  Truth Table 
Prof. Onur Mutlu ETH Zurich Spring March 2019
ECE 3130 Digital Electronics and Design
Adder Circuits By: Asst Lec. Basma Nazar
XOR, XNOR, and Binary Adders
Presentation transcript:

Lab 3 : Multiplier Overview

Lab 3 : Multiplier Create a 2 x 2 bits multiplier using: K-Map Technique Array Technique Create a 4x4 bit multiplier using the 2x2 bit multiplier

Part A : K-Map Technique Create a Truth Table for 2 bit “multiplier” and 2 bit “multiplicand” Input (Multiplier) = A1 and A0 Input (Multiplicand) = B1 and B0 Output = 4 bit = S3, S2, S1 and S0 (example) Using K-Map, obtain the boolean expression for each output. Draw the schematic diagram Transfer in Altera Max+Plus II using the Graphic Editor Submit : Truth Table, K-Map, Boolean Expression, Printed Schematic and Printed Waveform

Part A : K-Map Technique Simulate your design Input A1 and A0 = fix value (repeat for 4 levels) Input B1 and B2 = counting sequence Study the waveform

Part A : K-Map Technique Check and study the timing Analyzer for time delay Go to : Max+PlusII > Timing Analyzer

Part B : Array Technique Create the 2x2 multiplier using Full ADDERS. Still remember the truth table for ADDERS?!!??

Full Adder Full Adder Truth Table S = X Å Y Å (C-in) X 1 Y S C-out Inputs Outputs X 1 Y S C-out C-in C-out = XY + X(C-in) + Y(C-in) Full Adder X Y S C-in C-out S(X,Y, C-in) = S (1,2,4,7) C-out(x, y, C-in) = S (3,5,6,7)

Full Adder Full adder can also be implemented using 2 x ½ ADDER and one OR gate. (check in ref. book how it is done??)

Half Adder X 1 Y S C-out Half Adder Truth Table: S = X Å Y C-out = XY 1 Y S C-out Half Adder Truth Table: Inputs Outputs S = X Å Y C-out = XY X Y Sum S Half Adder X Y S C-OUT C-out

Part B : Array Technique Submit your drawings of full adders and its truth table, your printed schematic, and waveform (same input and as K-Map technique) Fill in the timing analyzer

K-Map Vs Array After Analyzing your timing and getting the time delay NOW. Check your delay: K-Map = what is the delay? Array Technique = what is the delay? Why??? (Conclusion)

2 x 2 Multiplier using Array technique – The Concept A1 A0 B1 B0 x C C A1B0 A0B0 + A1B1 A0B1 S3 S2 S1 S0

THE CHALLENGE Part C : 4 x 4 Multiplier Design 4 x 4 bits multiplier using Array technique Use the Multiplier 2x2 symbols and full adders which u have created. Hints : Look back at the concept of 2x2 multiplier. Take the same step.

Part C : 4 x 4 Multiplier Simulate your waveform Submit your printed schematic diagram and waveform

Max+PlusII Tips Bus line A[3..0] A3 A2 A1 A0

Part C : 4 x 4 Multiplier Extra Activity Download your 4x4 multiplier to UP2 board using FPGA (Flex10K) Pin Configuration to input (use flex switch 1-8) Pin Configuration to output (use flex digit 1 & 2 ) 4x4 Multiplier (your design) Tenth & Unit Segment Decoder 7447 BCD to 7Seg a - g A0 A1 A2 A3 B0 B1 B2 B3

Do first thing first Important? Urgent? THANK YOU Do first thing first Important? Urgent?