Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"modulo arithmetic"”.
-
Independence in exponential fields
… and Kirby. We investigate stable-like behaviour modulo arithmetic in these classes by developing a unique independence relation for each class, and in ECF we use this relation to examine types. We provide an exposition of exponential fields that is more model theoretic and type-oriented than …
-
Robust and reliable hardware accelerator design through high-level synthesis
… solution for post-deployment error detection is modulo-3 shadow datapaths: performing lightweight shadow computations in modulo-3 space for each main computation. We leverage the binding and scheduling flexibility of high-level synthesis to detect control errors through diverse binding and …
-
Design automation for circuit reliability and energy efficiency
… merely 2.5% area overhead on average. 5) Our modulo functional units, compared to a previous approach, can achieve a 12.5% reduction in area and a 47.1% reduction in delay for a 32-bit mod-3 reducer. For modulo-15 and above, all of our modulo functional units have better area and delay than …
-
Toward high-level synthesis of reliable circuits through low-cost modulo shadow datapaths
… approach to the reliability problem for arithmetic-orientated datapaths by performing lightweight shadow computations in the mod-b space, where b is the base of our modulo residue, for each main computation. We leverage the binding and scheduling flexibility of high-level synthesis to …
-
Low-cost error detection through high-level synthesis
… One solution for circuit reliability is modulo-3 shadow datapaths: performing lightweight shadow computations in modulo-3 space for each main computation. We leverage the binding and scheduling flexibility of high-level synthesis to detect control errors through diverse binding and …