Homework4

Homework4 - transistors needed to implement each design. 5....

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

View Full Document Right Arrow Icon
Digital Logic Homework University of Information Technology - Computer Engineering Faculty Page 1 Homework4 1. Determine the Boolean functions for outputs X and Y as a function of the four inputs in the following circuit: 2. Obtain the truth table for the circuit shown below. Draw an equivalent circuit for F with fewer NAND gates. 3. How many transistors would be required for the original circuit in Problem 2? How many for your smaller circuit.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Digital Logic Homework University of Information Technology - Computer Engineering Faculty Page 2 4. The or function is associative; that is (A or B) or C = A or (B or C). Is the nor function associative? Why or why not? Given this result, show how you would implement an 8-input NOR circuit using only 2-input NANDs /NORs and inverters. If a NAND/NOR gate has a delay of 2 and an inverter has a delay of 1, what is the total delay for your circuit? How does this compare to a direct implementation of an 8-input NOR gate as shown on page 4.11 of the notes. Also compare the total number of
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: transistors needed to implement each design. 5. Find a circuit using the minimum number of 4-input LUTs that implements the three logic functions, below: X = (A + DF)(BC + BCE) Y = (B+CE) + (AD + AD + DF) Z = AB(C + E)(D + AF) 6. For the following circuit, assume all gates have a minimum propagation delay of 2 ns and a maximum delay of 3 ns (for both rising and falling edges). Construct a timing diagram showing the time periods where the output could be either 0 or 1 (and, thus is unknown) when B=1 and C=0. Shade this region of your diagram. 7. For the following truth table, construct a circuit with the least delay and also one with the smallest gate count. Use only inverters, 2-input AND and 2-input OR gates. Assume each inverter has a 1 ns delay and each AND/OR gate has a 2 ns delay. Digital Logic Homework University of Information Technology - Computer Engineering Faculty Page 3 When counting gates, each AND/OR is one (1) and each inverter is ....
View Full Document

Page1 / 3

Homework4 - transistors needed to implement each design. 5....

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

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