---
_id: '17358'
abstract:
- lang: eng
  text: 'Approximate circuits trade-off computational accuracy against improvements
    in hardware area, delay, or energy consumption. IP core vendors who wish to create
    such circuits need to convince consumers of the resulting approximation quality.
    As a solution we propose proof-carrying approximate circuits: The vendor creates
    an approximate IP core together with a certificate that proves the approximation
    quality. The proof certificate is bundled with the approximate IP core and sent
    off to the consumer. The consumer can formally verify the approximation quality
    of the IP core at a fraction of the typical computational cost for formal verification.
    In this paper, we first make the case for proof-carrying approximate circuits
    and then demonstrate the feasibility of the approach by a set of synthesis experiments
    using an exemplary approximation framework.'
article_type: original
author:
- first_name: Linus Matthias
  full_name: Witschen, Linus Matthias
  id: '49051'
  last_name: Witschen
- first_name: Tobias
  full_name: Wiersema, Tobias
  id: '3118'
  last_name: Wiersema
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: Witschen LM, Wiersema T, Platzner M. Proof-carrying Approximate Circuits. <i>IEEE
    Transactions On Very Large Scale Integration Systems</i>. 2020;28(9):2084-2088.
    doi:<a href="https://doi.org/10.1109/TVLSI.2020.3008061">10.1109/TVLSI.2020.3008061</a>
  apa: Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2020). Proof-carrying Approximate
    Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>, <i>28</i>(9),
    2084–2088. <a href="https://doi.org/10.1109/TVLSI.2020.3008061">https://doi.org/10.1109/TVLSI.2020.3008061</a>
  bibtex: '@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate
    Circuits}, volume={28}, DOI={<a href="https://doi.org/10.1109/TVLSI.2020.3008061">10.1109/TVLSI.2020.3008061</a>},
    number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems},
    publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner,
    Marco}, year={2020}, pages={2084–2088} }'
  chicago: 'Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying
    Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i>
    28, no. 9 (2020): 2084–88. <a href="https://doi.org/10.1109/TVLSI.2020.3008061">https://doi.org/10.1109/TVLSI.2020.3008061</a>.'
  ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate
    Circuits,” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol.
    28, no. 9, pp. 2084–2088, 2020.
  mla: Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” <i>IEEE
    Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, IEEE,
    2020, pp. 2084–88, doi:<a href="https://doi.org/10.1109/TVLSI.2020.3008061">10.1109/TVLSI.2020.3008061</a>.
  short: L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large
    Scale Integration Systems 28 (2020) 2084–2088.
date_created: 2020-07-06T11:21:30Z
date_updated: 2022-01-06T06:53:09Z
department:
- _id: '78'
doi: 10.1109/TVLSI.2020.3008061
funded_apc: '1'
intvolume: '        28'
issue: '9'
keyword:
- Approximate circuit synthesis
- approximate computing
- error metrics
- formal verification
- proof-carrying hardware
language:
- iso: eng
page: 2084 - 2088
project:
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '1'
  name: SFB 901
publication: IEEE Transactions On Very Large Scale Integration Systems
publication_identifier:
  eissn:
  - 1557-9999
  issn:
  - 1063-8210
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Proof-carrying Approximate Circuits
type: journal_article
user_id: '49051'
volume: 28
year: '2020'
...
---
_id: '16853'
abstract:
- lang: eng
  text: State-of-the-art frameworks for generating approximate circuits usually rely
    on information gained through circuit synthesis and/or verification to explore
    the search space and to find an optimal solution. Throughout the process, a large
    number of circuits may be subject to processing, leading to considerable runtimes.
    In this work, we propose a search which takes error bounds and pre-computed impact
    factors into account to reduce the number of invoked synthesis and verification
    processes. In our experimental results, we achieved speed-ups of up to 76x while
    area savings remain comparable to the reference search method, simulated annealing.
author:
- first_name: Linus Matthias
  full_name: Witschen, Linus Matthias
  id: '49051'
  last_name: Witschen
- first_name: Hassan
  full_name: Ghasemzadeh Mohammadi, Hassan
  id: '61186'
  last_name: Ghasemzadeh Mohammadi
- first_name: Matthias
  full_name: Artmann, Matthias
  last_name: Artmann
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop
    on Approximate Computing (AxC 2019)</i>.'
  apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M.
    (n.d.). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.
    <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.'
  bibtex: '@article{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner, title={Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits}, journal={Fourth Workshop
    on Approximate Computing (AxC 2019)}, author={Witschen, Linus Matthias and Ghasemzadeh
    Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco} }'
  chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann,
    and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate
    Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>, n.d.'
  ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump
    Search: A Fast Technique for the Synthesis of Approximate Circuits,” <i>Fourth
    Workshop on Approximate Computing (AxC 2019)</i>. .'
  mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis
    of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.'
  short: L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth
    Workshop on Approximate Computing (AxC 2019) (n.d.).
