Question

- Implement 16 Byte rom by using 8 nibble roms - Implement 32 nibble rom by...

- Implement 16 Byte rom by using 8 nibble roms
- Implement 32 nibble rom by using 8 nibble roms and 2 by 4 decoder

Engineering   Electrical-Engineering   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

32 bit nibble is same as 16 Byte. Hence both the problems mentioned in the question are same.

A 2:4 decoder can be used to address the locations in the ROM,

Assume 8 nibble ROMs have 4 rows and 32 bits wide (32 bits is 8 nibble as 1 nibble = 4 bits)

As shown , 32 bit data lines from each ROM constitutes 8 nibbles.

Total 4 ROMs sharing common address lines and control signals like chip select , read signal will provide 32 nibbles data at a time

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Implement a 2-bit adder using only a 32x3 ROM. The adder adds two 2-bit numbers, {A1...
Implement a 2-bit adder using only a 32x3 ROM. The adder adds two 2-bit numbers, {A1 A0} and {B1 B0}. The adder also has a carry-in (Cin) input. Thus there are 5 inputs: A1 A0, B1 B0, Cin. There are 3 outputs, a 2-bit sum (S1 S0) as well as a carry-out (Cout). Include a diagram of the ROM: label inputs/outputs correctly and show the contents of ROM cells (0's/1's).
Implement 3 to 8 decoder using gate level note:- verilog code , test bench and proteus...
Implement 3 to 8 decoder using gate level note:- verilog code , test bench and proteus Simulation is required
Implement an octal to 7-segment decoder, using only a single 3-to-8 decoder module (with active-low outputs)...
Implement an octal to 7-segment decoder, using only a single 3-to-8 decoder module (with active-low outputs) plus seven additional gates – one gate per output. Each gate should have as few inputs as possible. Show your work and sketch the circuit.
Implement an encoder for 4 alphabetic characters (P, U, S, H) using a 2-to-4 Decoder and...
Implement an encoder for 4 alphabetic characters (P, U, S, H) using a 2-to-4 Decoder and Or gates. • Define the Truth Table to correctly light up the segments of a 7-segment display given two input switches (x1 and x0) representing the 4 combinations for the characters in this order ( 00 = P, 01=U, 10=S, 11=H) • Implement the circuit using the decoder and Or gates to achieve an encoder to a 7-segment display.
Design a 4 to 16 decoder using Verilog HDL. The inputs are a four-bit vector W=...
Design a 4 to 16 decoder using Verilog HDL. The inputs are a four-bit vector W= [w1 w2 w3 w4] and an enable signal En. The outputs are represented by the 16-bit vector Y= [y0 y1 …..y15]. a) Write Verilog HDL behavioral style code for 2-to-4 decoder. b) Write Verilog HDL behavioral style code for 4-to-16 decoder by instantiation of 2-to-4 decoders.
Design a 4 to 16 decoder using Verilog HDL. The inputs are a four-bit vector W=...
Design a 4 to 16 decoder using Verilog HDL. The inputs are a four-bit vector W= [w1 w2 w3 w4] and an enable signal En. The outputs are represented by the 16-bit vector Y= [y0 y1 …..y15]. a) Write Verilog HDL behavioral style code for 2-to-4 decoder. b) Write Verilog HDL behavioral style code for 4-to-16 decoder by instantiation of 2-to-4 decoders.
Q2: Implement F(A,B,C)=(A+B+C)(A’+C’)(B’+C’) using: (5 pts each) A. A 3x8 active high decoder B. A 3x8...
Q2: Implement F(A,B,C)=(A+B+C)(A’+C’)(B’+C’) using: (5 pts each) A. A 3x8 active high decoder B. A 3x8 active low decoder C. A 2x1 multiplexer. D. A 4x1 multiplexer. Q3: Implement a Full Adder using: (5 pts each) A. A 3x8 active high decoder B. A 3x8 active low decoder C. With two 2x4 Active high decoders.
1. Suppose we have a 32KB direct-mapped data cache with 32-byte blocks. a) Show how a...
1. Suppose we have a 32KB direct-mapped data cache with 32-byte blocks. a) Show how a 32-bit memory address is divided into tag, index and offset. Show clearly how many bits are in each field. b) How many total bits are there in this cache? 2. Suppose we have a 8KB direct-mapped data cache with 64-byte blocks. a) Show how a 32-bit memory address is divided into tag, index and offset. Show clearly how many bits are in each field....
Assuming you are using a 64-bit (8-byte) block cipher in CBC mode. Show the results of...
Assuming you are using a 64-bit (8-byte) block cipher in CBC mode. Show the results of padding the following plaintexts so they can fit into an even number of blocks. (A) 0f8353c2 8e1ff6 (B) 8c521e (C) c1 (D) 9f6bef2c 902fe4ba
1) Implement the given logic function using a 4:1 MUX. (Ref: Lec 16, slide 5) F(A,B,C)...
1) Implement the given logic function using a 4:1 MUX. (Ref: Lec 16, slide 5) F(A,B,C) = Σm(0,1,3,7) Show the truth table, the 4:1 MUX schematic with the inputs, select inputs and the output. 2) For an 8:3 priority encoder: a) Draw the schematic. b) Write the truth table. c) Write the Boolean expressions for each of the outputs in terms of the inputs. d) Draw the logic circuit for the outputs in terms of the inputs.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT