Synthesis of digital circuits with ability to generalize

Detalhes bibliográficos
Autor(a) principal: Lacerda, Wilian Soares
Data de Publicação: 2010
Outros Autores: Braga, Antônio de Pádua
Tipo de documento: Artigo
Idioma: eng
Título da fonte: INFOCOMP: Jornal de Ciência da Computação
Texto Completo: https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/306
Resumo: A method for synthesis of digital hardware classification circuits is presented in this paper. The method works by first selecting data from the truth table that are important for generalization of the circuit. The selected subset is provided to a Boolean minimization algorithm (Espresso) that, by hypercube expansion, generates a classifier with a smoother separation surface between classes. The results show that obtained circuits have a generalization performance comparable to Support Vector Machines and Multilayer Perceptron.
id UFLA-5_3c5a4cbab29ca66e361bf7649b141d40
oai_identifier_str oai:infocomp.dcc.ufla.br:article/306
network_acronym_str UFLA-5
network_name_str INFOCOMP: Jornal de Ciência da Computação
repository_id_str
spelling Synthesis of digital circuits with ability to generalizeSynthesisdigital circuitgeneralization.A method for synthesis of digital hardware classification circuits is presented in this paper. The method works by first selecting data from the truth table that are important for generalization of the circuit. The selected subset is provided to a Boolean minimization algorithm (Espresso) that, by hypercube expansion, generates a classifier with a smoother separation surface between classes. The results show that obtained circuits have a generalization performance comparable to Support Vector Machines and Multilayer Perceptron.Editora da UFLA2010-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/306INFOCOMP Journal of Computer Science; Vol. 9 No. 2 (2010): June, 2010; 92-971982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/306/291Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessLacerda, Wilian SoaresBraga, Antônio de Pádua2015-07-29T11:42:23Zoai:infocomp.dcc.ufla.br:article/306Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:30.902774INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true
dc.title.none.fl_str_mv Synthesis of digital circuits with ability to generalize
title Synthesis of digital circuits with ability to generalize
spellingShingle Synthesis of digital circuits with ability to generalize
Lacerda, Wilian Soares
Synthesis
digital circuit
generalization.
title_short Synthesis of digital circuits with ability to generalize
title_full Synthesis of digital circuits with ability to generalize
title_fullStr Synthesis of digital circuits with ability to generalize
title_full_unstemmed Synthesis of digital circuits with ability to generalize
title_sort Synthesis of digital circuits with ability to generalize
author Lacerda, Wilian Soares
author_facet Lacerda, Wilian Soares
Braga, Antônio de Pádua
author_role author
author2 Braga, Antônio de Pádua
author2_role author
dc.contributor.author.fl_str_mv Lacerda, Wilian Soares
Braga, Antônio de Pádua
dc.subject.por.fl_str_mv Synthesis
digital circuit
generalization.
topic Synthesis
digital circuit
generalization.
description A method for synthesis of digital hardware classification circuits is presented in this paper. The method works by first selecting data from the truth table that are important for generalization of the circuit. The selected subset is provided to a Boolean minimization algorithm (Espresso) that, by hypercube expansion, generates a classifier with a smoother separation surface between classes. The results show that obtained circuits have a generalization performance comparable to Support Vector Machines and Multilayer Perceptron.
publishDate 2010
dc.date.none.fl_str_mv 2010-06-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/306
url https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/306
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/306/291
dc.rights.driver.fl_str_mv Copyright (c) 2016 INFOCOMP Journal of Computer Science
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2016 INFOCOMP Journal of Computer Science
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Editora da UFLA
publisher.none.fl_str_mv Editora da UFLA
dc.source.none.fl_str_mv INFOCOMP Journal of Computer Science; Vol. 9 No. 2 (2010): June, 2010; 92-97
1982-3363
1807-4545
reponame:INFOCOMP: Jornal de Ciência da Computação
instname:Universidade Federal de Lavras (UFLA)
instacron:UFLA
instname_str Universidade Federal de Lavras (UFLA)
instacron_str UFLA
institution UFLA
reponame_str INFOCOMP: Jornal de Ciência da Computação
collection INFOCOMP: Jornal de Ciência da Computação
repository.name.fl_str_mv INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)
repository.mail.fl_str_mv infocomp@dcc.ufla.br||apfreire@dcc.ufla.br
_version_ 1799874740951711744

Registros relacionados