A High Throughput Polynomial and Rational Function Approximations Evaluator Article Swipe

View

Nicolas Brisebarre , George A. Constantinides , Milos Ercezovac , Silviu-Ioan Filip , Matei Istoan , Jean‐Michel Muller ·

YOU? · · 2018 · Open Access · · DOI: https://doi.org/10.1109/arith.2018.8464778

We present an automatic method for the evaluation of functions via polynomial or rational approximations and its hardware implementation, on FPGAs. These approximations are evaluated using Ercegovac's iterative E-method adapted for FPGA implementation. The polynomial and rational function coefficients are optimized such that they satisfy the constraints of the E-method. We present several examples of practical interest; in each case a resource-efficient approximation is proposed and comparisons are made with alternative approaches.

Related Topics

Computer Science

Algorithm

Mathematics

Mathematical Analysis

Evolutionary Biology

Wireless

Biology

Concepts

Throughput Computer science Polynomial Rational function Function (biology) Polynomial and rational function modeling Approximations of π Applied mathematics Mathematical optimization Algorithm Mathematics Pure mathematics Mathematical analysis Telecommunications Evolutionary biology Wireless Biology

Metadata

Type: preprint
Language: en
Landing Page: https://doi.org/10.1109/arith.2018.8464778
OA Status: green
Cited By: 3
References: 32
Related Works: 10
OpenAlex ID: https://openalex.org/W2799377959

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W2799377959

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.1109/arith.2018.8464778

Digital Object Identifier
Title: A High Throughput Polynomial and Rational Function Approximations Evaluator

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2018

Year of publication
Publication date: 2018-06-01

Full publication date if available
Authors: Nicolas Brisebarre, George A. Constantinides, Milos Ercezovac, Silviu-Ioan Filip, Matei Istoan, Jean‐Michel Muller

List of authors in order
Landing page: https://doi.org/10.1109/arith.2018.8464778

Publisher landing page
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://inria.hal.science/hal-01774364

Direct OA link when available
Concepts: Throughput, Computer science, Polynomial, Rational function, Function (biology), Polynomial and rational function modeling, Approximations of π, Applied mathematics, Mathematical optimization, Algorithm, Mathematics, Pure mathematics, Mathematical analysis, Telecommunications, Evolutionary biology, Wireless, Biology

Top concepts (fields/topics) attached by OpenAlex
Cited by: 3

Total citation count in OpenAlex
Citations by year (recent): 2023: 3

Per-year citation counts (last 5 years)
References (count): 32

Number of works referenced by this work
Related works (count): 10

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W2799377959
doi	https://doi.org/10.1109/arith.2018.8464778
ids.doi	https://doi.org/10.1109/arith.2018.8464778
ids.mag	2799377959
ids.openalex	https://openalex.org/W2799377959
fwci	0.0
type	preprint
title	A High Throughput Polynomial and Rational Function Approximations Evaluator
awards[0].id	https://openalex.org/G2784140359
awards[0].funder_id	https://openalex.org/F4320334627
awards[0].display_name
awards[0].funder_award_id	EP/P010040/1
awards[0].funder_display_name	Engineering and Physical Sciences Research Council
awards[1].id	https://openalex.org/G8101247924
awards[1].funder_id	https://openalex.org/F4320334627
awards[1].display_name
awards[1].funder_award_id	EP/K034448/1
awards[1].funder_display_name	Engineering and Physical Sciences Research Council
biblio.issue
biblio.volume
biblio.last_page	106
biblio.first_page	99
topics[0].id	https://openalex.org/T11697
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9998000264167786
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1703
topics[0].subfield.display_name	Computational Theory and Mathematics
topics[0].display_name	Numerical Methods and Algorithms
topics[1].id	https://openalex.org/T11435
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.9991999864578247
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1703
topics[1].subfield.display_name	Computational Theory and Mathematics
topics[1].display_name	Polynomial and algebraic computation
topics[2].id	https://openalex.org/T11693
topics[2].field.id	https://openalex.org/fields/17
topics[2].field.display_name	Computer Science
topics[2].score	0.9970999956130981
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/1710
topics[2].subfield.display_name	Information Systems
topics[2].display_name	Cryptography and Residue Arithmetic
funders[0].id	https://openalex.org/F4320334627
funders[0].ror	https://ror.org/0439y7842
funders[0].display_name	Engineering and Physical Sciences Research Council
is_xpac	False
apc_list
apc_paid
concepts[0].id	https://openalex.org/C157764524
concepts[0].level	3
concepts[0].score	0.6642183661460876
concepts[0].wikidata	https://www.wikidata.org/wiki/Q1383412
concepts[0].display_name	Throughput
concepts[1].id	https://openalex.org/C41008148
concepts[1].level	0
concepts[1].score	0.6141822338104248
concepts[1].wikidata	https://www.wikidata.org/wiki/Q21198
concepts[1].display_name	Computer science
concepts[2].id	https://openalex.org/C90119067
concepts[2].level	2
concepts[2].score	0.6085747480392456
concepts[2].wikidata	https://www.wikidata.org/wiki/Q43260
concepts[2].display_name	Polynomial
concepts[3].id	https://openalex.org/C75190567
concepts[3].level	2
concepts[3].score	0.5852168798446655
concepts[3].wikidata	https://www.wikidata.org/wiki/Q41237
concepts[3].display_name	Rational function
concepts[4].id	https://openalex.org/C14036430
concepts[4].level	2
concepts[4].score	0.5439157485961914
concepts[4].wikidata	https://www.wikidata.org/wiki/Q3736076
concepts[4].display_name	Function (biology)
concepts[5].id	https://openalex.org/C138029060
concepts[5].level	3
concepts[5].score	0.5425589084625244
concepts[5].wikidata	https://www.wikidata.org/wiki/Q7226633
concepts[5].display_name	Polynomial and rational function modeling
concepts[6].id	https://openalex.org/C193386753
concepts[6].level	2
concepts[6].score	0.45392462611198425
concepts[6].wikidata	https://www.wikidata.org/wiki/Q1130396
concepts[6].display_name	Approximations of π
concepts[7].id	https://openalex.org/C28826006
concepts[7].level	1
concepts[7].score	0.3608725666999817
concepts[7].wikidata	https://www.wikidata.org/wiki/Q33521
concepts[7].display_name	Applied mathematics
concepts[8].id	https://openalex.org/C126255220
concepts[8].level	1
concepts[8].score	0.3391273021697998
concepts[8].wikidata	https://www.wikidata.org/wiki/Q141495
concepts[8].display_name	Mathematical optimization
concepts[9].id	https://openalex.org/C11413529
concepts[9].level	1
concepts[9].score	0.3281348943710327
concepts[9].wikidata	https://www.wikidata.org/wiki/Q8366
concepts[9].display_name	Algorithm
concepts[10].id	https://openalex.org/C33923547
concepts[10].level	0
concepts[10].score	0.306620717048645
concepts[10].wikidata	https://www.wikidata.org/wiki/Q395
concepts[10].display_name	Mathematics
concepts[11].id	https://openalex.org/C202444582
concepts[11].level	1
concepts[11].score	0.11625626683235168
concepts[11].wikidata	https://www.wikidata.org/wiki/Q837863
concepts[11].display_name	Pure mathematics
concepts[12].id	https://openalex.org/C134306372
concepts[12].level	1
concepts[12].score	0.0748748779296875
concepts[12].wikidata	https://www.wikidata.org/wiki/Q7754
concepts[12].display_name	Mathematical analysis
concepts[13].id	https://openalex.org/C76155785
concepts[13].level	1
concepts[13].score	0.0520363450050354
concepts[13].wikidata	https://www.wikidata.org/wiki/Q418
concepts[13].display_name	Telecommunications
concepts[14].id	https://openalex.org/C78458016
concepts[14].level	1
concepts[14].score	0.0
concepts[14].wikidata	https://www.wikidata.org/wiki/Q840400
concepts[14].display_name	Evolutionary biology
concepts[15].id	https://openalex.org/C555944384
concepts[15].level	2
concepts[15].score	0.0
concepts[15].wikidata	https://www.wikidata.org/wiki/Q249
concepts[15].display_name	Wireless
concepts[16].id	https://openalex.org/C86803240
concepts[16].level	0
concepts[16].score	0.0
concepts[16].wikidata	https://www.wikidata.org/wiki/Q420
concepts[16].display_name	Biology
keywords[0].id	https://openalex.org/keywords/throughput
keywords[0].score	0.6642183661460876
keywords[0].display_name	Throughput
keywords[1].id	https://openalex.org/keywords/computer-science
keywords[1].score	0.6141822338104248
keywords[1].display_name	Computer science
keywords[2].id	https://openalex.org/keywords/polynomial
keywords[2].score	0.6085747480392456
keywords[2].display_name	Polynomial
keywords[3].id	https://openalex.org/keywords/rational-function
keywords[3].score	0.5852168798446655
keywords[3].display_name	Rational function
keywords[4].id	https://openalex.org/keywords/function
keywords[4].score	0.5439157485961914
keywords[4].display_name	Function (biology)
keywords[5].id	https://openalex.org/keywords/polynomial-and-rational-function-modeling
keywords[5].score	0.5425589084625244
keywords[5].display_name	Polynomial and rational function modeling
keywords[6].id	https://openalex.org/keywords/approximations-of-π
keywords[6].score	0.45392462611198425
keywords[6].display_name	Approximations of π
keywords[7].id	https://openalex.org/keywords/applied-mathematics
keywords[7].score	0.3608725666999817
keywords[7].display_name	Applied mathematics
keywords[8].id	https://openalex.org/keywords/mathematical-optimization
keywords[8].score	0.3391273021697998
keywords[8].display_name	Mathematical optimization
keywords[9].id	https://openalex.org/keywords/algorithm
keywords[9].score	0.3281348943710327
keywords[9].display_name	Algorithm
keywords[10].id	https://openalex.org/keywords/mathematics
keywords[10].score	0.306620717048645
keywords[10].display_name	Mathematics
keywords[11].id	https://openalex.org/keywords/pure-mathematics
keywords[11].score	0.11625626683235168
keywords[11].display_name	Pure mathematics
keywords[12].id	https://openalex.org/keywords/mathematical-analysis
keywords[12].score	0.0748748779296875
keywords[12].display_name	Mathematical analysis
keywords[13].id	https://openalex.org/keywords/telecommunications
keywords[13].score	0.0520363450050354
keywords[13].display_name	Telecommunications
language	en
locations[0].id	doi:10.1109/arith.2018.8464778
locations[0].is_oa	False
locations[0].source
locations[0].license
locations[0].pdf_url
locations[0].version	publishedVersion
locations[0].raw_type	proceedings-article
locations[0].license_id
locations[0].is_accepted	True
locations[0].is_published	True
locations[0].raw_source_name	2018 IEEE 25th Symposium on Computer Arithmetic (ARITH)
locations[0].landing_page_url	https://doi.org/10.1109/arith.2018.8464778
locations[1].id	pmh:oai:HAL:hal-01774364v1
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306402512
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	False
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	HAL (Le Centre pour la Communication Scientifique Directe)
locations[1].source.host_organization	https://openalex.org/I1294671590
locations[1].source.host_organization_name	Centre National de la Recherche Scientifique
locations[1].source.host_organization_lineage	https://openalex.org/I1294671590
locations[1].license	other-oa
locations[1].pdf_url
locations[1].version	submittedVersion
locations[1].raw_type	Conference papers
locations[1].license_id	https://openalex.org/licenses/other-oa
locations[1].is_accepted	False
locations[1].is_published	False
locations[1].raw_source_name	ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst, MA, United States. pp.99-106, ⟨10.1109/ARITH.2018.8464778⟩
locations[1].landing_page_url	https://inria.hal.science/hal-01774364
locations[2].id	pmh:oai:spiral.imperial.ac.uk:10044/1/58749
locations[2].is_oa	False
locations[2].source.id	https://openalex.org/S4306401396
locations[2].source.issn
locations[2].source.type	repository
locations[2].source.is_oa	False
locations[2].source.issn_l
locations[2].source.is_core	False
locations[2].source.is_in_doaj	False
locations[2].source.display_name	Spiral (Imperial College London)
locations[2].source.host_organization	https://openalex.org/I47508984
locations[2].source.host_organization_name	Imperial College London
locations[2].source.host_organization_lineage	https://openalex.org/I47508984
locations[2].license
locations[2].pdf_url
locations[2].version	submittedVersion
locations[2].raw_type	Conference Paper
locations[2].license_id
locations[2].is_accepted	False
locations[2].is_published	False
locations[2].raw_source_name	25th IEEE Symposium on Computer Arithmetic
locations[2].landing_page_url	http://hdl.handle.net/10044/1/58749
indexed_in	crossref
authorships[0].author.id	https://openalex.org/A5058275399
authorships[0].author.orcid	https://orcid.org/0000-0002-4220-2132
authorships[0].author.display_name	Nicolas Brisebarre
authorships[0].countries	FR
authorships[0].affiliations[0].institution_ids	https://openalex.org/I1294671590
authorships[0].affiliations[0].raw_affiliation_string	CNRS - Centre National de la Recherche Scientifique (France)
authorships[0].affiliations[1].raw_affiliation_string	ARIC - Arithmetic and Computing (46 Allée d'Italie 69364 Lyon France - France)
authorships[0].institutions[0].id	https://openalex.org/I1294671590
authorships[0].institutions[0].ror	https://ror.org/02feahw73
authorships[0].institutions[0].type	government
authorships[0].institutions[0].lineage	https://openalex.org/I1294671590
authorships[0].institutions[0].country_code	FR
authorships[0].institutions[0].display_name	Centre National de la Recherche Scientifique
authorships[0].author_position	first
authorships[0].raw_author_name	Nicolas Brisebarre
authorships[0].is_corresponding	False
authorships[0].raw_affiliation_strings	ARIC - Arithmetic and Computing (46 Allée d'Italie 69364 Lyon France - France), CNRS - Centre National de la Recherche Scientifique (France)
authorships[1].author.id	https://openalex.org/A5029829952
authorships[1].author.orcid	https://orcid.org/0000-0002-0201-310X
authorships[1].author.display_name	George A. Constantinides
authorships[1].countries	GB
authorships[1].affiliations[0].institution_ids	https://openalex.org/I47508984
authorships[1].affiliations[0].raw_affiliation_string	DEEE - Department of Electrical and Electronic Engineering [London] (Imperial College London, South Kensington Campus, London SW7 2AZ - Royaume-Uni)
authorships[1].institutions[0].id	https://openalex.org/I47508984
authorships[1].institutions[0].ror	https://ror.org/041kmwe10
authorships[1].institutions[0].type	education
authorships[1].institutions[0].lineage	https://openalex.org/I47508984
authorships[1].institutions[0].country_code	GB
authorships[1].institutions[0].display_name	Imperial College London
authorships[1].author_position	middle
authorships[1].raw_author_name	George Constantinides
authorships[1].is_corresponding	False
authorships[1].raw_affiliation_strings	DEEE - Department of Electrical and Electronic Engineering [London] (Imperial College London, South Kensington Campus, London SW7 2AZ - Royaume-Uni)
authorships[2].author.id	https://openalex.org/A5003049892
authorships[2].author.orcid
authorships[2].author.display_name	Milos Ercezovac
authorships[2].countries	US
authorships[2].affiliations[0].institution_ids	https://openalex.org/I161318765
authorships[2].affiliations[0].raw_affiliation_string	UCLA - Computer Science Department [Los Angeles] (4732 Boelter Hall Los Angeles, CA 90095 - États-Unis)
authorships[2].institutions[0].id	https://openalex.org/I161318765
authorships[2].institutions[0].ror	https://ror.org/046rm7j60
authorships[2].institutions[0].type	education
authorships[2].institutions[0].lineage	https://openalex.org/I161318765
authorships[2].institutions[0].country_code	US
authorships[2].institutions[0].display_name	University of California, Los Angeles
authorships[2].author_position	middle
authorships[2].raw_author_name	Milos Ercezovac
authorships[2].is_corresponding	False
authorships[2].raw_affiliation_strings	UCLA - Computer Science Department [Los Angeles] (4732 Boelter Hall Los Angeles, CA 90095 - États-Unis)
authorships[3].author.id	https://openalex.org/A5039229759
authorships[3].author.orcid	https://orcid.org/0000-0001-9278-7645
authorships[3].author.display_name	Silviu-Ioan Filip
authorships[3].affiliations[0].raw_affiliation_string	CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources (Campus de Beaulieu 35042 Rennes cedex - France)
authorships[3].author_position	middle
authorships[3].raw_author_name	Silviu-Ioan Filip
authorships[3].is_corresponding	False
authorships[3].raw_affiliation_strings	CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources (Campus de Beaulieu 35042 Rennes cedex - France)
authorships[4].author.id	https://openalex.org/A5088622873
authorships[4].author.orcid	https://orcid.org/0000-0003-0960-1059
authorships[4].author.display_name	Matei Istoan
authorships[4].countries	GB
authorships[4].affiliations[0].institution_ids	https://openalex.org/I47508984
authorships[4].affiliations[0].raw_affiliation_string	DEEE - Department of Electrical and Electronic Engineering [London] (Imperial College London, South Kensington Campus, London SW7 2AZ - Royaume-Uni)
authorships[4].institutions[0].id	https://openalex.org/I47508984
authorships[4].institutions[0].ror	https://ror.org/041kmwe10
authorships[4].institutions[0].type	education
authorships[4].institutions[0].lineage	https://openalex.org/I47508984
authorships[4].institutions[0].country_code	GB
authorships[4].institutions[0].display_name	Imperial College London
authorships[4].author_position	middle
authorships[4].raw_author_name	Matei Istoan
authorships[4].is_corresponding	False
authorships[4].raw_affiliation_strings	DEEE - Department of Electrical and Electronic Engineering [London] (Imperial College London, South Kensington Campus, London SW7 2AZ - Royaume-Uni)
authorships[5].author.id	https://openalex.org/A5046395330
authorships[5].author.orcid	https://orcid.org/0000-0003-3588-0047
authorships[5].author.display_name	Jean‐Michel Muller
authorships[5].countries	FR
authorships[5].affiliations[0].institution_ids	https://openalex.org/I1294671590
authorships[5].affiliations[0].raw_affiliation_string	CNRS - Centre National de la Recherche Scientifique (France)
authorships[5].affiliations[1].raw_affiliation_string	ARIC - Arithmetic and Computing (46 Allée d'Italie 69364 Lyon France - France)
authorships[5].institutions[0].id	https://openalex.org/I1294671590
authorships[5].institutions[0].ror	https://ror.org/02feahw73
authorships[5].institutions[0].type	government
authorships[5].institutions[0].lineage	https://openalex.org/I1294671590
authorships[5].institutions[0].country_code	FR
authorships[5].institutions[0].display_name	Centre National de la Recherche Scientifique
authorships[5].author_position	last
authorships[5].raw_author_name	Jean-Michel Muller
authorships[5].is_corresponding	False
authorships[5].raw_affiliation_strings	ARIC - Arithmetic and Computing (46 Allée d'Italie 69364 Lyon France - France), CNRS - Centre National de la Recherche Scientifique (France)
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://inria.hal.science/hal-01774364
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	A High Throughput Polynomial and Rational Function Approximations Evaluator
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic.id	https://openalex.org/T11697
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9998000264167786
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1703
primary_topic.subfield.display_name	Computational Theory and Mathematics
primary_topic.display_name	Numerical Methods and Algorithms
related_works	https://openalex.org/W2355289095, https://openalex.org/W2298585303, https://openalex.org/W120419281, https://openalex.org/W2382910945, https://openalex.org/W2094480099, https://openalex.org/W2128714185, https://openalex.org/W4307464920, https://openalex.org/W2083214991, https://openalex.org/W2003974939, https://openalex.org/W2799377959
cited_by_count	3
counts_by_year[0].year	2023
counts_by_year[0].cited_by_count	3
locations_count	3
best_oa_location.id	pmh:oai:HAL:hal-01774364v1
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306402512
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	False
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	HAL (Le Centre pour la Communication Scientifique Directe)
best_oa_location.source.host_organization	https://openalex.org/I1294671590
best_oa_location.source.host_organization_name	Centre National de la Recherche Scientifique
best_oa_location.source.host_organization_lineage	https://openalex.org/I1294671590
best_oa_location.license	other-oa
best_oa_location.pdf_url
best_oa_location.version	submittedVersion
best_oa_location.raw_type	Conference papers
best_oa_location.license_id	https://openalex.org/licenses/other-oa
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name	ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst, MA, United States. pp.99-106, ⟨10.1109/ARITH.2018.8464778⟩
best_oa_location.landing_page_url	https://inria.hal.science/hal-01774364
primary_location.id	doi:10.1109/arith.2018.8464778
primary_location.is_oa	False
primary_location.source
primary_location.license
primary_location.pdf_url
primary_location.version	publishedVersion
primary_location.raw_type	proceedings-article
primary_location.license_id
primary_location.is_accepted	True
primary_location.is_published	True
primary_location.raw_source_name	2018 IEEE 25th Symposium on Computer Arithmetic (ARITH)
primary_location.landing_page_url	https://doi.org/10.1109/arith.2018.8464778
publication_date	2018-06-01
publication_year	2018
referenced_works	https://openalex.org/W4230445183, https://openalex.org/W2023981118, https://openalex.org/W2031219349, https://openalex.org/W2001182711, https://openalex.org/W1996729064, https://openalex.org/W1972542094, https://openalex.org/W605824955, https://openalex.org/W2165473980, https://openalex.org/W6655079049, https://openalex.org/W2122685238, https://openalex.org/W6756404317, https://openalex.org/W2111730172, https://openalex.org/W2139535992, https://openalex.org/W2139724308, https://openalex.org/W2043792462, https://openalex.org/W2171451363, https://openalex.org/W2115452265, https://openalex.org/W610273277, https://openalex.org/W2111416661, https://openalex.org/W2141040012, https://openalex.org/W2030898836, https://openalex.org/W6635340135, https://openalex.org/W1984615619, https://openalex.org/W2899970442, https://openalex.org/W1982393515, https://openalex.org/W3108043981, https://openalex.org/W2065451462, https://openalex.org/W2613380023, https://openalex.org/W2018758602, https://openalex.org/W2157348988, https://openalex.org/W1593239996, https://openalex.org/W1497154413
referenced_works_count	32
abstract_inverted_index.a	60
abstract_inverted_index.We	0, 50
abstract_inverted_index.an	2
abstract_inverted_index.in	57
abstract_inverted_index.is	63
abstract_inverted_index.of	8, 47, 54
abstract_inverted_index.on	19
abstract_inverted_index.or	12
abstract_inverted_index.The	33
abstract_inverted_index.and	15, 35, 65
abstract_inverted_index.are	23, 39, 67
abstract_inverted_index.for	5, 30
abstract_inverted_index.its	16
abstract_inverted_index.the	6, 45, 48
abstract_inverted_index.via	10
abstract_inverted_index.FPGA	31
abstract_inverted_index.case	59
abstract_inverted_index.each	58
abstract_inverted_index.made	68
abstract_inverted_index.such	41
abstract_inverted_index.that	42
abstract_inverted_index.they	43
abstract_inverted_index.with	69
abstract_inverted_index.These	21
abstract_inverted_index.using	25
abstract_inverted_index.FPGAs.	20
abstract_inverted_index.method	4
abstract_inverted_index.adapted	29
abstract_inverted_index.present	1, 51
abstract_inverted_index.satisfy	44
abstract_inverted_index.several	52
abstract_inverted_index.E-method	28
abstract_inverted_index.examples	53
abstract_inverted_index.function	37
abstract_inverted_index.hardware	17
abstract_inverted_index.proposed	64
abstract_inverted_index.rational	13, 36
abstract_inverted_index.E-method.	49
abstract_inverted_index.automatic	3
abstract_inverted_index.evaluated	24
abstract_inverted_index.functions	9
abstract_inverted_index.interest;	56
abstract_inverted_index.iterative	27
abstract_inverted_index.optimized	40
abstract_inverted_index.practical	55
abstract_inverted_index.evaluation	7
abstract_inverted_index.polynomial	11, 34
abstract_inverted_index.Ercegovac's	26
abstract_inverted_index.alternative	70
abstract_inverted_index.approaches.	71
abstract_inverted_index.comparisons	66
abstract_inverted_index.constraints	46
abstract_inverted_index.coefficients	38
abstract_inverted_index.approximation	62
abstract_inverted_index.approximations	14, 22
abstract_inverted_index.implementation,	18
abstract_inverted_index.implementation.	32
abstract_inverted_index.resource-efficient	61
cited_by_percentile_year.max	97
cited_by_percentile_year.min	96
countries_distinct_count	3
institutions_distinct_count	6
sustainable_development_goals[0].id	https://metadata.un.org/sdg/8
sustainable_development_goals[0].score	0.5199999809265137
sustainable_development_goals[0].display_name	Decent work and economic growth
citation_normalized_percentile.value	0.07115796
citation_normalized_percentile.is_in_top_1_percent	False
citation_normalized_percentile.is_in_top_10_percent	False