Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Quine-McCluskey method"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Eko Dwi Nugroho
Publikováno v:
Telematika, Vol 18, Iss 1, Pp 27-36 (2021)
Purpose: This research makes an application to simplify the Boolean function using Quine-McCluskey, because length of the Boolean function complicates the digital circuit, so that it can be simplified by finding other functions that are equivalent an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5fd6d2cba86320ee5fd005c80e72f7b
https://doi.org/10.31315/telematika.v18i1.3195
https://doi.org/10.31315/telematika.v18i1.3195
Publikováno v:
ICTACT Journal on Microelectronics, Vol 1, Iss 4, Pp 160-167 (2016)
Digital Systems have a prominent role in everyday life that we refer to the present technological period as the digital age. Digital Systems implement digital circuits which are mostly combination of digital gates. These gates can be represented in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e9f12e2f8ca085fa9d991dba1571952
https://doi.org/10.21917/ijme.2016.0024
https://doi.org/10.21917/ijme.2016.0024
Publikováno v:
Repositório Institucional da UNESPUniversidade Estadual PaulistaUNESP.
Submitted by ALINE DE PAULA SANCHES null (alinepaulasanches@gmail.com) on 2017-08-10T04:12:51Z No. of bitstreams: 1 Defesa10_modificada 09-08-2017.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5)
Approved for entry into archi
Approved for entry into archi
Externí odkaz:
http://hdl.handle.net/11449/151311
Publikováno v:
Repositório Institucional da UNESP
Universidade Estadual Paulista (UNESP)
instacron:UNESP
Universidade Estadual Paulista (UNESP)
instacron:UNESP
Submitted by ALINE DE PAULA SANCHES null (alinepaulasanches@gmail.com) on 2017-08-10T04:12:51Z No. of bitstreams: 1 Defesa10_modificada 09-08-2017.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5) Approved for entry into archive by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::1e30079c9beadaea3af573fc2327176d
Autor:
Sanches, Aline de Paula
Orientador: Alexandre César Rodrigues da Silva
Com a disseminação de dispositivos eletrônicos cada vez menores e o advento de novas tecnologias. A busca por métodos de minimização de funções booleanas tem sido a base para eletrônica di
Com a disseminação de dispositivos eletrônicos cada vez menores e o advento de novas tecnologias. A busca por métodos de minimização de funções booleanas tem sido a base para eletrônica di
Externí odkaz:
http://hdl.handle.net/11449/151311
Autor:
Miloš Šeda
Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-know
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d6270c0a4fc5280553bd91a83fb2580
Autor:
Pong P. Chu
Publikováno v:
VLSI Design, Vol 3, Iss 1, Pp 13-19 (1995)
To find a minimal expression of a boolean function includes a step to select the minimum cost cover from a set of implicants. Since the selection process is an NP-complete problem, to find an optimal solution is impractical for large input data size.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eba41adadb4471b2bf042a44d501329d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.