Relevant bibliographies by topics / Quine-McCluskey method / Journal articles

To see the other types of publications on this topic, follow the link: Quine-McCluskey method.

Journal articles 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 top 17 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

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

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

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

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

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

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

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

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

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

Almeida, Tiago da Silva, and André Luiz Gomes de Freitas. "Evaluation of Clause-Column Table method to design of MIC hazard-free in asynchronous finite state machines." Academic Journal on Computing, Engineering and Applied Mathematics 1, no. 2 (2020): 1–8. http://dx.doi.org/10.20873/uft.2675-3588.2020.v1n2.p1-8.

Full text

Abstract:

Asynchronous finite state machines are of great interest because they use fewer transistors to manufacture them. However, find the minimum resources in logic modeling is an NP-Problem, since the search space increase exponentially. Although this problem is studied for some time, there is still space for newer researches. Mostly, in new computational methods to improve performance in solving logical optimization in finite state machines. Thus, this paper presents a study and evaluation of heuristic algorithms for the optimization of asynchronous finite state machines, to obtain the smallest possible circuit. Thus, the Clause-Column Table and Quine-McCluskey algorithms are combined in order to propose an algorithm capable of minimizing asynchronous sequential circuits. Tests and results show that it is possible to synthesize circuits in a reasonable time, but with some logical errors. It may be concluded that it still needs research, even though it is not such a recent line of research.

APA, Harvard, Vancouver, ISO, and other styles

Dom Luís, Acácio, Rafael Benítez, and María del Carmen Bas. "Bridging Crisp-Set Qualitative Comparative Analysis and Association Rule Mining: A Formal and Computational Integration." Mathematics 13, no. 12 (2025): 1939. https://doi.org/10.3390/math13121939.

Full text

Abstract:

In this paper, a novel mathematical formalization of Crisp-Set Qualitative Comparative Analysis (csQCA) that enables a rigorous connection with a specific class of association rule mining (ARM) problems is proposed. Although these two methodologies are frequently used to identify logical patterns in binary datasets, they originate from different traditions. While csQCA is rooted in set theory and Boolean logic and is primarily applied in the social sciences to model causal complexity, ARM originates from data mining and is widely used to discover frequent co-occurrences among items. In this study, we establish a formal mathematical equivalence between csQCA configurations and a subclass of association rules, including both positive and negative conditions. Moreover, we propose a minimization procedure for association rules that mirrors the Quine–McCluskey reduction method employed in csQCA. We demonstrate the consistency of the results obtained using both methodologies through two examples (a small-N study on internet shutdowns in Sub-Saharan Africa and a large-N analysis of immigration attitudes in Europe) and some numerical experiments. However, it is also clear that ARM offers improved scalability and robustness in high-dimensional contexts. Overall, these findings provide researchers with valuable theoretical and practical guidance when choosing between these approaches in qualitative data analysis.

APA, Harvard, Vancouver, ISO, and other styles

Zholubak, I. M., and V. S. Hlukhov. "Galua Field Multipliers Core Generator." International Journal of Computer Network and Information Security 15, no. 3 (2013): 1–14. http://dx.doi.org/10.5815/ijcnis.2023.03.01.

Full text

Abstract:

An important part of based on elliptical curves cryptographic data protection is multipliers of Galois fields. For based on elliptical curves digital signatures, not only prime but also extended Galois fields GF(pm) are used. The article provides a theoretical justification for the use of extended Galois fields GF(dm) with characteristics d > 2, and a criterion for determining the best field is presented. With the use of the proposed criterion, the best fields, which are advisable to use in data protection, are determined. Cores (VHDL descriptions of digital units) are considered as structural part of based on FPGA devices. In the article methods for cryptoprocessors cores creating were analyzed. The article describes the generator of VHDL descriptions of extended Galois field multipliers with big characteristic (up to 2998). The use of mathematical packages for calculations to improve the quality of information security is also considered. The Galois field multipliers generator creates the VHDL description of multipliers schemes, describes connections of their parts and generates VHDL descriptions of these parts as result of Quine-McCluskey Boolean functions minimization method. However, the execution time of the algorithm increases with increasing amount of input data. Accordingly, generating field multipliers with large characteristic can take frерom a few seconds to several tens of seconds. It's important to simplify the design and minimize logic gates number in a field programmable gate array (FPGA) because it will speed up the operation of multipliers. The generator creates multipliers according to the three variants. The efficiency of using multipliers for fields with different characteristics was compared in article. The expediency of using extended Galois fields GF(dm) with characteristics d > 2 in data protection tools is analyzed, a criterion for comparing data protection tools based on such Galois fields is determined, and the best fields according to the selected criterion when implemented according to a certain algorithm are determined.

