Sökning: "floating-point arithmetic"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden floating-point arithmetic.

1. 1. From Machine Arithmetic to Approximations and back again : Improved SMT Methods for Numeric Data Types

   Författare :Aleksandar Zeljic; Philipp Ruemmer; Christoph M. Wintersteiger; Yi Wang; Armin Biere; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; SMT; Model construction; Approximations; floating-point arithmetic; machine arithmetic; bit-vectors; Computer Science; Datavetenskap;

   Sammanfattning : Safety-critical systems, especially those found in avionics and automotive industries, rely on machine arithmetic to perform their tasks: integer arithmetic, fixed-point arithmetic or floating-point arithmetic (FPA). Machine arithmetic exhibits subtle differences in behavior compared to the ideal mathematical arithmetic, due to fixed-size representation in memory. LÄS MER

3. 2. Performance and Energy Efficient Building Blocks for Network-on-Chip Architectures

   Författare :Sriram R. Vangal; Atila Alvandpour; Viktor Öwall; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Network-on-Chip Architectures; floating-point units; tiled-architectures; crossbar routers; multi-processor interconnection; Computer engineering; Datorteknik;

   Sammanfattning : The ever shrinking size of the MOS transistors brings the promise of scalable Network-on-Chip (NoC) architectures containing hundreds of processing elements with on-chip communication, all integrated into a single die. Such a computational fabric will provide high levels of performance in an energy efficient manner. LÄS MER

4. 3. Approximations and abstractions for reasoning about machine arithmetic

   Författare :Aleksandar Zeljic; Philipp Rümmer; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

   Sammanfattning : Safety-critical systems rely on various forms of machine arithmetic to perform their tasks: integer arithmetic, fixed-point arithmetic or floating-point arithmetic. The problem with machine arithmetic is that it can exhibit subtle differences in behavior compared to the ideal mathematical arithmetic, due to fixed-size representation in memory. LÄS MER

5. 4. Quantifiers and Theories : A Lazy Approach

   Författare :Peter Backeman; Philipp Rümmer; Jie-Hong Roland Jiang; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Automated Reasoning; Automated Theorem Proving; SMT; Unification; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

   Sammanfattning : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. LÄS MER

7. 5. Aspects of system-on-chip design for FPGAs

   Författare :Andreas Ehliar; Lars Svensson; Linköpings universitet; []
   Nyckelord :TECHNOLOGY; TEKNIKVETENSKAP;

   Sammanfattning : Due to the increasing NRE costs of recent ASICs, the use of FPGAs is expected to continue to increase. While the first FPGAs were limited devices useful mainly for glue logic, todays FPGAs are highly capable devices used in many different application areas including telecommunication, multimedia, medical, and automotive. LÄS MER