Page 1 of 1
9. (a) [4 pts] We are designing an 8-bit ripple carry adder (RCA) with Aol gates (4-input max.). What are the complexity
Posted: Sat May 14, 2022 8:08 pm
by answerhappygod
- 9 A 4 Pts We Are Designing An 8 Bit Ripple Carry Adder Rca With Aol Gates 4 Input Max What Are The Complexity 1 (40.68 KiB) Viewed 69 times
9. (a) [4 pts] We are designing an 8-bit ripple carry adder (RCA) with Aol gates (4-input max.). What are the complexity and the delay for the carry (Ca) and the sum (S2)2 [**You don't need to draw a 32-bit RCA] (b) [4 pts] Below table is for a Moore sequential logic to design a sequence detector. Now you need to implement the logic with a programmable ROM as shown in the Figure. What are the contents of the ROM? P.S. Inputs 0 PROM Next state State SO S1 N.S X=0 X=1 Output SO S1 0 S2 S1 0 SO S1 1 S1 SO 2830 State Reg Outputs S2 dock S3 0 () [2 pts] You need to fetch a 32-bit MIPS instruction from memory. How many memory locations do you need to access to get an instruction?