This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Not all spaces in the table are necessary; complete only the necessary spaces. Register Microoperation Control Signal Name Boolean Expression d. Complete the following next-state table for Booth’s multiplication algorithm. Use the state assignment IDLE = 00, MUL0 = 01, MUL1 = 10. Current state Inputs Next state M 1 M G Z M 1 + M + Draw the control unit for Booth’s algorithm using the sequence register + decoder method. D Q Q’ D O M O D Q Q’ D 1 M 1 Problem 10.6, continued e. Using the one flip-flop per state method, draw a control unit for your ASM. D Q Q’ IDLE D Q Q’ MUL0 D Q Q’ MUL1...
View Full Document
- Spring '08
- Multiplication, Boolean Algebra, Expression, English-language films, U.S. state