Relevant bibliographies by topics / Quine-McCluskey method

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Quine-McCluskey method'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quine-McCluskey method.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Quine-McCluskey method"

1

Hidayat, Alfatah, Siti Rahmah Nurshiami, and Mashuri Mashuri. "IMPLEMENTASI PENYEDERHANAAN FUNGSI BOOLE DENGAN METODE QUINE McCLUSKEY." Jurnal Ilmiah Matematika dan Pendidikan Matematika 13, no. 2 (2021): 27. http://dx.doi.org/10.20884/1.jmp.2021.13.2.4873.

Full text
Abstract:
Quine McCluskey method is one method that can be used to simplify the Boolean function. The Quine McCluskey method has several advantages including having simpler, more systematic steps than other methods and it is easier to simplify the Boolean function with a large number of variables. This study discusses the design of a Boolean function simplification program for the Quine McCluskey method using Visual Basic 6.0. The resulting program can simplify the Boolean function with many variables less than equal to 26 variables and able to simplify the Boolean function in the form of Sum of Product (SOP), Product of Sum (POS), and don't care.
APA, Harvard, Vancouver, ISO, and other styles
2

Manojlovic, Vladislav. "Minimization of Switching Functions using Quine-McCluskey Method." International Journal of Computer Applications 82, no. 4 (2013): 12–16. http://dx.doi.org/10.5120/14103-2127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Petrík, Milan. "Quine–McCluskey method for many-valued logical functions." Soft Computing 12, no. 4 (2007): 393–402. http://dx.doi.org/10.1007/s00500-007-0175-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Martin, Rodrigo, and Pedro Cabalar. "Minish HAT: A Tool for the Minimization of Here-and-There Logic Programs and Theories in Answer Set Programming." Proceedings 21, no. 1 (2019): 22. http://dx.doi.org/10.3390/proceedings2019021022.

Full text
Abstract:
When it comes to the writing of a new logic program or theory, it is of great importance to obtain a concise and minimal representation, for simplicity and ease of interpretation reasons. There are already a few methods and many tools, such as Karnaugh Maps or the Quine-McCluskey method, as well as their numerous software implementations, that solve this minimization problem in Boolean logic. This is not the case for Here-and-There logic, also called three-valued logic. Even though there are theoretical minimization methods for logic theories and programs, there aren’t any published tools that are able to obtain a minimal equivalent logic program. In this paper we present the first version of a tool called that is able to efficiently obtain minimal and equivalent representations for any logic program in Here-and-There. The described tool uses an hybrid method both leveraging a modified version of the Quine-McCluskey algorithm and Answer Set Programming techniques to minimize fairly complex logic programs in a reduced time.
APA, Harvard, Vancouver, ISO, and other styles
5

Janusz, Łukowski. "Logical description of a combinational system by the binary representation method." Studies and Materials in Applied Computer Science (ISSN 1689-6300) 11, no. 1 (2020): 10–12. https://doi.org/10.5281/zenodo.4321147.

Full text
Abstract:
The article presents a new method for simplifying the logical description of a combinational system using truth tables of basic logic functors or / and binary representation of an input combination. The binary representation method is an alternative way of constructing a simplified description of the output function of a combinational system in relation to the method of formal transformations, the Karnaugh table or the Quine-McCluskey methods.
APA, Harvard, Vancouver, ISO, and other styles
6

Janusz, Lukowski. "Uniform group in the binary representation method." Studies and Materials in Applied Computer Science (ISSN 1689-6300) 11, no. 2 (2020): 22–24. https://doi.org/10.5281/zenodo.4344954.

Full text
Abstract:
The article presents definitions of uniform group defined in the binary representation method. The ability to identify uniform group enables the construction of a simplified logical description in the total consideration of the combinations of a multi-input combination system. The binary representation method is an alternative way of constructing a simplified description of the output function of a combinational system in relation to the method of formal transformations, the Karnaugh table or the Quine-McCluskey methods.
APA, Harvard, Vancouver, ISO, and other styles
7

