FIFO-Digital Logic Design-Solution Manual, Exercises of Digital Logic Design and Programming

This is solution manual for Digital Logic Design course. It was helpful for assignment Dr. Archan Singh gave us at Punjab Engineering College. It includes: Register, Fields, FIFO, Manner, Result, Immediate, Internal, Interrupts, Hard, Disk, Overflow

Typology: Exercises

2011/2012

Uploaded on 07/20/2012

annapurna
annapurna ๐Ÿ‡ฎ๐Ÿ‡ณ

4.4

(21)

91 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
9-3.
9-6.
9-9.
9-11.
LD R1, A
LD R2, B
LD R3, C
LD R4, D
ADD R3, R1, R3
ADD R1, R1, R2
MUL R2, R2, R4
MUL R1, R3, R1
SUB R1, R1, R2
ST Y, R1
MOV T1, A
ADD T1, C
MOV T2, B
MUL T2, D
MOV T3, A
ADD T3, B
MUL T3, T1
SUB T3, T2
MOV Y, T3
LD A
ADD C
ST T1
LD B
MUL D
ST T2
LD A
ADD B
MUL T1
SUB T2
ST Y
a) b) c)
AB+()AC+()ร—BDร—()AB CA+BD โ€“ร—ร—+=โ€“
A)
PUSH A PUSH B ADD PUSH A PUSH C ADD
ABA+BA CA+C
AA+BAA+B
A+B
MUL PUSH B PUSH D MUL SUB
(A+B)x(A+C) B D BxD (A+B)x(A+C) - BxD
(A+B)x(A+C) B (A+B)x(A+C)
(A+B)x(A+C)
B,C)
a) X = 200 โ€“ 208 โ€“ 1 = โ€“9 b) X = 1111 1111 1111 0111
address field = 0
a) 3 Register Fields x 5 bits/Field = 15 bits. 32 bits - 15 bits = 17 bit. 217 = 131,072
b) 256 = 8 bits. 2 Register Fields x 5 bits/Field = 10 bits. 32 bits - 8 bits - 10 bits = 14 Memory Bits
docsity.com
pf3

Partial preview of the text

Download FIFO-Digital Logic Design-Solution Manual and more Exercises Digital Logic Design and Programming in PDF only on Docsity!

9-3.

9-6.

9-9.

9-11.

LD R1, A

LD R2, B

LD R3, C

LD R4, D

ADD R3, R1, R

ADD R1, R1, R

MUL R2, R2, R

MUL R1, R3, R

SUB R1, R1, R

ST Y, R

MOV T1, A

ADD T1, C

MOV T2, B

MUL T2, D

MOV T3, A

ADD T3, B

MUL T3, T

SUB T3, T

MOV Y, T

LD A

ADD C

ST T

LD B

MUL D

ST T

LD A

ADD B

MUL T

SUB T

ST Y

a) b)^ c)

A) ( A + B ) ร— ( A + C )โ€“( B ร— D ) = AB + CA + ร— BD ร—โ€“

PUSH A PUSH B ADD PUSH A PUSH C ADD A B A+B A C A+C A A+B A A+B A+B MUL PUSH B PUSH D MUL SUB (A+B)x(A+C) B D BxD (A+B)x(A+C) - BxD (A+B)x(A+C) B (A+B)x(A+C) (A+B)x(A+C)

B,C)

a) X = 200 โ€“ 208 โ€“ 1 = โ€“9 b) X = 1111 1111 1111 0111

address field = 0

a) 3 Register Fields x 5 bits/Field = 15 bits. 32 bits - 15 bits = 17 bit. 2 17 = 131, b) 256 = 8 bits. 2 Register Fields x 5 bits/Field = 10 bits. 32 bits - 8 bits - 10 bits = 14 Memory Bits

9-13. 9-17. 9-20. 9-22. 9-24. Read and Write of the FIFO work in the following manner: Result

 - Problem Solutions โ€“ Chapter - ASC โ† ASC + 1 ASC โ† ASC โ€“ Write: M WC [ ] โ† DATA Read: DST โ† M RC [ ] - WC โ† WC + 1 RC โ† RC + - WR WC RC ASC - WR - RD - RD 
  • a) ADD R0, R4 b) , R0 = E8, C =
    • ADC R1, R5 , R1 = 33, C =
    • ADC R2, R6 , R2 = 40, C =
    • ADC R3, R7 , R3 = 3D, C = - R 1 โ† 35 + FE + R 0 โ† 8 C + 5 C - R 2 โ† D 7 + 68 + - R 3 โ† 2 B + 11 + - SHR OPP Register C - SHL - SHRA - SHLA - ROR - ROL - RORC - ROLC - Smallest Number = 0.5 ร— 2 โ€“ - Largest Number = (1 โ€“ 2โ€“26) ร— 2 + - E e (e) - +8 - +7 - +6 - +5 - +4 - +3 - +2 - +1 - โ€“1 - โ€“2 - โ€“3 - โ€“4 - โ€“5 - โ€“6 - โ€“7