Path: utzoo!attcan!uunet!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!uakari.primate.wisc.edu!caesar.cs.montana.edu!ogicse!decwrl!orc!mipos3!mipos2!jsweedle
From: jsweedle@mipos2.intel.com (Jonathan Sweedler)
Newsgroups: comp.arch
Subject: Re: 68040
Keywords: need data
Message-ID: <1593@mipos3.intel.com>
Date: 7 Feb 90 16:32:56 GMT
References: <851@trane.UUCP> <7793@quick.COM> <5120@crdgw1.crd.ge.com> <1224@m3.mfci.UUCP>
Sender: news@mipos3.intel.com
Reply-To: jsweedle@mipos2.UUCP (Jonathan Sweedler)
Organization: Microprocessor Component Group, Intel Corp., Santa Clara, CA
Lines: 18

In article <1224@m3.mfci.UUCP> colwell@mfci.UUCP (Robert Colwell) writes:
>
>An array divider?  Are you sure?  That's a new one on me.  Who
>does division this way?  

Take a look at "Computer Arithmetic - Principles, Architecture and Design"
by Kai Hwang.  Chapter 8 is entitled "Convergence Division and Cellular
Array Dividers."

Also, if you take a look at the November issue of High Performance
Systems, there is an article called "Advancing the Standard" by Tom
Brightman of Cyrix Corp.  He claims that Cyrix has a method for doing
"radix 128k" division and square root.  This gives 17 bits per iteration
(note, this isn't per cycle).  This method uses the multiply array.
===============================================================================
Jonathan Sweedler, Microprocessor Design, Intel Corp.
UUCP: {decwrl,hplabs,oliveb}!intelca!mipos3!mipos2!jsweedle
ARPA: jsweedle%mipos2.intel.com@relay.cs.net