ece290HWK #6 Solution (ROM)

# ece290HWK #6 Solution (ROM) - Problem 6.1 We have a ROM...

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

Problem 6.1 We have a ROM that has N entries of M bits each. We are interested in using it to implement a logic function. (a) How big is this ROM in bytes? Express your answer in terms of N and M. a. ࡺൈࡹ (b) How many bits are needed to address the ROM? Express your answer in terms of N and M. a. ܔܗ܏ ሺࡺሻ (c) How many distinct N-variable functions with 1-bit outputs can we implement with this ROM? Express your answer in terms of N and M. Copied from an email to Michael: The answer to the problem is: ࡺכࡹ . I got this by diving the total number of bits we have (N times M) by the number of bits it takes to represent a single N-variable function, 2^N. We need to floor this because it doesn't make much sense to represent some fraction of a function. (d) Let N = 32 and M = 2. Can we implement an arbitrary Boolean function f of 6 variables using the ROM and at most 4 logic gates? If so, draw the circuit. If not, why not?

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/21/2011 for the course ECE 290 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.

### Page1 / 5

ece290HWK #6 Solution (ROM) - Problem 6.1 We have a ROM...

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

View Full Document
Ask a homework question - tutors are online