Nugroho, Eko Dwi. "Development of Applications for Simplification of Boolean Functions using Quine-McCluskey Method." Telematika 18, no. 1 (2021): 27. http://dx.doi.org/10.31315/telematika.v18i1.3195.

Full text
Abstract:
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 and more efficient, making digital circuits easier, and less cost.Design/methodology/approach: The canonical form is Sum-of-Product/Product-of-Sum and is in the form of a file, while the output is in the form of a raw and in the form of a file. Applications can receive the same minterm/maksterm input and do not have to be sequential. The method has been applied by Idempoten, Petrick, Selection Sort, and classification, so that simplification is maximized.Findings/result: As a result, the application can simplify more optimally than previous studies, can receive the same minterm/maksterm input, Product-of-Sum canonical form, and has been verified by simplifying and calculating manually.Originality/value/state of the art: Research that applies the petrick method to applications combined with being able to receive the same minterm/maksterm input has never been done before. The calculation is only up to the intermediate stage of the Quine-McCluskey method or has not been able to receive the same minterm/maksterm input.
APA, Harvard, Vancouver, ISO, and other styles
8

Deptuła, A., and M. A. Partyka. "Decision Optimization of Machine Sets Taking Into Consideration Logical Tree Minimization of Design Guidelines." International Journal of Applied Mechanics and Engineering 19, no. 3 (2014): 549–61. http://dx.doi.org/10.2478/ijame-2014-0037.

Full text
Abstract:
Abstract The method of minimization of complex partial multi-valued logical functions determines the degree of importance of construction and exploitation parameters playing the role of logical decision variables. Logical functions are taken into consideration in the issues of modelling machine sets. In multi-valued logical functions with weighting products, it is possible to use a modified Quine - McCluskey algorithm of multi-valued functions minimization. Taking into account weighting coefficients in the logical tree minimization reflects a physical model of the object being analysed much better
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, Eungi. "Derivations of Single Hypothetical Don't-Care Minterms Using the Quasi Quine-McCluskey Method." Journal of the Korea Industrial Information Systems Research 18, no. 1 (2013): 25–35. http://dx.doi.org/10.9723/jksiis.2013.18.1.025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yaman, Orhan, Tuba Sanli, and Mehmet Karakose. "A Quine-McCluskey Based Method for Generating Optimum Combinational Logic Circuits from Reversible Quantum Circuits." Journal of Artificial Intelligence and Autonomous Intelligence 01, no. 01 (2024): 139–54. https://doi.org/10.54364/jaiai.2024.1110.

Full text
Abstract:
Algorithms specifically designed for quantum computers have been developed. In quantum circuits, the Feynman, Toffoli, and Fredkin gates are employed instead of traditional inputs such as AND, OR, NAND, NOR, XOR, and XNOR in combinational logic gates. The ability to convert quantum circuits into combinational logic circuits, or vice versa, is of utmost importance. This essay study (or paper) aims to demonstrates the process of deriving combinational logic circuits from reversible quantum circuits. To achieve this, the Quine-McCluskey technique was utilized along with state tables generated from the quantum circuits to obtain an optimal logic expression that serves as the basis for constructing the combinational logic circuit. The resultant obtained combinational logic circuit was implemented within the MATLAB Simulink environment, and state tables were obtained. A comparison was made between the state tables derived from the quantum circuit and the combinational circuit, yielding successful results.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Quine-McCluskey method"

1

Sanches, Aline de Paula [UNESP]. "Emprego do método de Quine-Mccluskey estendido para gerar circuito mínimo com estruturas ESOP (XOR-XNOR)." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/151311.

