Newsgroups: comp.arch
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!sarah!bingnews!kym
From: kym@bingvaxu.cc.binghamton.edu (R. Kym Horsell)
Subject: Re: RISC integer multiply/divide (was Re: Snake)
Message-ID: <1991Apr3.232757.8020@bingvaxu.cc.binghamton.edu>
Organization: State University of New York at Binghamton
References: <6920@auspex.auspex.com> <3237@charon.cwi.nl> <MEISSNER.91Apr3133852@curley.osf.org>
Date: Wed, 3 Apr 1991 23:27:57 GMT

In article <MEISSNER.91Apr3133852@curley.osf.org> meissner@osf.org (Michael Meissner) writes:
>While it doesn't have a 32x32->64 bit multiply, the multiply unit is
>pipelined, so that you can do a 32x32->64 bit multiply in about 13
>clocks (including separating the two 32 bit numbers into 16 bit
>pieces, doing 4 pipelined multiplies, and merging the results).

But you only need 3 multiplies -- see Knuth.

-kym