Web code:
Last name:
First name:
ECE 267 - Computer Organization and Programming
Homework #4
(Attach a typed version of your assembly language code for each part to this cover sheet; you need not run the code to
see if it actually works but this is recommended in order to get the bugs out.)
Write an IA-32 assembly language procedure "Find_Complex_Square_Root" that
performs m iterations of the following recursion1 to estimate 2xym≅ (where x and y
are complex numbers):
+=
−
−1
1
2
1
n
nn y
x
yy
Pass parameters xreal, ximag in EAX and EBX as REAL4 codes; pass m in ECX as an
unsigned integer code. Return yreal, yimag in EAX and EBX as REAL4 codes
(overwriting x). Initialize y0 = x.
Be sure to save and then restore the contents of all registers that are used for temporary
storage. A description of the floating-point coprocessor is found in our textbook's Ch.17
on the CDROM; another excellent source is Chapter 14 of the on-line text "Art of
Assembly Language" by Randall Hyde:
http://webster.cs.ucr.edu/AoA/DOS/AoADosIndex.html
1 This is the Newton-Raphson method of recursively solving for the k-th root of a number
