All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU138625" target="_blank" >RIV/00216305:26230/20:PU138625 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-030-45093-9_58" target="_blank" >http://dx.doi.org/10.1007/978-3-030-45093-9_58</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-45093-9_58" target="_blank" >10.1007/978-3-030-45093-9_58</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error

  • Original language description

    We present a novel method allowing one to approximate complex arithmetic circuits with formal guarantees on the worst-case relative error, abbreviated as WCRE. WCRE represents an important error metric relevant in many applications including, e.g., approximation of neural network HW architectures. The method integrates SAT-based error evaluation of approximate circuits into a verifiability-driven search algorithm based on Cartesian genetic programming. We implement the method in our framework ADAC that provides various techniques for automated design of arithmetic circuits. Our experimental evaluation shows that, in many cases, the method offers a superior scalability and allows us to construct, within a few hours, high-quality approximations (providing trade-offs between the WCRE and size) for circuits with up to 32-bit operands. As such, it significantly improves the capabilities of ADAC.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    International Conference on Computer Aided Systems Theory (EUROCAST'19)

  • ISBN

    978-3-030-45092-2

  • ISSN

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    482-490

  • Publisher name

    Springer Verlag

  • Place of publication

    Cham

  • Event location

    Las Palmas de Gran Canaria, Canary Islands

  • Event date

    Feb 17, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article