Synthesis and Optimization of Majority Expressions through a Mathematical Model

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.contributorDept. of Electronic and Computer Engineering-
Autor(es): dc.creatorFerraz, Evandro C.-
Autor(es): dc.creatorJunior, Jose V. O.-
Autor(es): dc.creatorGrout, Ian-
Autor(es): dc.creatorDa Silva, Alexandre C. R.-
Data de aceite: dc.date.accessioned2025-08-21T17:41:03Z-
Data de disponibilização: dc.date.available2025-08-21T17:41:03Z-
Data de envio: dc.date.issued2022-04-29-
Data de envio: dc.date.issued2022-04-29-
Data de envio: dc.date.issued2020-08-01-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1109/SBCCI50935.2020.9189906-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/228865-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/228865-
Descrição: dc.descriptionIn this paper, the 3MS (Majority Math Model Solver) algorithm is proposed for use in the optimization of majority logic circuits. The new proposed algorithm receives a sequence of binary numbers as input, representing truth tables with a minimum of 3 and a maximum of 8 variables, and returns an optimized majority function that covers the same minterms. Key in this approach is the formulation of constraints that encode a majority logic problem into a mathematical optimization problem. The resulting set of constraints is then applied to an optimization solver and the results are translated into the output majority function. As cost criteria the minimization of levels is prioritized, followed by the minimization of gates, inverters and gate inputs. The 3MS algorithm was evaluated based on a comparison with the state-of-the-art exact synthesis for majority-of-three networks, which considers the number of levels and gates as cost criteria. Since the 3MS considers two additional cost criterias, the goal of the algorithm is to generate functions that are also exact in relation to the number of levels and gates, but uses fewer inverters and gate inputs. Simulation studies have shown that the 3MS is able to further improve 79% of all 77,292 compared functions, and achieves equal results for the remaining 21%.-
Descrição: dc.descriptionFEIS - Univ. Estadual Paulista Dept. of Electrical Engineering-
Descrição: dc.descriptionUniversity of Limerick Dept. of Electronic and Computer Engineering-
Descrição: dc.descriptionFEIS - Univ. Estadual Paulista Dept. of Electrical Engineering-
Idioma: dc.languageen-
Relação: dc.relationProceedings - 33rd Symposium on Integrated Circuits and Systems Design, SBCCI 2020-
???dc.source???: dc.sourceScopus-
Palavras-chave: dc.subjectlogic synthesis-
Palavras-chave: dc.subjectmajority logic-
Palavras-chave: dc.subjectmathematical model-
Palavras-chave: dc.subjectoptimization solver-
Palavras-chave: dc.subjectprimitive functions-
Título: dc.titleSynthesis and Optimization of Majority Expressions through a Mathematical Model-
Tipo de arquivo: dc.typeaula digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.