Evidence map›Paper›PMID 35630158›Full record

ArticleMicromachines2022

Cost-Efficient Approaches for Fulfillment of Functional Coverage during Verification of Digital Designs.

Alexandru Dinu, Gabriel Mihail Danciu, Petre Lucian Ogrutan

Abstract read
In one paragraph

Article in Micromachines, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Alexandru DinuDepartment of Electronics and Computers, Transilvania University of Brașov, 500036 Brașov, Romania.ORCID 0000-0001-6285-1458
Gabriel Mihail DanciuDepartment of Electronics and Computers, Transilvania University of Brașov, 500036 Brașov, Romania.ORCID 0000-0002-8561-1171
Petre Lucian OgrutanDepartment of Electronics and Computers, Transilvania University of Brașov, 500036 Brașov, Romania.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Digital integrated circuits play an important role in the development of new information technologies and support Industry 4.0 from a hardware point of view. There is great pressure on electronics companies to reduce the time-to-market for product development as much as possible. The most time-consuming stage in hardware development is functional verification. As a result, many industry and academic stakeholders are investing in automating this crucial step in electronics production. The present work aims to automate the functional verification process by means of genetic algorithms that are used for generating the relevant input stimuli for full simulation of digital design behavior. Two important aspects are pursued throughout the current work: the implementation of genetic algorithms must be time-worthy compared to the application of the classical constrained-driven generation and the verification process must be implemented using tools accessible to a wide range of practitioners. It is demonstrated that for complex designs, functional verification powered by the use of genetic algorithms can go beyond the classical method of performing verification, which is based on constrained-random stimulus generation. The currently proposed methods were able to generate several sets of highly performing stimuli compared to the constraint-random stimulus generation method, in a ratio ranging from 57:1 to 205:1. The performance of the proposed approaches is comparable to that of the well-known NSGA-II and SPEA2 algorithms.

Indexed as

AI-enhanced processingautomationdata correlationfunctional verificationgenetic algorithmshardware manufacturingNSGA-IISPEA2

Identifiers

PMID35630158
PMCPMC9146489

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.