Inverse Square Root

Article View: comp.dsp

Article #38

#38

From: Matthew B Bloom
Date: Fri, 30 Oct 1992 15:15

14 lines
984 bytes



I'm trying to prototype a system and need a method of obtaining an
inverse square-root from a 32 bit fixed-point number.  I only need 16
bit accuracy for the result.  I thought I could use just the high-16
bits to address a lookup PROM, but was told that my result would only be
valid for 8 bits...

What strategies could I use?  Are there any chips out there (short of a
DSP) that perform this function?  They would have to use re-iteration,
right??

Thanks for any help...

Technical Details

Message-ID: <1992Oct30.151532.7589@athena.mit.edu>

Path:

arc1-ca.pugleaf.net!sparky!uunet!elroy.jpl.nasa.gov!ames!agate!spool.mu.edu!snorkelwacker.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!mbbloom

Show Full Headers

Complete Article Headers

Newsgroups: comp.dsp
Path: arc1-ca.pugleaf.net!sparky!uunet!elroy.jpl.nasa.gov!ames!agate!spool.mu.edu!snorkelwacker.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!mbbloom
From: mbbloom@athena.mit.edu (Matthew B Bloom)
Subject: Inverse Square Root
Message-ID: <1992Oct30.151532.7589@athena.mit.edu>
Sender: news@athena.mit.edu (News system)
Nntp-Posting-Host: w20-575-81.mit.edu
Organization: Massachusetts Institute of Technology
Distribution: comp.dsp
Date: Fri, 30 Oct 1992 15:15:32 GMT
Lines: 14