Ancestors

Toot

Written by Robin Green on 2024-12-01 at 16:35

Let's say you have an N×N-bit multiplier but you don't need all the bits of the result. You can generate a few extra bits (columns in the compressor tree) and faithfully round the result. But if you Booth encoded the multiplicand to half the rows in your circuit you end up with a multiplier where A×B ≠ B×A. That's hard to explain to a compiler, being commutative is important.

Lots of rounding strategies I never heard of - AND arrays, CCT, VCT, statistical predict, etc.

https://arxiv.org/abs/2404.14069

=> View attached media

=> More informations about this toot | More toots from fatlimey@mastodon.gamedev.place

Descendants

Written by Steve Canon on 2024-12-01 at 16:44

@fatlimey forget compilers, it’s hard enough to explain that to a human. 😅

=> More informations about this toot | More toots from steve@discuss.systems