Difference between revisions of "Instruction Set/roots"

From Mill Computing Wiki
Jump to: navigation, search
m (Protected "Instruction Set/roots": generated ([Edit=<protect-level-bot>] (indefinite) [Move=<protect-level-bot>] (indefinite)))
Line 4:Line 4:
 
</div>
 
</div>
  
square root
+
Signed integer square root. Helper operation for software square root implementation.
 +
 
 +
This operation creates a seed value for Newton-Rapheson, or other, iterative methods.
 +
 
 
----
 
----
 
<code style="font-size:130%"><b style="color:#050">roots</b>(<span style="color:#009">[[Domains#s|s]]</span> <span title="belt operand from ops window">x</span>) &#8594; [[Domains#s|s]] r<sub>0</sub></code>
 
<code style="font-size:130%"><b style="color:#050">roots</b>(<span style="color:#009">[[Domains#s|s]]</span> <span title="belt operand from ops window">x</span>) &#8594; [[Domains#s|s]] r<sub>0</sub></code>

Revision as of 10:46, 19 January 2015

realizing  exu stream  exu block  compute phase   operation   in the signed integer value domain   that produces condition codes

native on: all

Signed integer square root. Helper operation for software square root implementation.

This operation creates a seed value for Newton-Rapheson, or other, iterative methods.


roots(s x) → s r0

operands: like Identity [xx:x]


Core In Slots Latencies
Tin E0 b:b=1 bv:bv=1 h:h=1 hv:hv=1 w:w=1 wv:wv=1 d:d=2 dv:dv=2 q:q=2 qv:qv=2
Copper E0 E1 b:b=1 bv:bv=1 h:h=1 hv:hv=1 w:w=1 wv:wv=1 d:d=2 dv:dv=2 q:q=2 qv:qv=2
Silver E0 E1 E2 E3 b:b=1 bv:bv=1 h:h=1 hv:hv=1 w:w=1 wv:wv=1 d:d=2 dv:dv=2 q:q=2 qv:qv=2
Gold E0 E1 E2 E3 E4 E5 E6 E7 b:b=1 bv:bv=1 h:h=1 hv:hv=1 w:w=1 wv:wv=1 d:d=2 dv:dv=2 q:q=2 qv:qv=2
Decimal8 E0 E1 E2 E3 b:b=1 bv:bv=1 h:h=1 hv:hv=1 w:w=1 wv:wv=1 d:d=2 dv:dv=2 q:q=2 qv:qv=2
Decimal16 E0 E1 E2 E3 b:b=1 bv:bv=1 h:h=1 hv:hv=1 w:w=1 wv:wv=1 d:d=2 dv:dv=2 q:q=2 qv:qv=2


Instruction Set, alphabetical, Instruction Set by Category, Instruction Set, sortable, filterable