Re: computation of square root & reciprocal calculation
- From: vladimir@xxxxxxxxx
- Date: 9 Apr 2006 20:22:02 -0700
And about the reciprocal square root of X according
to CORDIC (or more precisely speaking to digit-by-digit method).
One should multiply X to the (1+2**-i)(1+2**-i) or to the
(1-2**-i)(1-2**-i)
depends on correspondingly less or more than 1 the current value of X.
i = 1,2,...n (n= word length) and 0,5 <X <1,5
Simultaneously one should multiply Y correspondingly to the (1+2**-i)
or to the (1-2**-i).
And after n iterations : the result X is 1 with the n-bit accuracy.
and the result Y is the reciprocal square root of X.
.
- References:
- computation of square root & reciprocal calculation
- From: comparch_gene
- Re: computation of square root & reciprocal calculation
- From: Nick Maclaren
- Re: computation of square root & reciprocal calculation
- From: Terje Mathisen
- Re: computation of square root & reciprocal calculation
- From: vladimir
- Re: computation of square root & reciprocal calculation
- From: vladimir
- Re: computation of square root & reciprocal calculation
- From: comparch_gene
- Re: computation of square root & reciprocal calculation
- From: Norbert Juffa
- Re: computation of square root & reciprocal calculation
- From: glen herrmannsfeldt
- computation of square root & reciprocal calculation
- Prev by Date: Re: computation of square root & reciprocal calculation
- Next by Date: Re: computation of square root & reciprocal calculation
- Previous by thread: Re: computation of square root & reciprocal calculation
- Next by thread: Re: computation of square root & reciprocal calculation
- Index(es):