Detail publikace

Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error

MATYÁŠ, J. PANKUCH, A. VOJNAR, T. ČEŠKA, M. ČEŠKA, M.

Originální název

Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error

Anglický název

Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

Dokumenty

BibTex


@inproceedings{BUT168134,
  author="Jiří {Matyáš} and Adam {Pankuch} and Tomáš {Vojnar} and Milan {Češka} and Milan {Češka}",
  title="Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error",
  annote="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.",
  address="Springer Verlag",
  booktitle="International Conference on Computer Aided Systems Theory (EUROCAST'19)",
  chapter="168134",
  doi="10.1007/978-3-030-45093-9_58",
  edition="Lecture Notes in Computer Science",
  howpublished="print",
  institution="Springer Verlag",
  year="2020",
  month="april",
  pages="482--490",
  publisher="Springer Verlag",
  type="conference paper"
}