thw_mod5_no4

thw_mod5_no4 - Number of P-terms required to implement...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 270 Introduction to Digital System Design Fall 2011 TakeHomaWork for Module 5 – Due November 9, 2011 1. [20 points] Compile the ABEL program (listed below) using ispLever in order to determine the minimum number of P-terms required for the code as written . Attach a copy of the Reduced Equation report to document your answers. MODULE cla4 TITLE '4-bit Carry Look-Ahead Adder for 26V12' DECLARATIONS X0. .X3, Y0. .Y3 pin; " operands CIN pin; " carry in S0. .S3 pin istype 'com'; " sum outputs C0. .C3 pin istype 'com'; " carry outputs (C3 is carry out) G0. .G3 pin istype 'com'; " generate functions P0 = X0$Y0; " propagate functions P1 = X1$Y1; P2 = X2$Y2; P3 = X3$Y3; EQUATIONS G0 = X0&Y0; " generate functions G1 = X1&Y1; G2 = X2&Y2; G3 = X3&Y3; " carry functions C0 = G0 # CIN&P0; C1 = G1 # G0&P1 # CIN&P0&P1; C2 = G2 # G1&P2 # G0&P1&P2 # CIN&P0&P1&P2; C3 = G3 # G2&P3 # G1&P2&P3 # G0&P1&P2&P3 # CIN&P0&P1&P2&P3; S0 = CIN$P0; " sum bit outputs S1 = C0$P1; S2 = C1$P2; S3 = C2$P3; END Number of P-terms required to implement equation for C0 = ____
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Number of P-terms required to implement equation for C1 = ____ Number of P-terms required to implement equation for C2 = ____ Number of P-terms required to implement equation for C3 = ____ Number of P-terms required to implement equation for Si = ____ ECE 270 Introduction to Digital System Design Fall 2011 2. [20 points] Draw a circuit that multiplies a 4-bit unsigned binary number X3 X2 X1 X0 by a 3-bit unsigned binary number Y2 Y1 Y0, using an array of full-adder cells. Determine the worst case propagation delay if each full adder takes 10 ns to produce its C and S outputs, and each AND gate (used to generate the product components) has 10 ns of propagation delay. C S X Y Z full adder cell to use X3 X2 X1 X0 × Y2 Y1 Y0 Name: __________________________________________ Class No: __ __ __ __ - __ Signature: ______________________________________ Score: _______ / 40 Your Class No. is the last four digits of your PUID followed by the first character of your last name....
View Full Document

This note was uploaded on 02/12/2012 for the course ECE 270 taught by Professor Staff during the Spring '08 term at Purdue.

Page1 / 2

thw_mod5_no4 - Number of P-terms required to implement...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online