Full text
Abstract:
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)<br>Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-08-15T17:07:06Z (GMT) No. of bitstreams: 1 sanches_ap_me_ilha.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5)<br>Made available in DSpace on 2017-08-15T17:07:06Z (GMT). No. of bitstreams: 1 sanches_ap_me_ilha.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5) Previous issue date: 2017-07-06<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>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 digital. Neste trabalho apresenta-se a implementação da primeira fase do método Quine-McCluskey Estendido que utiliza-se de estruturas AND-XOR-XNOR para a geração de implicantes primos. O objetivo do trabalho foi comprovar que, na maioria das vezes, a implementação de uma função Booleana utilizando expressões AND-XOR-XNOR requerem menor quantidade de termos produtos, quando comparado com implementação com expressões AND-OR. A fase de cobertura dos mintermos em ambos os métodos foi formulada como um problema de programação linear inteira 0 e 1 que através do programa Lp_solve obteve a solução de menor custo. Na comparação da eficiência dos métodos foram analisados os custos dos circuitos mínimos gerados, a quantidade de memória utilizada e o tempo de execução. Com os resultados obtidos pode-se concluir que, para a maioria dos casos executados, o método Quine-McCluskey Estendido gera uma solução de menor custo. No entanto, com relação ao desempenho computacional (tempo de execução e memória), o método Quine-McCluskey Estendido apresentou-se inferior se comparado ao Quine-McCluskey.<br>With the dissemination of smaller and smaller electronic devices and the advent of new technologies. The search for methods of minimizing Boolean function has been the basis for digital electronics. This work presents the implementation of the first phase of the Extended Quine-McCluskey method, which uses AND-XOR-XNOR structures to generate prime implicants. The goal of this work is to prove that, in most cases, the implementation of a Boolean function using the expressions AND-XOR-XNOR requires fewer product terms than the implementation with AND-OR expressions does. The stage of mini terms covering in both methods was formulated with the 0-1 integer linear programming problem, which obtained lower cost through the Lp_Solve program. While comparing the efficiency of these methods we analised: the costs of the minimum circuits generated, the amount of memory that has been used and the runtime. With the obtained results it is possible to conclude that, for most of the executed cases, the Extended Quine-McCluskey method generates a solution of lower cost. On the other hand, with regards to the computational performance (runtime and memory), the Extended Quine-McCluskey method has shown itself inferior when compared to the Quine-McCluskey method.
APA, Harvard, Vancouver, ISO, and other styles
2

Sanches, Aline de Paula. "Emprego do método de Quine-Mccluskey estendido para gerar circuito mínimo com estruturas ESOP (XOR-XNOR) /." Ilha Solteira, 2017. http://hdl.handle.net/11449/151311.

Full text
Abstract:
Orientador: Alexandre César Rodrigues da Silva<br>Resumo: 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 digital. Neste trabalho apresenta-se a implementação da primeira fase do método Quine-McCluskey Estendido que utiliza-se de estruturas AND-XOR-XNOR para a geração de implicantes primos. O objetivo do trabalho foi comprovar que, na maioria das vezes, a implementação de uma função Booleana utilizando expressões AND-XOR-XNOR requerem menor quantidade de termos produtos, quando comparado com implementação com expressões AND-OR. A fase de cobertura dos mintermos em ambos os métodos foi formulada como um problema de programação linear inteira 0 e 1 que através do programa Lp_solve obteve a solução de menor custo. Na comparação da eficiência dos métodos foram analisados os custos dos circuitos mínimos gerados, a quantidade de memória utilizada e o tempo de execução. Com os resultados obtidos pode-se concluir que, para a maioria dos casos executados, o método Quine-McCluskey Estendido gera uma solução de menor custo. No entanto, com relação ao desempenho computacional (tempo de execução e memória), o método Quine-McCluskey Estendido apresentou-se inferior se comparado ao Quine-McCluskey.<br>Mestre
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Quine-McCluskey method"

1

Joshi, Mayank, Sandeep Kumar Sunori, Naveen Tewari, Sudhanshu Maurya, Mayank Joshi, and Pradeep Kumar Juneja. "Formulation of C++ program for Quine–McCluskey Method of Boolean Function Minimization." In Lecture Notes in Electrical Engineering. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-2354-7_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Quine-McCluskey method"

1