date_created: 2020-04-25T08:02:07Z
date_updated: 2022-01-06T06:52:57Z
ddc:
- '006'
department:
- _id: '78'
file:
- access_level: closed
  content_type: application/pdf
  creator: witschen
  date_created: 2020-04-25T08:00:35Z
  date_updated: 2020-04-25T08:00:35Z
  file_id: '16854'
  file_name: AxC19_paper_3.pdf
  file_size: 152806
  relation: main_file
  success: 1
file_date_updated: 2020-04-25T08:00:35Z
has_accepted_license: '1'
keyword:
- Approximate computing
- parameter selection
- search space exploration
- verification
- circuit synthesis
language:
- iso: eng
page: '2'
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Fourth Workshop on Approximate Computing (AxC 2019)
publication_status: accepted
status: public
title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits'
type: preprint
user_id: '49051'
year: '2019'
...
---
_id: '10577'
abstract:
- lang: eng
  text: "State-of-the-art frameworks for generating approximate circuits automatically
    explore the search space in an iterative process - often greedily. Synthesis and
    verification processes are invoked in each iteration to evaluate the found solutions
    and to guide the search algorithm. As a result, a large number of approximate
    circuits is subjected to analysis - leading to long runtimes - but only a few
    approximate circuits might form an acceptable solution.\r\n\r\nIn this paper,
    we present our Jump Search (JS) method which seeks to reduce the runtime of an
    approximation process by reducing the number of expensive synthesis and verification
    steps. To reduce the runtime, JS computes impact factors for each approximation
    candidate in the circuit to create a selection of approximate circuits without
    invoking synthesis or verification processes. We denote the selection as path
    from which JS determines the final solution. In our experimental results, JS achieved
    speed-ups of up to 57x while area savings remain comparable to the reference search
    method, Simulated Annealing."
author:
- first_name: Linus Matthias
  full_name: Witschen, Linus Matthias
  id: '49051'
  last_name: Witschen
- first_name: Hassan
  full_name: Ghasemzadeh Mohammadi, Hassan
  id: '61186'
  last_name: Ghasemzadeh Mohammadi
- first_name: Matthias
  full_name: Artmann, Matthias
  last_name: Artmann
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits. In: <i>Proceedings
    of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY,
    USA: ACM; 2019. doi:<a href="https://doi.org/10.1145/3299874.3317998">10.1145/3299874.3317998</a>'
  apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M.
    (2019). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.
    In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>.
    New York, NY, USA: ACM. <a href="https://doi.org/10.1145/3299874.3317998">https://doi.org/10.1145/3299874.3317998</a>'
  bibtex: '@inproceedings{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner_2019, place={New
    York, NY, USA}, title={Jump Search: A Fast Technique for the Synthesis of Approximate
    Circuits}, DOI={<a href="https://doi.org/10.1145/3299874.3317998">10.1145/3299874.3317998</a>},
    booktitle={Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI
    ’19}, publisher={ACM}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi,
    Hassan and Artmann, Matthias and Platzner, Marco}, year={2019} }'
  chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann,
    and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate
    Circuits.” In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI
    ’19</i>. New York, NY, USA: ACM, 2019. <a href="https://doi.org/10.1145/3299874.3317998">https://doi.org/10.1145/3299874.3317998</a>.'
  ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump
    Search: A Fast Technique for the Synthesis of Approximate Circuits,” in <i>Proceedings
    of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>, Tysons Corner,
    VA, USA, 2019.'
  mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis
    of Approximate Circuits.” <i>Proceedings of the 2019 on Great Lakes Symposium
    on VLSI  - GLSVLSI ’19</i>, ACM, 2019, doi:<a href="https://doi.org/10.1145/3299874.3317998">10.1145/3299874.3317998</a>.'
  short: 'L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, in: Proceedings
    of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19, ACM, New York, NY,
    USA, 2019.'
conference:
  end_date: 2019-05-11
  location: Tysons Corner, VA, USA
  name: ACM Great Lakes Symposium on VLSI (GLSVLSI)
  start_date: 2019-05-09
date_created: 2019-07-08T15:13:10Z
date_updated: 2022-01-06T06:50:45Z
department:
- _id: '78'
doi: 10.1145/3299874.3317998
keyword:
- Approximate computing
- design automation
- parameter selection
- circuit synthesis
language:
- iso: eng
place: New York, NY, USA
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI '19
publication_identifier:
  isbn:
  - '9781450362528'
publication_status: published
publisher: ACM
status: public
title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits'
type: conference
user_id: '49051'
year: '2019'
...