APA, Harvard, Vancouver, ISO, and other styles

Namose, Prof M. S. "Using the Quine McCluskey Binary Classifier (QMBC) for Heart Disease Prediction." International Journal for Research in Applied Science and Engineering Technology 11, no. 11 (2023): 1005–12. http://dx.doi.org/10.22214/ijraset.2023.56612.

Full text

Abstract:

Abstract: In this examine, we awareness on cardiovascular disease, a major worldwide motive of mortality. Researchers use gadget getting to know and records evaluation strategies to enhance the prognosis of this ailment. We introduce a brand new version, the Quine McCluskey Binary Classifier (QMBC), which combines seven extraordinary fashions to efficiently become aware of patients with coronary heart disease. To decorate performance, we appoint feature selection and extraction methods.First, we discover the top 10 relevant features from the dataset the use of Chi-rectangular and ANOVA approaches. We then lessen the dimensionality of the facts with principal aspect analysis, retaining nine essential additives. The QMBC version combines the outputs of the seven fashions to create a truthful rule for predicting coronary heart ailment. The outcomes from the seven fashions are dealt with as unbiased functions, while the target attribute depends on those results. Our proposed QMBC version outperforms present methods, establishing its effectiveness in heart disorder prediction.

APA, Harvard, Vancouver, ISO, and other styles

Miloš, Šeda. "Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method." May 24, 2007. https://doi.org/10.5281/zenodo.1059733.

Full text

Abstract:

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-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.

APA, Harvard, Vancouver, ISO, and other styles

Shanthi Makka, S. Bharath Reddy, Preeti Jaidka, R. Raja Kumar, and Asma Begum. "Empowering Health Prognosis: Quine Mccluskey Binary Classifier Algorithm for Predicting Heart Disease." Nanotechnology Perceptions, June 22, 2024. https://doi.org/10.62441/nano-ntp.vi.1440.

Full text

Abstract:

Numerous researchers employed the Quine McCluskey Binary Classifier (QMBC) for rapid identification of cardiac patients. These integrated models, including decision trees, random forests, K-nearest neighbors, naive Bayes, support vector machines, and multilayer perceptron’s, demonstrate effective performance on binary classification datasets. Use chi-square, analysis of variance, and principal component analysis to find and select features for predictive modeling. The ensemble model uses the Minimum Boolean expression from the seven models, works better than the best methods that are currently available. The collection includes examples from Cleveland HD, HD Comprehensive, and CVD. Its main goal is to improve accuracy by using advanced ensemble methods. In addition, a more in-depth study looks into how to combine Voting Classifier and Stacking Classifier, with the goal of reaching 100% accuracy. This paper adds to the field by introducing a strong method called QMBC and showing how strategic ensemble methods can be used to improve performance even more.

APA, Harvard, Vancouver, ISO, and other styles

Swiatczak, Martyna Daria. "Different algorithms, different models." Quality & Quantity, August 6, 2021. http://dx.doi.org/10.1007/s11135-021-01193-9.

Full text

Abstract:

AbstractThis study assesses the extent to which the two main Configurational Comparative Methods (CCMs), i.e. Qualitative Comparative Analysis (QCA) and Coincidence Analysis (CNA), produce different models. It further explains how this non-identity is due to the different algorithms upon which both methods are based, namely QCA’s Quine–McCluskey algorithm and the CNA algorithm. I offer an overview of the fundamental differences between QCA and CNA and demonstrate both underlying algorithms on three data sets of ascending proximity to real-world data. Subsequent simulation studies in scenarios of varying sample sizes and degrees of noise in the data show high overall ratios of non-identity between the QCA parsimonious solution and the CNA atomic solution for varying analytical choices, i.e. different consistency and coverage threshold values and ways to derive QCA’s parsimonious solution. Clarity on the contrasts between the two methods is supposed to enable scholars to make more informed decisions on their methodological approaches, enhance their understanding of what is happening behind the results generated by the software packages, and better navigate the interpretation of results. Clarity on the non-identity between the underlying algorithms and their consequences for the results is supposed to provide a basis for a methodological discussion about which method and which variants thereof are more successful in deriving which search target.

APA, Harvard, Vancouver, ISO, and other styles

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!