Please do this question for all a,b,c, and d with a clear hand writing 2. Consid
ID: 2268290 • Letter: P
Question
Please do this question for all a,b,c, and d with a clear hand writing
2. Consider a memory system with a 14 bit address and the following regions: There is a 2k RAM starting at address $0600 There is a 4k ROM ending at the highest system addressable Do the following: a) Determine the unknown, size, first address, or last address for each region and draw the b) Determine the block size for each region and therespctive block numbers for each c) Write when-else statements for the enables for each device (enram for RAM, and enrom d) Show that the first and last address for each memory region enables each respective memory map. Have the addresses in hexadecimal. memory region. for ROM) when-else statement.Explanation / Answer
A13
A12
A11
A10
A9
A8
A7
A6
A5
A4
A3
A2
A1
A0
Starting
Address
RAM
0
0
0
1
1
0
0
0
0
0
0
0
0
0
$0600
End
Address RAM
0
0
1
1
0
1
1
1
1
1
1
1
1
1
$0DFF
Starting
Address
ROM
1
1
0
0
0
0
0
0
0
0
0
0
0
0
$3000
End Address
ROM
1
1
1
1
1
1
1
1
1
1
1
1
1
1
$3FFF
b. Address line A12 and A13 determines the block total numbers of block. Hence blocks will be 22 = 4 of each 4 Kb size
c. enram = A12 NOR A13 ; enrom = A12 AND A13
d. starting address of RAM is 0x0600 , end address of RAM is 0x0DFF. Hence A12 = A13 = 0
or enram = A12 NOR A13 will be 1
Similarly starting address of ROM is 0x3000 , end address of RAM is 0x3FFF. Hence A12 = A13 = 1
or enrom = A12 AND A13 will be 1
A13
A12
A11
A10
A9
A8
A7
A6
A5
A4
A3
A2
A1
A0
Starting
Address
RAM
0
0
0
1
1
0
0
0
0
0
0
0
0
0
$0600
End
Address RAM
0
0
1
1
0
1
1
1
1
1
1
1
1
1
$0DFF
Starting
Address
ROM
1
1
0
0
0
0
0
0
0
0
0
0
0
0
$3000
End Address
ROM
1
1
1
1
1
1
1
1
1
1
1
1
1
1
$3FFF