src/add/fsqrt.py

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