1 # IEEE Floating Point Adder (Single Precision)
2 # Copyright (C) Jonathan P Dawson 2013
5 from nmigen
import Module
, Signal
, Cat
, Const
6 from nmigen
.cli
import main
, verilog
10 """ Floating-point Number Class, variable-width TODO (currently 32-bit)
12 Contains signals for an incoming copy of the value, decoded into
13 sign / exponent / mantissa.
14 Also contains encoding functions, creation and recognition of
15 zero, NaN and inf (all signed)
17 Four extra bits are included in the mantissa: the top bit
18 (m[-1]) is effectively a carry-overflow. The other three are
19 guard (m[2]), round (m[1]), and sticky (m[0])
21 def __init__(self
, width
, m_width
=None):
24 m_width
= width
- 5 # mantissa extra bits (top,guard,round)
25 self
.v
= Signal(width
) # Latched copy of value
26 self
.m
= Signal(m_width
) # Mantissa
27 self
.e
= Signal((10, True)) # Exponent: 10 bits, signed
28 self
.s
= Signal() # Sign bit
30 self
.mzero
= Const(0, (m_width
, False))
31 self
.m1s
= Const(-1, (m_width
, False))
32 self
.P128
= Const(128, (10, True))
33 self
.P127
= Const(127, (10, True))
34 self
.N127
= Const(-127, (10, True))
35 self
.N126
= Const(-126, (10, True))
38 """ decodes a latched value into sign / exponent / mantissa
40 bias is subtracted here, from the exponent. exponent
41 is extended to 10 bits so that subtract 127 is done on
45 return [self
.m
.eq(Cat(0, 0, 0, v
[0:23])), # mantissa
46 self
.e
.eq(v
[23:31] - self
.P127
), # exp (minus bias)
47 self
.s
.eq(v
[31]), # sign
50 def create(self
, s
, e
, m
):
51 """ creates a value from sign / exponent / mantissa
53 bias is added here, to the exponent
56 self
.v
[31].eq(s
), # sign
57 self
.v
[23:31].eq(e
+ self
.P127
), # exp (add on bias)
58 self
.v
[0:23].eq(m
) # mantissa
62 """ shifts a mantissa down by one. exponent is increased to compensate
64 accuracy is lost as a result in the mantissa however there are 3
65 guard bits (the latter of which is the "sticky" bit)
67 return [self
.e
.eq(self
.e
+ 1),
68 self
.m
.eq(Cat(self
.m
[0] | self
.m
[1], self
.m
[2:], 0))
72 return self
.create(s
, self
.P128
, 1<<22)
75 return self
.create(s
, self
.P128
, 0)
78 return self
.create(s
, self
.N127
, 0)
81 return (self
.e
== self
.P128
) & (self
.m
!= 0)
84 return (self
.e
== self
.P128
) & (self
.m
== 0)
87 return (self
.e
== self
.N127
) & (self
.m
== self
.mzero
)
89 def is_overflowed(self
):
90 return (self
.e
> self
.P127
)
92 def is_denormalised(self
):
93 return (self
.e
== self
.N126
) & (self
.m
[23] == 0)
96 def __init__(self
, width
):
99 self
.v
= Signal(width
)
104 return [self
.v
, self
.stb
, self
.ack
]
109 self
.guard
= Signal() # tot[2]
110 self
.round_bit
= Signal() # tot[1]
111 self
.sticky
= Signal() # tot[0]
115 def __init__(self
, width
):
118 self
.in_a
= FPOp(width
)
119 self
.in_b
= FPOp(width
)
120 self
.out_z
= FPOp(width
)
122 def get_op(self
, m
, op
, v
, next_state
):
123 with m
.If((op
.ack
) & (op
.stb
)):
130 m
.d
.sync
+= op
.ack
.eq(1)
132 def normalise_1(self
, m
, z
, of
, next_state
):
133 with m
.If((z
.m
[-1] == 0) & (z
.e
> z
.N126
)):
135 z
.e
.eq(z
.e
- 1), # DECREASE exponent
136 z
.m
.eq(z
.m
<< 1), # shift mantissa UP
137 z
.m
[0].eq(of
.guard
), # steal guard bit (was tot[2])
138 of
.guard
.eq(of
.round_bit
), # steal round_bit (was tot[1])
139 of
.round_bit
.eq(0), # reset round bit
144 def get_fragment(self
, platform
=None):
148 a
= FPNum(self
.width
)
149 b
= FPNum(self
.width
)
150 z
= FPNum(self
.width
, 24)
152 tot
= Signal(28) # sticky/round/guard bits, 23 result, 1 overflow
161 with m
.State("get_a"):
162 self
.get_op(m
, self
.in_a
, a
.v
, "get_b")
167 with m
.State("get_b"):
168 self
.get_op(m
, self
.in_b
, b
.v
, "unpack")
171 # unpacks operands into sign, mantissa and exponent
173 with m
.State("unpack"):
174 m
.next
= "special_cases"
175 m
.d
.sync
+= a
.decode()
176 m
.d
.sync
+= b
.decode()
179 # special cases: NaNs, infs, zeros, denormalised
181 with m
.State("special_cases"):
183 # if a is NaN or b is NaN return NaN
184 with m
.If(a
.is_nan() | b
.is_nan()):
188 # if a is inf return inf (or NaN)
189 with m
.Elif(a
.is_inf()):
191 m
.d
.sync
+= z
.inf(a
.s
)
192 # if a is inf and signs don't match return NaN
193 with m
.If((b
.e
== b
.P128
) & (a
.s
!= b
.s
)):
194 m
.d
.sync
+= z
.nan(b
.s
)
196 # if b is inf return inf
197 with m
.Elif(b
.is_inf()):
199 m
.d
.sync
+= z
.inf(b
.s
)
201 # if a is zero and b zero return signed-a/b
202 with m
.Elif(a
.is_zero() & b
.is_zero()):
204 m
.d
.sync
+= z
.create(a
.s
& b
.s
, b
.e
[0:8], b
.m
[3:-1])
206 # if a is zero return b
207 with m
.Elif(a
.is_zero()):
209 m
.d
.sync
+= z
.create(b
.s
, b
.e
[0:8], b
.m
[3:-1])
211 # if b is zero return a
212 with m
.Elif(b
.is_zero()):
214 m
.d
.sync
+= z
.create(a
.s
, a
.e
[0:8], a
.m
[3:-1])
216 # Denormalised Number checks
219 # denormalise a check
220 with m
.If(a
.e
== a
.N127
):
221 m
.d
.sync
+= a
.e
.eq(-126) # limit a exponent
223 m
.d
.sync
+= a
.m
[-1].eq(1) # set top mantissa bit
224 # denormalise b check
225 with m
.If(b
.e
== a
.N127
):
226 m
.d
.sync
+= b
.e
.eq(-126) # limit b exponent
228 m
.d
.sync
+= b
.m
[-1].eq(1) # set top mantissa bit
231 # align. NOTE: this does *not* do single-cycle multi-shifting,
232 # it *STAYS* in the align state until the exponents match
234 with m
.State("align"):
235 # exponent of a greater than b: increment b exp, shift b mant
236 with m
.If(a
.e
> b
.e
):
237 m
.d
.sync
+= b
.shift_down()
238 # exponent of b greater than a: increment a exp, shift a mant
239 with m
.Elif(a
.e
< b
.e
):
240 m
.d
.sync
+= a
.shift_down()
241 # exponents equal: move to next stage.
246 # First stage of add. covers same-sign (add) and subtract
247 # special-casing when mantissas are greater or equal, to
248 # give greatest accuracy.
250 with m
.State("add_0"):
252 m
.d
.sync
+= z
.e
.eq(a
.e
)
253 # same-sign (both negative or both positive) add mantissas
254 with m
.If(a
.s
== b
.s
):
259 # a mantissa greater than b, use a
260 with m
.Elif(a
.m
>= b
.m
):
265 # b mantissa greater than a, use b
273 # Second stage of add: preparation for normalisation.
274 # detects when tot sum is too big (tot[27] is kinda a carry bit)
276 with m
.State("add_1"):
277 m
.next
= "normalise_1"
278 # tot[27] gets set when the sum overflows. shift result down
283 of
.round_bit
.eq(tot
[2]),
284 of
.sticky
.eq(tot
[1] | tot
[0]),
292 of
.round_bit
.eq(tot
[1]),
297 # First stage of normalisation.
298 # NOTE: just like "align", this one keeps going round every clock
299 # until the result's exponent is within acceptable "range"
300 # NOTE: the weirdness of reassigning guard and round is due to
301 # the extra mantissa bits coming from tot[0..2]
303 with m
.State("normalise_1"):
304 self
.normalise_1(m
, z
, of
, "normalise_2")
307 # Second stage of normalisation.
308 # NOTE: just like "align", this one keeps going round every clock
309 # until the result's exponent is within acceptable "range"
310 # NOTE: the weirdness of reassigning guard and round is due to
311 # the extra mantissa bits coming from tot[0..2]
313 with m
.State("normalise_2"):
314 with m
.If(z
.e
< z
.N126
):
316 z
.e
.eq(z
.e
+ 1), # INCREASE exponent
317 z
.m
.eq(z
.m
>> 1), # shift mantissa DOWN
319 of
.round_bit
.eq(of
.guard
),
320 of
.sticky
.eq(of
.sticky | of
.round_bit
)
328 with m
.State("round"):
329 m
.next
= "corrections"
330 with m
.If(of
.guard
& (of
.round_bit | of
.sticky | z
.m
[0])):
331 m
.d
.sync
+= z
.m
.eq(z
.m
+ 1) # mantissa rounds up
332 with m
.If(z
.m
== z
.m1s
): # all 1s
333 m
.d
.sync
+= z
.e
.eq(z
.e
+ 1) # exponent rounds up
338 with m
.State("corrections"):
340 # denormalised, correct exponent to zero
341 with m
.If(z
.is_denormalised()):
342 m
.d
.sync
+= z
.m
.eq(-127)
343 # FIX SIGN BUG: -a + a = +0.
344 with m
.If((z
.e
== z
.N126
) & (z
.m
[0:] == 0)):
345 m
.d
.sync
+= z
.s
.eq(0)
350 with m
.State("pack"):
352 # if overflow occurs, return inf
353 with m
.If(z
.is_overflowed()):
356 m
.d
.sync
+= z
.create(z
.s
, z
.e
, z
.m
)
361 with m
.State("put_z"):
363 self
.out_z
.stb
.eq(1),
366 with m
.If(self
.out_z
.stb
& self
.out_z
.ack
):
367 m
.d
.sync
+= self
.out_z
.stb
.eq(0)
373 if __name__
== "__main__":
374 alu
= FPADD(width
=32)
375 main(alu
, ports
=alu
.in_a
.ports() + alu
.in_b
.ports() + alu
.out_z
.ports())
378 # works... but don't use, just do "python fname.py convert -t v"
379 #print (verilog.convert(alu, ports=[
380 # ports=alu.in_a.ports() + \
381 # alu.in_b.ports() + \