src/add/fsqrt.py

   1 from sfpy import Float32
   2
   3
   4 # XXX DO NOT USE, fails on num=65536.  wark-wark...
   5 def sqrtsimple(num):
   6     res = 0
   7     bit = 1
   8
   9     while (bit < num):
  10         bit <<= 2
  11
  12     while (bit != 0):
  13         if (num >= res + bit):
  14             num -= res + bit
  15             res = (res >> 1) + bit
  16         else:
  17             res >>= 1
  18         bit >>= 2
  19
  20     return res
  21
  22
  23 def sqrt(num):
  24     D = num # D is input (from num)
  25     Q = 0
  26     R = 0
  27     r = 0 # remainder
  28     for i in range(15, -1, -1): # negative ranges are weird...
  29
  30         if (R>=0):
  31
  32             R = (R<<2)|((D>>(i+i))&3)
  33             R = R-((Q<<2)|1) #/*-Q01*/
  34
  35         else:
  36
  37             R = (R<<2)|((D>>(i+i))&3)
  38             R = R+((Q<<2)|3) #/*+Q11*/
  39
  40         if (R>=0):
  41             Q = (Q<<1)|1 #/*new Q:*/
  42         else:
  43             Q = (Q<<1)|0 #/*new Q:*/
  44
  45
  46     if (R<0):
  47         R = R+((Q<<1)|1)
  48         r = R
  49     return Q
  50
  51
  52 # grabbed these from unit_test_single (convenience, this is just experimenting)
  53
  54 def get_mantissa(x):
  55     return 0x7fffff & x
  56
  57 def get_exponent(x):
  58     return ((x & 0x7f800000) >> 23) - 127
  59
  60 def set_exponent(x, e):
  61     return (x & ~0x7f800000) | ((e+127) << 23)
  62
  63 def get_sign(x):
  64     return ((x & 0x80000000) >> 31)
  65
  66 # convert FP32 to s/e/m
  67 def create_fp32(s, e, m):
  68     """ receive sign, exponent, mantissa, return FP32 """
  69     return set_exponent((s << 31) | get_mantissa(m))
  70
  71 # convert s/e/m to FP32
  72 def decode_fp32(x):
  73     """ receive FP32, return sign, exponent, mantissa """
  74     return get_sign(x), get_exponent(x), get_mantissa(x)
  75
  76
  77 # main function, takes mantissa and exponent as separate arguments
  78 # returns a tuple, sqrt'd mantissa, sqrt'd exponent
  79
  80 def main(mantissa, exponent):
  81     if exponent & 1 != 0:
  82         # shift mantissa up, subtract 1 from exp to compensate
  83         return sqrt(mantissa << 1), (exponent - 1) >> 1
  84     # mantissa as-is, no compensating needed on exp
  85     return sqrt(mantissa), (exponent >> 1)
  86
  87
  88 if __name__ == '__main__':
  89
  90     # quick test up to 1000 of two sqrt functions
  91     for Q in range(1, int(1e4)):
  92         print(Q, sqrt(Q), sqrtsimple(Q), int(Q**0.5))
  93         assert int(Q**0.5) == sqrtsimple(Q), "Q sqrtsimpl fail %d" % Q
  94         assert int(Q**0.5) == sqrt(Q), "Q sqrt fail %d" % Q
  95
  96     # quick mantissa/exponent demo
  97     for e in range(26):
  98         for m in range(26):
  99             ms, es = main(m, e)
 100             print("m:%d e:%d sqrt: m:%d e:%d" % (m, e, ms, es))
 101
 102
 103
 104 x = Float32(1234.123456789)
 105 xbits = x.bits
 106
 107
 108 print(decode_fp32(x))
 109 """
 110
 111 Notes:
 112 https://pdfs.semanticscholar.org/5060/4e9aff0e37089c4ab9a376c3f35761ffe28b.pdf
 113
 114 //This is the main code of integer sqrt function found here:http://verilogcodes.blogspot.com/2017/11/a-verilog-function-for-finding-square-root.html
 115 //
 116
 117 module testbench;
 118
 119 reg [15:0] sqr;
 120
 121 //Verilog function to find square root of a 32 bit number.
 122 //The output is 16 bit.
 123 function [15:0] sqrt;
 124     input [31:0] num;  //declare input
 125     //intermediate signals.
 126     reg [31:0] a;
 127     reg [15:0] q;
 128     reg [17:0] left,right,r;
 129     integer i;
 130 begin
 131     //initialize all the variables.
 132     a = num;
 133     q = 0;
 134     i = 0;
 135     left = 0;   //input to adder/sub
 136     right = 0;  //input to adder/sub
 137     r = 0;  //remainder
 138     //run the calculations for 16 iterations.
 139     for(i=0;i<16;i=i+1) begin
 140         right = {q,r[17],1'b1};
 141         left = {r[15:0],a[31:30]};
 142         a = {a[29:0],2'b00};    //left shift by 2 bits.
 143         if (r[17] == 1) //add if r is negative
 144             r = left + right;
 145         else    //subtract if r is positive
 146             r = left - right;
 147         q = {q[14:0],!r[17]};
 148     end
 149     sqrt = q;   //final assignment of output.
 150 end
 151 endfunction //end of Function
 152
 153
 154 c version (from paper linked from URL)
 155
 156 unsigned squart(D, r) /*Non-Restoring sqrt*/
 157     unsigned D; /*D:32-bit unsigned integer to be square rooted */
 158     int *r;
 159 {
 160     unsigned Q = 0; /*Q:16-bit unsigned integer (root)*/
 161     int R = 0; /*R:17-bit integer (remainder)*/
 162     int i;
 163     for (i = 15;i>=0;i--) /*for each root bit*/
 164     {
 165         if (R>=0)
 166         { /*new remainder:*/
 167             R = R<<2)|((D>>(i+i))&3);
 168             R = R-((Q<<2)|1); /*-Q01*/
 169         }
 170         else
 171         { /*new remainder:*/
 172             R = R<<2)|((D>>(i+i))&3);
 173             R = R+((Q<<2)|3); /*+Q11*/
 174         }
 175         if (R>=0) Q = Q<<1)|1; /*new Q:*/
 176         else Q = Q<<1)|0; /*new Q:*/
 177     }
 178
 179     /*remainder adjusting*/
 180     if (R<0) R = R+((Q<<1)|1);
 181     *r = R; /*return remainder*/
 182     return(Q); /*return root*/
 183 }
 184
 185 From wikipedia page:
 186
 187 short isqrt(short num) {
 188     short res = 0;
 189     short bit = 1 << 14; // The second-to-top bit is set: 1 << 30 for 32 bits
 190
 191     // "bit" starts at the highest power of four <= the argument.
 192     while (bit > num)
 193         bit >>= 2;
 194
 195     while (bit != 0) {
 196         if (num >= res + bit) {
 197             num -= res + bit;
 198             res = (res >> 1) + bit;
 199         }
 200         else
 201             res >>= 1;
 202         bit >>= 2;
 203     }
 204     return res;
 205 }
 206
 207 """