Xref: utzoo comp.lsi:784 comp.sys.ibm.pc:32218
Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!cica!gatech!psuvax1!psuvm!j0s
From: J0S@PSUVM.BITNET
Newsgroups: comp.lsi,comp.sys.ibm.pc
Subject: Extended Precision 2's Complement Multiply?
Message-ID: <89208.100235J0S@PSUVM>
Date: 27 Jul 89 14:02:35 GMT
Organization: Penn State University - Center for Academic Computing
Lines: 13

I need to preform a complex times complex 2's complement integer multiply.
The machine architecture has both a 16-bit signed multiply and a 16-bit
unsigned multiply.  The real and imaginary parts of the multiplicand are
both 32-bit 2's complement integers.  The real and imaginary parts of the
multiplier are both 16-bit 2's complement integers.  The complex magnitude
of the multiplier is unity.  The real and imaginary parts of the complex
product are to be 32-bit 2's complement integers containing the most
significant bits of the intermediate products.

Do you have an efficient algorithm for this process or could point me
towards a reference?

                       Thanks, Jack W. Sharer, JWS@PSUARLC.BITNET