Добірка наукової літератури з теми "Boolean Functional Synthesis"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Boolean Functional Synthesis".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Boolean Functional Synthesis"
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 (March 15, 2022): 101–14. http://dx.doi.org/10.20295/2412-9186-2022-8-1-101-114.
Повний текст джерелаEfanov, Dmitriy, and Tat'yana Pogodina. "Self-Dual Functional Gates for the Synthesis of Controllable Digital Systems." Transport automation research 9, no. 2 (June 13, 2023): 205–21. http://dx.doi.org/10.20295/2412-9186-2023-9-02-205-221.
Повний текст джерелаRawski, Mariusz. "Application of Indexed Partition Calculus in Logic Synthesis of Boolean Functions for FPGAs." International Journal of Electronics and Telecommunications 57, no. 2 (June 1, 2011): 209–16. http://dx.doi.org/10.2478/v10177-011-0029-4.
Повний текст джерелаAbdollahi, Afshin, Mehdi Saeedi, and Massoud Pedram. "Reversible logic synthesis by quantum rotation gates." Quantum Information and Computation 13, no. 9&10 (September 2013): 771–92. http://dx.doi.org/10.26421/qic13.9-10-3.
Повний текст джерелаBRAHA, DAN. "Design-as-satisfiability: A new approach to automated synthesis." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 15, no. 5 (November 2001): 385–99. http://dx.doi.org/10.1017/s0890060401155022.
Повний текст джерела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.
Повний текст джерела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 (January 1, 1995): 301–13. http://dx.doi.org/10.1155/1995/24594.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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 (March 2006): 123–38. http://dx.doi.org/10.1142/s1469026806001782.
Повний текст джерелаДисертації з теми "Boolean Functional Synthesis"
Martins, Mayler Gama Alvarenga. "Funtional composition and applications." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/164440.
Повний текст джерелаThis work presents functional composition (FC) as a new paradigm for combinational logic synthesis. FC is a bottom-up approach to synthesize Boolean functions, being able to evaluate the cost of intermediate sub-functions, exploring a larger number of different candidate combinations. These are interesting advantages when compared to the top-down behavior of functional decomposition. FC presents great flexibility to implement algorithms with optimal or suboptimal results for different applications. The proposed strategy presents good results for the synthesis of Boolean functions targeting different technologies. FC is based on the following principles: (1) the representation of logic functions is done by a bonded pair of functional and structural representations; (2) the algorithm starts from a set of initial functions; (3) simpler functions are associated to create more complex ones; (4) there is a partial order, enabling dynamic programming; (5) a set of allowed functions can be used in order to reduce execution time/memory consumption. This work presents functional composition algorithms for Boolean factoring, including optimal factoring, Boolean factoring considering the exclusive-OR operator, minimum decision chain computation and synthesis of functions considering only majority and inverter logic gates.
Martinelli, Andres. "Advances in Functional Decomposition: Theory and Applications." Doctoral thesis, SICS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-21180.
Повний текст джерелаMartinelli, Andrés. "Advances in Functional Decomposition: Theory and Applications." Doctoral thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4135.
Повний текст джерелаQC 20100909
Callegaro, Vinicius. "Read-polarity-once functions." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/87583.
Повний текст джерелаEfficient exact factoring algorithms are limited to read-once functions, in which each variable appears once in the final Boolean equation. However, those algorithms present two main constraints: (1) they do not consider incompletely specified Boolean functions; and (2) they are not suitable for binate functions. To overcome the first drawback, it is proposed an algorithm that finds read-once formulas for incompletely specified Boolean functions, whenever possible. With respect to the second limitation, a domain transformation that splits existing binate variables into two independent unate variables is presented. Such domain transformation leads to incompletely specified Boolean functions, which can be efficiently factored by applying the proposed algorithm. The combination of both contributions gives optimal results for a novel broader class of Boolean functions named as read-polarity-once functions, where each polarity (positive or negative) of a variable appears at most once in the factored form. Experimental results over ISCAS'85 benchmark circuits have shown that read-polarityonce functions are significantly more frequent than read-once functions, for which many works have already been devoted in the literature.
Dubrova, Elena Vladimirovna. "Boolean and multiple-valued functions in combinational logic synthesis." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ34259.pdf.
Повний текст джерелаPeh, Lawrence T. W. "An efficient algorithm for extracting Boolean functions from linear threshold gates, and a synthetic decompositional approach to extracting Boolean functions from feedforward neural networks with arbitrary transfer functions." University of Western Australia. Dept. of Computer Science, 2000. http://theses.library.uwa.edu.au/adt-WU2003.0013.
Повний текст джерелаFiszer, Robert Adrian. "Synthesis of Irreversible Incompletely Specified Multi-Output Functions to Reversible EOSOPS Circuits with PSE Gates." PDXScholar, 2014. https://pdxscholar.library.pdx.edu/open_access_etds/2109.
Повний текст джерелаKothamachu, Varun Bhaskar. "An investigation into dynamic and functional properties of prokaryotic signalling networks." Thesis, University of Exeter, 2016. http://hdl.handle.net/10871/26597.
Повний текст джерелаBesson, Thierry. "Optimisation de ROBBDs et applications." Grenoble INPG, 1996. http://www.theses.fr/1996INPG0190.
Повний текст джерелаDubrova, Elena Vladimirovna. "Boolean and multiple-valued functions in combinational logic synthesis." Thesis, 1997. http://hdl.handle.net/1828/8276.
Повний текст джерелаGraduate
Книги з теми "Boolean Functional Synthesis"
Porwik, Piotr. Widmowe modelowanie systemów cyfrowych o zadanych cechach. Katowice: Wydawn. Uniwersytetu Śląskiego, 2000.
Знайти повний текст джерелаKim, Jinwon. A cube-based recursive goal-oriented method for the synthesis of Boolean logic functions. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1993.
Знайти повний текст джерелаSokolov, Artem, and Oleg Zhdanov. Cryptographic constructions on the basis of functions of multivalued logic. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1045434.
Повний текст джерелаЧастини книг з теми "Boolean Functional Synthesis"
Akshay, S., Supratik Chakraborty, and Sahil Jain. "Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis." In Computer Aided Verification, 367–89. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37706-8_19.
Повний текст джерелаLin, Yi, Lucas M. Tabajara, and Moshe Y. Vardi. "ZDD Boolean Synthesis." In Tools and Algorithms for the Construction and Analysis of Systems, 64–83. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_4.
Повний текст джерелаFried, Dror, Lucas M. Tabajara, and Moshe Y. Vardi. "BDD-Based Boolean Functional Synthesis." In Computer Aided Verification, 402–21. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41540-6_22.
Повний текст джерелаAkshay, S., Supratik Chakraborty, Ajith K. John, and Shetal Shah. "Towards Parallel Boolean Functional Synthesis." In Tools and Algorithms for the Construction and Analysis of Systems, 337–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-54577-5_19.
Повний текст джерелаScholl, Christoph. "Realizations of Boolean Functions." In Functional Decomposition with Applications to FPGA Synthesis, 1–22. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-3393-8_1.
Повний текст джерелаAkshay, S., Supratik Chakraborty, Shubham Goel, Sumith Kulal, and Shetal Shah. "What’s Hard About Boolean Functional Synthesis?" In Computer Aided Verification, 251–69. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96145-3_14.
Повний текст джерелаChakraborty, Supratik. "Boolean Functional Synthesis: From Under the Hood of Solvers." In Logic and Its Applications, 11–22. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-26689-8_2.
Повний текст джерелаGittis, Andreas, Eric Vin, and Daniel J. Fremont. "Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation." In Computer Aided Verification, 526–46. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13188-2_26.
Повний текст джерелаYarlagadda, R. K. Rao, and John E. Hershey. "Boolean Functions." In Hadamard Matrix Analysis and Synthesis, 51. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6313-6_14.
Повний текст джерелаFerraz, Evandro C., Jeferson de Lima Muniz, Alexandre C. R. da Silva, and Gerhard W. Dueck. "Synthesis of Majority Expressions Through Primitive Function Manipulation." In Advanced Boolean Techniques, 135–58. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20323-8_6.
Повний текст джерелаТези доповідей конференцій з теми "Boolean Functional Synthesis"
Tabajara, Lucas M., and Moshe Y. Vardi. "Factored boolean functional synthesis." In 2017 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2017. http://dx.doi.org/10.23919/fmcad.2017.8102250.
Повний текст джерелаAkshay, S., Jatin Arora, Supratik Chakraborty, S. Krishna, Divya Raghunathan, and Shetal Shah. "Knowledge Compilation for Boolean Functional Synthesis." In 2019 Formal Methods in Computer Aided Design (FMCAD). IEEE, 2019. http://dx.doi.org/10.23919/fmcad.2019.8894266.
Повний текст джерелаRawski, Mariusz, and Piotr Szotkowski. "Reversible logic synthesis of boolean functions using functional decomposition." In 2015 MIXDES - 22nd International Conference "Mixed Design of Integrated Circuits & Systems". IEEE, 2015. http://dx.doi.org/10.1109/mixdes.2015.7208547.
Повний текст джерелаGolia, Priyanka, Friedrich Slivovsky, Subhajit Roy, and Kuldeep S. Meel. "Engineering an Efficient Boolean Functional Synthesis Engine." In 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD). IEEE, 2021. http://dx.doi.org/10.1109/iccad51958.2021.9643583.
Повний текст джерелаRawski, Mariusz, and Piotr Szotkowski. "Reversible synthesis of incompletely specified Boolean functions using functional decomposition." In Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2017, edited by Ryszard S. Romaniuk and Maciej Linczuk. SPIE, 2017. http://dx.doi.org/10.1117/12.2281040.
Повний текст джерелаMorawiecki, Pawel, Mariusz Rawski, and Henry Selvaraj. "Application of Functional Decomposition in Synthesis of Boolean Function Sets." In 2008 19th International Conference on Systems Engineering (ICSENG). IEEE, 2008. http://dx.doi.org/10.1109/icseng.2008.65.
Повний текст джерелаZhukov, Vladimir Vladimirovich. "Synthesis method and complexity bounds for programms with some structural restrictions." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-11.
Повний текст джерелаShafat, Gabriel, Binyamin Abramov, and Ilya Levin. "Using Threshold Functions in Teaching Electronics." In ASME 2008 9th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2008. http://dx.doi.org/10.1115/esda2008-59125.
Повний текст джерелаSchnieber, Martha, Saman Froehlich, and Rolf Drechsler. "Depth Optimized Synthesis of Symmetric Boolean Functions." In 2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI). IEEE, 2021. http://dx.doi.org/10.1109/isvlsi51109.2021.00022.
Повний текст джерелаBeg, Azam, P. W. C. Prasad, Walid Ibrahim, and Emad Abu Shama. "Utilizing synthesis to verify Boolean function models." In 2008 IEEE International Symposium on Circuits and Systems - ISCAS 2008. IEEE, 2008. http://dx.doi.org/10.1109/iscas.2008.4541733.
Повний текст джерела