Zaloguj się

Gotowe bibliografie tematyczne / Boolean Functional Synthesis / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Boolean Functional Synthesis.

Artykuły w czasopismach na temat „Boolean Functional Synthesis”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 20 najlepszych artykułów w czasopismach naukowych na temat „Boolean Functional Synthesis”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Pashukov, Artem. "Application of Weight-Based Sum Codes at the Synthesis of Circuits for Built-in Control by Boolean Complement Method." Automation on transport 8, no. 1 (2022): 101–14. http://dx.doi.org/10.20295/2412-9186-2022-8-1-101-114.

Pełny tekst źródła

Streszczenie:

This work considers the application of Boolean complement method for the organization of self-checking circuits of built-in control for the devices synthesized on being Field-Programmable Gate Arrays. Review is given for the application of Boolean complement method while using various noise-resistant codes. The example is demonstrated for control circuit synthesis with Boolean complement method. Algorithm for control system synthesis by Boolean complement method with the use of weight-based sum codes by module M is formulated. As an example, weighted codes are considered with the summation of

Style APA, Harvard, Vancouver, ISO itp.

2

Efanov, Dmitriy, and Tat'yana Pogodina. "Self-Dual Functional Gates for the Synthesis of Controllable Digital Systems." Transport automation research 9, no. 2 (2023): 205–21. http://dx.doi.org/10.20295/2412-9186-2023-9-02-205-221.

Pełny tekst źródła

Streszczenie:

All self-dual analogs of elementary functional gates have been considered, the use of which allows for the synthesis of self-dual circuit implementations of arbitrary Boolean functions. In this case, two synthesis methods can be used, each one based on the property of any Boolean function to be transformed into a self-dual function using one additional variable. The first method involves replacing all non-self-dual functional gates in the device structure with self-dual analogs. The second one involves obtaining a self-dual function from the original formula. The study conducted modeling of se

Style APA, Harvard, Vancouver, ISO itp.

3

Rawski, Mariusz. "Application of Indexed Partition Calculus in Logic Synthesis of Boolean Functions for FPGAs." International Journal of Electronics and Telecommunications 57, no. 2 (2011): 209–16. http://dx.doi.org/10.2478/v10177-011-0029-4.

Pełny tekst źródła

Streszczenie:

Application of Indexed Partition Calculus in Logic Synthesis of Boolean Functions for FPGAsFunctional decomposition of Boolean functions specified by cubes proved to be very efficient. Most popular decom-position methods are based on blanket calculus. However computation complexity of blanket manipulations strongly depends on number of function's variables, which prevents them from being used for large functions of many input and output variables. In this paper a new concept of indexed partition is proposed and basic operations on indexed partitions are defined. Application of this concept to

Style APA, Harvard, Vancouver, ISO itp.

4

Abdollahi, Afshin, Mehdi Saeedi, and Massoud Pedram. "Reversible logic synthesis by quantum rotation gates." Quantum Information and Computation 13, no. 9&10 (2013): 771–92. http://dx.doi.org/10.26421/qic13.9-10-3.

Pełny tekst źródła

Streszczenie:

A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a recursive functional bi-decomposition approach is proposed to automatically synthesize a given function. While Boolean reversible logic is particularly addressed, our framework constructs intermediate quantum states that may be in superposition, hence we combine techniques from reversible Boolean logic and quantum computation. {The proposed approach results in quadr

Style APA, Harvard, Vancouver, ISO itp.

5

BRAHA, DAN. "Design-as-satisfiability: A new approach to automated synthesis." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 15, no. 5 (2001): 385–99. http://dx.doi.org/10.1017/s0890060401155022.

Pełny tekst źródła

Streszczenie:

This article addresses computational synthesis systems that attempt to find a structural description that matches a set of initial functional requirements and design constraints with a finite sequence of production rules. It has been previously shown by the author that it is computationally difficult to identify a sequence of production rules that can lead to a satisficing design solution. As a result, computational synthesis, particularly with large volumes of selection information, requires effective design search procedures. Many computational synthesis systems utilize transformational sear

Style APA, Harvard, Vancouver, ISO itp.

6

Prihozhy, Anatoly A. "Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams." Journal of the Belarusian State University. Mathematics and Informatics, no. 3 (December 14, 2021): 84–97. http://dx.doi.org/10.33581/2520-6508-2021-3-84-97.

Pełny tekst źródła

Streszczenie:

The problem of synthesis and optimisation of logical reversible and quantum circuits from functional descriptions represented as decision diagrams is considered. It is one of the key problems being solved with the aim of creating quantum computing technology and quantum computers. A new method of stepwise transformation of the initial functional specification to a quantum circuit is proposed, which provides for the following project states: reduced ordered binary decision diagram, if-decision diagram, functional if-decision diagram, reversible circuit and quantum circuit. The novelty of the me

Style APA, Harvard, Vancouver, ISO itp.

7

Perkowski, Marek A., Malgorzata Chrzanowska-Jeske, Andisheh Sarabi, and Ingo Schäfer. "Multi-Level Logic Synthesis Based on Kronecker Decision Diagrams and Boolean Ternary Decision Diagrams for Incompletely Specified Functions." VLSI Design 3, no. 3-4 (1995): 301–13. http://dx.doi.org/10.1155/1995/24594.

Pełny tekst źródła

Streszczenie:

This paper introduces several new families of decision diagrams for multi-output Boolean functions. The introduced families include several diagrams known from literature (BDDs, FDDs) as subsets. Due to this property, these diagrams can provide a more compact representation of functions than either of the two decision diagrams. Kronecker Decision Diagrams (KDDs) with negated edges are based on three orthogonal expansions (Shannon, Positive Davio, Negative Davio) and are created here for incompletely specified Boolean functions as well. An improved efficient algorithm for the construction of KD

Style APA, Harvard, Vancouver, ISO itp.

8

Stojkovic, Suzana, Milena Stankovic, and Claudio Moraga. "Complexity reduction of Toffoli networks based on FDD." Facta universitatis - series: Electronics and Energetics 28, no. 2 (2015): 251–62. http://dx.doi.org/10.2298/fuee1502251s.

Pełny tekst źródła

Streszczenie:

Synthesis of switching functions by Toffoli gates has become a very important research topic in the last years, since Toffoli gates are used in the synthesis of reversible circuits. Early methods based on the truth-table representation of Boolean functions are applicable to functions with a relatively small number of variables. Later on, methods for synthesis by Toffoli gates based on decision diagrams (BDDs, FDDs or OKFDDs) were introduced and applied to the synthesis of both reversible and irreversible functions. This paper presents a method for the reduction of the number of lines and gates

Style APA, Harvard, Vancouver, ISO itp.

9

Efanov, D. V., and D. V. Pivovarov. "FUNCTIONAL APPROACH TO THE SYNTHESIS OF CONCURRENT ERROR-DETECTION CIRCUIT BASED ON BOOLEAN COMPLEMENT AND USE OF "2-OUT-OF-5" CONSTANT-WEIGHT CODE." Informatika i sistemy upravleniya, no. 4 (2021): 81–94. http://dx.doi.org/10.22250/isu.2021.70.81-94.

Pełny tekst źródła

Streszczenie:

A method for self-checking concurrent error-detection circuit synthesis based on Boolean com-plement and "2-out-of-5" constant-weight code is described. The method is notable for using functional relationship between the signals from the working and control outputs instead of ana-lyzing the unit performance on each input. The functional dependence is established with due account to the requirements for the formation of codewords of the "2-out-of-5" code and a com-plete tester check. In addition, it considers the formation of a complete set of test combinations for transformation elements in th

Style APA, Harvard, Vancouver, ISO itp.

10

SELVARAJ, HENRY, PIOTR SAPIECHA, MARIUSZ RAWSKI, and TADEUSZ ŁUBA. "FUNCTIONAL DECOMPOSITION — THE VALUE AND IMPLICATION FOR BOTH NEURAL NETWORKS AND DIGITAL DESIGNING." International Journal of Computational Intelligence and Applications 06, no. 01 (2006): 123–38. http://dx.doi.org/10.1142/s1469026806001782.

Pełny tekst źródła

Streszczenie:

General functional decomposition is mainly perceived as a logic synthesis method for implementing Boolean functions into FPGA-based architectures. However it also has important applications in many other fields of modern engineering and science. In this paper, advantages of functional decomposition are demonstrated on "real life" examples. Application of decomposition-based methods in other fields of modern engineering is presented. In the case of decision tables, application of decomposition methods leads to significant benefits in the analysis process of data dependencies, especially in case

Style APA, Harvard, Vancouver, ISO itp.

11

Cheburakhin, I. F., and O. N. Gavrish. "About One Efficient Method of Synthesis of Boolean Formulas and Circuits of Functional Elements." MEHATRONIKA, AVTOMATIZACIA, UPRAVLENIE 18, no. 6 (2017): 407–14. http://dx.doi.org/10.17587/mau.18.407-414.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Bibilo, P. N. "Hardware Implementation of Code Converters Designed to Reduce the Length of Binary Encoded Words." Programmnaya Ingeneria 13, no. 8 (2022): 363–82. http://dx.doi.org/10.17587/prin.13.363-382.

Pełny tekst źródła

Streszczenie:

The problem of synthesis of combinational circuits of code converters designed to reduce the length of words from a given set of encoded binary words is considered. The encoding assumes that different binary words will be encoded by different binary codes of shorter length. Code converters of this type are designed to reduce the length of binary words transmitted in digital systems over data buses when the bit depth of the transmitted words exceeds the bit depth of the data bus. For example, 18-bit or 17-bit words need to be transmitted over a 16-bit data bus. Each such word can be transmitted

Style APA, Harvard, Vancouver, ISO itp.

13

CHIANG, TSUNG-HSI, and LAN-RONG DUNG. "VERIFICATION OF DATAFLOW SCHEDULING." International Journal of Software Engineering and Knowledge Engineering 18, no. 06 (2008): 737–58. http://dx.doi.org/10.1142/s0218194008003891.

Pełny tekst źródła

Streszczenie:

This paper presents the formal verification method for high-level synthesis (HLS) to detect design errors of dataflow algorithms by using Petri Net (PN) and symbolic-model-verifier (SMV) techniques. Formal verification in high-level design means architecture verification, which is different from functional verification in register transfer level (RTL). Generally, dataflow algorithms need algorithmic transformations to achieve optimal goals and also need design scheduling to allocate processor resources before mapping on a silicon. However, algorithmic transformations and design scheduling are

Style APA, Harvard, Vancouver, ISO itp.

14

PEDRYCZ, WITOLD, and ADAM GACEK. "LEARNING OF FUZZY AUTOMATA." International Journal of Computational Intelligence and Applications 01, no. 01 (2001): 19–33. http://dx.doi.org/10.1142/s1469026801000068.

Pełny tekst źródła

Streszczenie:

In this study, we revisit the well-known notion of fuzzy state machines and discuss their development through learning. The systematic development of fuzzy state machines has not been pursued as intensively as it could have been expected from the breadth of the possible usage of them as various modelling platforms. We concentrate on the generalization of the well known architectures exploited in Boolean system synthesis, namely Moore and Mealy machines and show how these can be implemented in terms of generic functional modules such as fuzzy JK flip-flops and fuzzy logic neurons (AND and OR ne

Style APA, Harvard, Vancouver, ISO itp.

15

Das, Apangshu, and Sambhu Nath Pradhan. "Shared Reed-Muller Decision Diagram Based Thermal-Aware AND-XOR Decomposition of Logic Circuits." VLSI Design 2016 (April 27, 2016): 1–14. http://dx.doi.org/10.1155/2016/3191286.

Pełny tekst źródła

Streszczenie:

The increased number of complex functional units exerts high power-density within a very-large-scale integration (VLSI) chip which results in overheating. Power-densities directly converge into temperature which reduces the yield of the circuit. An adverse effect of power-density reduction is the increase in area. So, there is a trade-off between area and power-density. In this paper, we introduce a Shared Reed-Muller Decision Diagram (SRMDD) based on fixed polarity AND-XOR decomposition to represent multioutput Boolean functions. By recursively applying transformations and reductions, we obta

Style APA, Harvard, Vancouver, ISO itp.

16

Akshay, S., Supratik Chakraborty, Shubham Goel, Sumith Kulal, and Shetal Shah. "Boolean functional synthesis: hardness and practical algorithms." Formal Methods in System Design, October 21, 2020. http://dx.doi.org/10.1007/s10703-020-00352-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Tupkalo, Viltalii, and Serhii Cherepkov. "Systems engineering of cybersecured digital and information measuring systems based on the signature Boolean-polynomial algebra synthesis apparatus." Measurements infrastructure 5 (May 5, 2023). http://dx.doi.org/10.33955/v5(2023)-024.

Pełny tekst źródła

Streszczenie:

Development of DIMSCC models with cyber-controllability of their apparatus and software for computing function (operations) in real time becomes the primary task since the problem relevance of the cyber security of digital information and measuring systems of control complexes (DIMSCC) for critical infrastructure objects is increasing. Based on an analysis of known digital systems functional control methods new term «functional cyber-controllability of the digital informational and measuring system» was defined in the article. New approach to operational functional control of hardware redundan

Style APA, Harvard, Vancouver, ISO itp.

18

Bhunia, Kousik, Arighna Deb, Kamalika Datta, Muhammad Hassan, Saeideh Shirinzadeh, and Rolf Drechsler. "ReSG: A Data Structure for Verification of Majority based In-Memory Computing on ReRAM Crossbars." ACM Transactions on Embedded Computing Systems, August 9, 2023. http://dx.doi.org/10.1145/3615358.

Pełny tekst źródła

Streszczenie:

Recent advancements in the fabrication of Resistive Random Access Memory (ReRAM) devices have led to the development of large scale crossbar structures. In-memory computing architectures relying on ReRAM crossbars aim to mitigate the processor-memory bottleneck that exists with current CMOS technology. With this motivation, several synthesis and mapping approaches focusing on the realizations of Boolean functions in the ReRAM crossbars have been proposed earlier. Thus far, the verification of the designs realized on ReRAM crossbars is done either through manual inspection or using simulation b

Style APA, Harvard, Vancouver, ISO itp.

19

Benyo, Sarah, Robert A. Saadi, Scott Walen, and Jessyka G. Lighthall. "A Systematic Review of Surgical Techniques for Management of Severe Rhinophyma." Craniomaxillofacial Trauma & Reconstruction, January 6, 2021, 194338752098311. http://dx.doi.org/10.1177/1943387520983117.

Pełny tekst źródła

Streszczenie:

Study Design: Systematic review of the literature. Objective: The goal of this study is to review the current literature on severe rhinophyma requiring operative management for significant cosmetic deformity or nasal obstruction. We aim to provide a treatment algorithm for the various surgical techniques employed in the treatment of severe rhinophyma. Methods: Independent searches of the PubMed and MEDLINE databases were performed. Articles from the period of 2010 to 2020 were collected. All studies which described surgical treatment of severe rhinophyma using the Boolean method and relevant s

Style APA, Harvard, Vancouver, ISO itp.

20

Ramsay, Jennifer, Christopher Sandom, Thomas Ings, and Helen C. Wheeler. "What evidence exists on the impacts of large herbivores on climate change? A systematic map protocol." Environmental Evidence 11, no. 1 (2022). http://dx.doi.org/10.1186/s13750-022-00270-2.

Pełny tekst źródła

Streszczenie:

Abstract Background In recent years there has been an increased focus on the role of large herbivores in ecosystem restoration and climate change mitigation. There are multiple processes by which large herbivores could potentially influence climate feedback and forcing effects, but the evidence has not yet been synthesised in a systematic and accessible format. Grazing, browsing, trampling, defecation, and seed dispersal by large herbivores can influence vegetation and soils in ways that may directly or indirectly contribute to climate change or mitigation. For example, changes in vegetation c

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!