-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCITATION.cff
More file actions
36 lines (36 loc) · 1.48 KB
/
CITATION.cff
File metadata and controls
36 lines (36 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
cff-version: 1.2.0
title: FV-LIDAC
message: >-
If you want to cite this library, please use the metadata from this file.
type: software
authors:
- given-names: Sallar
family-names: Ahmadi-Pour
email: sallar@uni-bremen.de
affiliation: University of Bremen
orcid: 'https://orcid.org/0000-0003-4000-6207'
- given-names: Sajjad
family-names: Parvin
email: parvin@uni-bremen.de
affiliation: University of Bremen
orcid: 'https://orcid.org/0000-0002-3069-8791'
- given-names: Chandan Kumar
family-names: Jha
email: chajha@uni-bremen.de
affiliation: University of Bremen
orcid: 'https://orcid.org/0000-0001-9490-4470'
- given-names: Rolf
family-names: Drechsler
email: drechsler@uni-bremen.de
affiliation: University of Bremen
orcid: 'https://orcid.org/0000-0002-9872-1740'
identifiers:
- type: doi
value: 10.1145/3744710
description: >-
FV-LIDAC: Formally Verified Library of Input Data Aware Approximate Arithmetic Circuits
FV-LIDAC is a library of approximate circuits, namely adders and multipliers, with 8-bit and 16-bit circuits, which were identified as Pareto-optimal for different input distributions. Through their approximation scheme, formal verification was employed for the introduced approximation with the cecApprox methodology.
repository-code: 'https://github.com/agra-uni-bremen/fv-lidac'
abstract: >-
FV-LIDAC: Formally Verified Library of Input Data Aware Approximate Arithmetic Circuits
license: MIT