Staneva, Liliya Anestieva. "Minimising using the Method of Quine-McCluskey with Generalised Nets." In 2019 29th Annual Conference of the European Association for Education in Electrical and Information Engineering (EAEEIE). IEEE, 2019. http://dx.doi.org/10.1109/eaeeie46886.2019.9000462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vu, Hoang-Gia, Ngoc-Dai Bui, Anh-Tu Nguyen, and ThanhBangLe. "Performance Evaluation of Quine-McCluskey Method on Multi-core CPU." In 2021 8th NAFOSTED Conference on Information and Computer Science (NICS). IEEE, 2021. http://dx.doi.org/10.1109/nics54270.2021.9701506.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

TOMASZEWSKI, SEBASTIAN P., ILGAZ U. CELIK, and GEORGE E. ANTONIOU. "INTERNET-BASED BOOLEAN FUNCTION MINIMIZATION USING A MODIFIED QUINE-MCCLUSKEY METHOD." In Proceedings of the International Conference. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812810885_0030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sarkar, Mayukh, Prasun Ghosal, and Saraju P. Mohanty. "Reversible circuit synthesis using ACO and SA based Quine-McCluskey method." In 2013 IEEE 56th International Midwest Symposium on Circuits and Systems (MWSCAS). IEEE, 2013. http://dx.doi.org/10.1109/mwscas.2013.6674674.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jain, Tarun Kumar, D. S. Kushwaha, and A. K. Misra. "Optimization of the Quine-McCluskey Method for the Minimization of the Boolean Expressions." In 2008 Fourth International Conference on Autonomic and Autonomous Systems (ICAS). IEEE, 2008. http://dx.doi.org/10.1109/icas.2008.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Krishnamurthy, M., A. Kannan, E. Rajalakshmi, and R. Baskaran. "Prediction of customer buying nature from frequent itemsets generation using Quine-Mccluskey method." In IET Chennai Fourth International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/ic.2013.0345.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Seda, Pavel, Milos Seda, Jiri Hosek, Jan Dvorak, and Jindriska Sedova. "The Improvement of Quine-McCluskey Method Using Set Covering Problem for Safety Systems." In 2019 4th International Conference on Intelligent Green Building and Smart Grid (IGBSG). IEEE, 2019. http://dx.doi.org/10.1109/igbsg.2019.8886174.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Majumder, Alak, Barnali Chowdhury, Abir J. Mondai, and Kunj Jain. "Investigation on Quine McCluskey method: A decimal manipulation based novel approach for the minimization of Boolean function." In 2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV). IEEE, 2015. http://dx.doi.org/10.1109/edcav.2015.7060531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, Dai Hyun, Andrew Kostrzewski, Yao Li, and George Eichmann. "A sign/logarithm number-system-based fast optical binary multiplier." In OSA Annual Meeting. Optica Publishing Group, 1990. http://dx.doi.org/10.1364/oam.1990.tuuu5.

Full text
Abstract:
We will present a new fast binary multiplication scheme based on the use of a nonholographic parallel optical content addressable memory (CAM). The multiplication operation is performed by means of binary logarithmic addition that uses a sign/logarithm number system. Multiplication of two binary numbers a and b begins by converting them into a sign/logarithm number system. Multiplication is accomplished by adding appropriate logarithms. A 3-stage non-holographic CAM is required to implement a sign/logarithm number multiplier. By means of a Quine-McCluskey minimization method, the number of CAM's minterms are reduced. For a 7-bit binary multiplication the first CAM, reduced from 605 to 111 minterms, converts the binary numbers to sign/logarithm numbers. To add the two logarithms, a second CAM, reduced from 2519 to 270 minterms, performs a floating-point binary-carry look-ahead addition. Finally, a third CAM with 329 instead of 891 minterms, does the conversion from sign/logarithm numbers back to binary numbers. In general, the storage capacity needed for each CAM stage depends on the range of input numbers and the calculation accuracy.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Quine-McCluskey method' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography