8. Assignment: High-speed Multiplication of 32-bit Integer by Powers of 2

Every CPU instruction in your program must have a brief comment!
The penalty for not following this rule is 15 pts deduction...

Consider arithmetic multiplication

    product = multiplier × multiplicand

With that in mind, write a program to execute an endless loop of the following steps:
1. Ask the user to enter unsigned integer multiplier and store it as a DWORD (doubleword) value in memory.
2. Display entered doubleword in binary format.
3. Ask the user to enter three single-digit integer multiplicands and store them as BYTE-sized values k, m, and n.
  - Although single-letter identifiers are used in this problem description, it is highly advisable to employ more descriptive names in the code, such as
```
    .DATA
    k_multiplicand BYTE ?
    m_multiplicand BYTE ?
    n_multiplicand BYTE ?
```
    or an array of bytes
```
    .DATA
    multiplicand  BYTE  3  dup(?)
```
4. Use ADD and SHL instructions to calculate the product
  - multiplier × ( 2^k + 2^m + 2ⁿ )
  Please note that
  - (a) Multiplication by SHL is done in place: the product is obtained by shifting the bits of the multiplier.
  - (b) 2⁰ yields 1.
5. Display 32-bit result of the "fast multiplication" in both decimal and binary form.
6. Important (25 points deduction if not implemented): Add logic to scale input of multiplicands k, m, and n (strictly speaking, multiplicands are 2^k, 2^m, and 2ⁿ)
  - Accept input of just one, or two, or all three of the multiplicands.
  - Any solution is acceptable. You can ask the user how many multiplicands to use. Alternatively, you can check the input for a special non-digit character such as 'x' to signal the end of multiplicand input and proceed to the calculation steps using a shorter list of multiplicands.
7. Any additional features in must be thoroughly commented and will yield bonus credit pts.
What to submit:
- Submit only your ASM source (not the EXE or project.)

<<< Displaying Binary Bits

Index

>>>