Exact multi-level benchmark circuit generation for logic synthesis evaluation

Detalhes bibliográficos
Autor(a) principal: Lau Neto, Walter
Data de Publicação: 2018
Tipo de documento: Dissertação
Idioma: eng
Título da fonte: Biblioteca Digital de Teses e Dissertações da UFRGS
Texto Completo: http://hdl.handle.net/10183/193157
Resumo: Electronic design automation (EDA) tools provide a highly automated flow for integrated circuit (IC) design. This flow may be roughly divided into three main steps: high-level synthesis, logic synthesis and physical synthesis. The logic synthesis step has as goal circuit logic optimization and circuit implementation in a given technology. Usually, the logic synthesis is performed over a multiple-level network, which implements the combinational logic of a given circuit. The problem of synthesizing a multi-level network is a complex task, where exact synthesis is just practical for functions with a few inputs, and the vast majority of algorithms are heuristic. While validating and evaluating new heuristic methods, benchmarks are of great importance. Usually, when a new method emerges, it is compared to the previous best-known results for a similar set of circuits, showing the relative efficiency of this new method over the previous one. However, with such an evaluation it is not possible to assess if current approaches are producing a nearoptimal solution or if there is still room for improvement. To address this issue, it is of great interest have circuits with an exact known solution. In this work, a novel method to generate exact multi-level logic circuits is presented. The proposed method is based on reversible logic and creates circuits acting as the identity function f(x) = x. It means that the generated circuits can be reduced to wires, with no gate instantiation. The proposed approach can generate exact benchmark circuits with up to 40 millions of ANDinverter graph (AIG) nodes in a few seconds. Furthermore, with the proposed method, it is possible to derive exact circuits in two different ways: (i) from real designs and (ii) building synthetic circuits. Both approaches are discussed, and logic synthesis results are presented running the state-of-art academic tools and a commercial tool for each. From results, it is possible to note that the generated circuits are challenging to logic synthesis tools and that there is a gap between the solutions found by these tools and the optimal circuit implementation. Finally, we present and discuss the flexibility of the proposed method, and how it can be further explored and applied in areas other than logic synthesis.
id URGS_c6dad431b35ccfee75b1c87a31cbcc28
oai_identifier_str oai:www.lume.ufrgs.br:10183/193157
network_acronym_str URGS
network_name_str Biblioteca Digital de Teses e Dissertações da UFRGS
repository_id_str 1853
spelling Lau Neto, WalterRibas, Renato Perez2019-04-18T02:34:17Z2018http://hdl.handle.net/10183/193157001091058Electronic design automation (EDA) tools provide a highly automated flow for integrated circuit (IC) design. This flow may be roughly divided into three main steps: high-level synthesis, logic synthesis and physical synthesis. The logic synthesis step has as goal circuit logic optimization and circuit implementation in a given technology. Usually, the logic synthesis is performed over a multiple-level network, which implements the combinational logic of a given circuit. The problem of synthesizing a multi-level network is a complex task, where exact synthesis is just practical for functions with a few inputs, and the vast majority of algorithms are heuristic. While validating and evaluating new heuristic methods, benchmarks are of great importance. Usually, when a new method emerges, it is compared to the previous best-known results for a similar set of circuits, showing the relative efficiency of this new method over the previous one. However, with such an evaluation it is not possible to assess if current approaches are producing a nearoptimal solution or if there is still room for improvement. To address this issue, it is of great interest have circuits with an exact known solution. In this work, a novel method to generate exact multi-level logic circuits is presented. The proposed method is based on reversible logic and creates circuits acting as the identity function f(x) = x. It means that the generated circuits can be reduced to wires, with no gate instantiation. The proposed approach can generate exact benchmark circuits with up to 40 millions of ANDinverter graph (AIG) nodes in a few seconds. Furthermore, with the proposed method, it is possible to derive exact circuits in two different ways: (i) from real designs and (ii) building synthetic circuits. Both approaches are discussed, and logic synthesis results are presented running the state-of-art academic tools and a commercial tool for each. From results, it is possible to note that the generated circuits are challenging to logic synthesis tools and that there is a gap between the solutions found by these tools and the optimal circuit implementation. Finally, we present and discuss the flexibility of the proposed method, and how it can be further explored and applied in areas other than logic synthesis.application/pdfengMicroeletrônicaCircuitos digitaisDigital circuit designLogic synthesisExact benchmarksReversible logicExact multi-level benchmark circuit generation for logic synthesis evaluationGeração de circuitos multi-nível com solução exata para avaliação de ferramentas de síntese lógica info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisUniversidade Federal do Rio Grande do SulInstituto de InformáticaPrograma de Pós-Graduação em MicroeletrônicaPorto Alegre, BR-RS2018mestradoinfo:eu-repo/semantics/openAccessreponame:Biblioteca Digital de Teses e Dissertações da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSTEXT001091058.pdf.txt001091058.pdf.txtExtracted Texttext/plain140852http://www.lume.ufrgs.br/bitstream/10183/193157/2/001091058.pdf.txtbc1bc37adf686f82601a8ca905251de5MD52ORIGINAL001091058.pdfTexto completo (inglês)application/pdf1647852http://www.lume.ufrgs.br/bitstream/10183/193157/1/001091058.pdf42dbfffbd80d2f8ce2f4f74fa9246265MD5110183/1931572021-05-26 04:44:59.490663oai:www.lume.ufrgs.br:10183/193157Biblioteca Digital de Teses e Dissertaçõeshttps://lume.ufrgs.br/handle/10183/2PUBhttps://lume.ufrgs.br/oai/requestlume@ufrgs.br||lume@ufrgs.bropendoar:18532021-05-26T07:44:59Biblioteca Digital de Teses e Dissertações da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false
dc.title.pt_BR.fl_str_mv Exact multi-level benchmark circuit generation for logic synthesis evaluation
dc.title.alternative.pt.fl_str_mv Geração de circuitos multi-nível com solução exata para avaliação de ferramentas de síntese lógica
title Exact multi-level benchmark circuit generation for logic synthesis evaluation
spellingShingle Exact multi-level benchmark circuit generation for logic synthesis evaluation
Lau Neto, Walter
Microeletrônica
Circuitos digitais
Digital circuit design
Logic synthesis
Exact benchmarks
Reversible logic
title_short Exact multi-level benchmark circuit generation for logic synthesis evaluation
title_full Exact multi-level benchmark circuit generation for logic synthesis evaluation
title_fullStr Exact multi-level benchmark circuit generation for logic synthesis evaluation
title_full_unstemmed Exact multi-level benchmark circuit generation for logic synthesis evaluation
title_sort Exact multi-level benchmark circuit generation for logic synthesis evaluation
author Lau Neto, Walter
author_facet Lau Neto, Walter
author_role author
dc.contributor.author.fl_str_mv Lau Neto, Walter
dc.contributor.advisor1.fl_str_mv Ribas, Renato Perez
contributor_str_mv Ribas, Renato Perez
dc.subject.por.fl_str_mv Microeletrônica
Circuitos digitais
topic Microeletrônica
Circuitos digitais
Digital circuit design
Logic synthesis
Exact benchmarks
Reversible logic
dc.subject.eng.fl_str_mv Digital circuit design
Logic synthesis
Exact benchmarks
Reversible logic
description Electronic design automation (EDA) tools provide a highly automated flow for integrated circuit (IC) design. This flow may be roughly divided into three main steps: high-level synthesis, logic synthesis and physical synthesis. The logic synthesis step has as goal circuit logic optimization and circuit implementation in a given technology. Usually, the logic synthesis is performed over a multiple-level network, which implements the combinational logic of a given circuit. The problem of synthesizing a multi-level network is a complex task, where exact synthesis is just practical for functions with a few inputs, and the vast majority of algorithms are heuristic. While validating and evaluating new heuristic methods, benchmarks are of great importance. Usually, when a new method emerges, it is compared to the previous best-known results for a similar set of circuits, showing the relative efficiency of this new method over the previous one. However, with such an evaluation it is not possible to assess if current approaches are producing a nearoptimal solution or if there is still room for improvement. To address this issue, it is of great interest have circuits with an exact known solution. In this work, a novel method to generate exact multi-level logic circuits is presented. The proposed method is based on reversible logic and creates circuits acting as the identity function f(x) = x. It means that the generated circuits can be reduced to wires, with no gate instantiation. The proposed approach can generate exact benchmark circuits with up to 40 millions of ANDinverter graph (AIG) nodes in a few seconds. Furthermore, with the proposed method, it is possible to derive exact circuits in two different ways: (i) from real designs and (ii) building synthetic circuits. Both approaches are discussed, and logic synthesis results are presented running the state-of-art academic tools and a commercial tool for each. From results, it is possible to note that the generated circuits are challenging to logic synthesis tools and that there is a gap between the solutions found by these tools and the optimal circuit implementation. Finally, we present and discuss the flexibility of the proposed method, and how it can be further explored and applied in areas other than logic synthesis.
publishDate 2018
dc.date.issued.fl_str_mv 2018
dc.date.accessioned.fl_str_mv 2019-04-18T02:34:17Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10183/193157
dc.identifier.nrb.pt_BR.fl_str_mv 001091058
url http://hdl.handle.net/10183/193157
identifier_str_mv 001091058
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Biblioteca Digital de Teses e Dissertações da UFRGS
instname:Universidade Federal do Rio Grande do Sul (UFRGS)
instacron:UFRGS
instname_str Universidade Federal do Rio Grande do Sul (UFRGS)
instacron_str UFRGS
institution UFRGS
reponame_str Biblioteca Digital de Teses e Dissertações da UFRGS
collection Biblioteca Digital de Teses e Dissertações da UFRGS
bitstream.url.fl_str_mv http://www.lume.ufrgs.br/bitstream/10183/193157/2/001091058.pdf.txt
http://www.lume.ufrgs.br/bitstream/10183/193157/1/001091058.pdf
bitstream.checksum.fl_str_mv bc1bc37adf686f82601a8ca905251de5
42dbfffbd80d2f8ce2f4f74fa9246265
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Biblioteca Digital de Teses e Dissertações da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)
repository.mail.fl_str_mv lume@ufrgs.br||lume@ufrgs.br
_version_ 1810085475201843200