The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
i want the answer of this homework please , Q1:Â You are about to implement an arithmetic unsigned shift multiplier for 68K machine that multiplies two 8-bits
unsigned integers stored in memory locations 100 and 200 and place the result in memory location 300. Use a
variant of the shift-add algorithm shown in the figure to perform your multiplication. Run your program on several
simple test cases to be sure it works. ( the figure is attached below )
Â
Jordan University of Science and TechnologyFaculty of Computer and Information TechnologyCPE351MICROPROCESSORByDr. Saleh Abdel-hafeezDue:March 1, 2012HW #3 : Programming of Data Storage and Bit manipulation for 68K μP1. You are about to implement an arithmetic unsigned shift multiplier for 68K machine, that multiplies two8-bits unsigned integers stored in D0 and D1 and places the result in D3. Use a variant of the shift-addalgorithm shown in the figure to perform your multiplication. Run your program on several simple testcases to be sure it works. In order to check the multiplier code, multiply 7FHx 02H, then try A1Hx 12H.Hand in1.Code2..L68 file3.Simulator screen output results for given three input patterns1000100110000000000010001001000StartTestMultiplierLSBLSB = 0LSB = 1Add Multiplicand to Product andPlace results in productShift MultiplicandRegister left 1 bitShift Multiplier RegisterRight 1 bit16repetitionsDoneSimple Example:MultiplicandMultiplierProduct
Attachments:
-----------