2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)最新文献

筛选
英文 中文
Ternary Logic Synthesis with Modified Quine-McCluskey Algorithm 基于改进Quine-McCluskey算法的三元逻辑综合
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00035
Sung-Yun Lee, Sunmean Kim, Seokhyeong Kang
{"title":"Ternary Logic Synthesis with Modified Quine-McCluskey Algorithm","authors":"Sung-Yun Lee, Sunmean Kim, Seokhyeong Kang","doi":"10.1109/ISMVL.2019.00035","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00035","url":null,"abstract":"Logic synthesis has been increasingly important to accelerate the development of high-level systems. However, in multi-valued logic, logic synthesis methods that can process emerging devices are deficient. We propose and automate a method to synthesize ternary logic circuits. Our design of ternary logic circuits is based on static gate design, and exploits carbon nanotube field-effect transistors. We optimize ternary logic circuits by minimizing the number of transistors with a modified Quine-McCluskey algorithm. Our proposed method has improved power-delay product by 52.72 % over the state-of-the-art method for a ternary half adder, and by 68.06 % for a ternary multiplier. We also have improved power-delay product by 37.30 % over the state-of-the-art method for a ternary full adder that has high load capacitance. Our design has an average of 42.43 % fewer transistors than the existing design for circuits that have large number of inputs. As circuits become larger, the improved power-delay product and reduced transistor count are advantageous.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127720912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Clausal Form Transformation in MaxSAT MaxSAT中的子句形式变换
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00031
Chu Min Li, F. Manyà, Joan Ramon Soler
{"title":"Clausal Form Transformation in MaxSAT","authors":"Chu Min Li, F. Manyà, Joan Ramon Soler","doi":"10.1109/ISMVL.2019.00031","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00031","url":null,"abstract":"Some clausal form transformation algorithms used in SAT solving cannot be used in MaxSAT solving because they preserve satisfiability but do not preserve the minimum number of unsatisfied formulas. In this paper we define three different MaxSAT clausal form transformations, inspired on the transformations applied in SAT, that derive a multiset of clauses $psi$ from a multiset of arbitrary propositional formulas $phi$ in such a way that the minimum number of unsatisfied clauses in $psi$ is equal to the minimum number of unsatisfied formulas in $phi$.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126207746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Comparative Analysis of Full Adder Custom Design Circuit using Two Regular Structures in Quantum-Dot Cellular Automata (QCA) 量子点元胞自动机(QCA)中两种规则结构全加法器定制设计电路的比较分析
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00041
Rahul Singhal, M. Perkowski
{"title":"Comparative Analysis of Full Adder Custom Design Circuit using Two Regular Structures in Quantum-Dot Cellular Automata (QCA)","authors":"Rahul Singhal, M. Perkowski","doi":"10.1109/ISMVL.2019.00041","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00041","url":null,"abstract":"Regular structures in Quantum-dot Cellular Automata (QCA) allow for ease of design and uniform clocking structure. The paper presents a comparative analysis of QCA realization using regular structures: Shannon-Lattices and Programmable Logic Arrays (PLAs). A software tool was developed that generates complete QCA-Shannon-Lattice and QCA-PLA Layouts for Boolean functions based on an input characterized macro-cell library. The correctness of equations were verified by performing simulations of the generated layouts. It is shown that the new regular lattices outperform PLAs and are closer to full custom design on Full Adders.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122868397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
T-depth Optimization for Fault-Tolerant Quantum Circuits 容错量子电路的t深度优化
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00027
Philipp Niemann, Anshu Gupta, R. Drechsler
{"title":"T-depth Optimization for Fault-Tolerant Quantum Circuits","authors":"Philipp Niemann, Anshu Gupta, R. Drechsler","doi":"10.1109/ISMVL.2019.00027","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00027","url":null,"abstract":"The $mathrm{Clifford}+T$ gate library consisting of Hadamard, T, and CNOT gates has attracted much interest in quantum circuit synthesis, particularly due to its applicability to fault tolerant realizations. Since fault tolerant implementations of the $T$ gate have very high latency, recent work in this area is aiming at minimizing the number of $T$ stages, referred to as the T-depth. In this paper, we present an approach to exploit additional ancilla qubits in the mapping of reversible circuits consistina of multiple controlled Toffoli gates (MCT gates) into $mathrm{califford}+T$ quantum circuits, with the primary optimization objective to minimize the $T$-depth. Our proposed approach takes advantage of and generalizes earlier work on corresponding mapping algorithms. An experimental evaluation shows that our approach leads to a significant $T$-depth reduction compared to earlier approaches.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116261882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
First-Order Nelsonian Paraconsistent Quantum Logic 一阶尼尔森准一致量子逻辑
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00038
N. Kamide
{"title":"First-Order Nelsonian Paraconsistent Quantum Logic","authors":"N. Kamide","doi":"10.1109/ISMVL.2019.00038","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00038","url":null,"abstract":"In this paper, a single-antecedent/succedent sequent calculus NL for first-order Nelsonian paraconsistent quantum logic is investigated. The logic under consideration is regarded as a combination of both Nelson's paraconsistent four-valued logic and Dalla Chiara and Giuntini's paraconsistent quantum logic. The duality and cut-elimination theorems for NL are proved. Decidability, some constructive properties, some constructible falsity properties, and Craig interpolation property are shown for NL. An extend NL with some naive comprehension rules in the naive set theory is also investigated.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116004361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Non-Binary Approaches for Classification of Amyloid Brain PET 脑淀粉样蛋白PET的非二元分类方法
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00043
Katherine Zukotvnski, Vincent C. Gaudet, P. Kuo, Sabrina Adamo, M. Goubran, C. Bocti, M. Borrie, H. Chertkow, R. Frayne, R. Hsiung, R. Laforce, M. Noseworthy, F. Prato, J. Sahlas, C. Scott, Eric E. Smith, V. Sossi, Alex Thiel, J. Soucy, J. Tardif, S. Black
{"title":"Non-Binary Approaches for Classification of Amyloid Brain PET","authors":"Katherine Zukotvnski, Vincent C. Gaudet, P. Kuo, Sabrina Adamo, M. Goubran, C. Bocti, M. Borrie, H. Chertkow, R. Frayne, R. Hsiung, R. Laforce, M. Noseworthy, F. Prato, J. Sahlas, C. Scott, Eric E. Smith, V. Sossi, Alex Thiel, J. Soucy, J. Tardif, S. Black","doi":"10.1109/ISMVL.2019.00043","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00043","url":null,"abstract":"Machine learning (ML) is increasingly used in medical imaging. This paper provides pilot data of decision trees and random forests (RFs) to predict if a 18F-florbetapir brain positron emission tomography (PET) is positive or negative for amyloid deposition based on quantitative data analysis. The dataset included 55 18F-florbetapir brain PETs in participants with severe white matter disease and mild cognitive impairment (MCI), early Alzheimer's disease (AD) or transient ischemic events. The Montreal Cognitive Assessment (MoCA) score was known for each participant. All PET images were processed using the MINC toolkit to extract standardized uptake value ratios (SUVRs) for 59 regions of interest (features). Each PET was clinically read by 2 dual certified radiology/nuclear medicine physicians with final interpretation based on consensus. An initial study of RFs using conventional binary decision trees and PET quantitation suggests this is a powerful algorithm for PET classification as positive or negative for amyloid deposition. Preliminary data did not show improved results when a ternary RF approach was used. Finally, a soft-decision approach may be helpful to predict the $mathbf{MoCA}$ score.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126747714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Waveform Shaping Transmitter Combining Digital and Analog Circuits for Multi - Valued Signaling 波形整形发射机结合数字和模拟电路的多值信号
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00012
Yosuke Iijima, Y. Yuminaka
{"title":"Waveform Shaping Transmitter Combining Digital and Analog Circuits for Multi - Valued Signaling","authors":"Yosuke Iijima, Y. Yuminaka","doi":"10.1109/ISMVL.2019.00012","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00012","url":null,"abstract":"Waveform shaping techniques are employed for high-speed data transmission to compensate for signal distortion in the high-frequency region. This paper presents a transmitter using new waveform shaping techniques for multi-valued signaling. In high-speed data transmission, signals are distorted by a low-pass effect of transmission lines, and the effect becomes more serious in multi-valued data transmission as compared with binary data transmission. By combining digital and analog circuits and tuning the digital parameters, the waveform distortion of the rising and falling edges can be improved. Simulation and experimental results of multi-valued data transmission are shown to demonstrate the feasibility of the proposed transmitter, and that it can control the received waveforms flexibly and improve signal integrity.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121091290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An Approach Toward Classification of Minimal Groupoids on a Finite Set 有限集合上极小群类群的一种分类方法
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00036
Mike Behrisch, Hajime Machida
{"title":"An Approach Toward Classification of Minimal Groupoids on a Finite Set","authors":"Mike Behrisch, Hajime Machida","doi":"10.1109/ISMVL.2019.00036","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00036","url":null,"abstract":"A minimal groupoid is a minimal clone generated by a binary idempotent function. The classification of minimal groupoids on a finite set is not yet complete and seems to be quite a hard task. In this paper a new viewpoint is proposed toward the classification of minimal groupoids. The pr-distance is introduced for binary functions. Using this concept, the generators of 48 minimal groupoids on a 3-element set are classified into three classes: Commutative functions, functions with pr-distance 1 and those with pr-distance 2. Some of the results obtained for the 3-element case generalize to any finite case. In particular, a binary idempotent function on any finite set is proved to generate a minimal groupoid if its pr-distance is 1.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131478340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Scaling-up ESOP Synthesis for Quantum Compilation 量子编译中ESOP综合的放大
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00011
B. Schmitt, Mathias Soeken, G. Micheli, A. Mishchenko
{"title":"Scaling-up ESOP Synthesis for Quantum Compilation","authors":"B. Schmitt, Mathias Soeken, G. Micheli, A. Mishchenko","doi":"10.1109/ISMVL.2019.00011","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00011","url":null,"abstract":"Today's rapid advances in quantum computing hardware call for scalable synthesis methods to map combinational logic represented as multi-level Boolean networks (e.g., an and-inverter graph, AIG) to quantum circuits. Such synthesis process must yield reversible logic function since quantum circuits are reversible. Thus, logic representations using exclusive sum-of-products (ESOP) are advantageous because of their natural relation to Toffoli gates, one of the primitives in reversible logic. This motivates developing effective methods to collapse AIG logic networks into ESOPs. In this work, we present two state-of-the-art methods to collapse an AIG into an ESOP expression, describe their shortcomings and introduce a new approach based on the divide-and-conquer paradigm. We demonstrate the effectiveness of our method in collapsing IEEE-compliant half precision floating point networks. Results show that our method can collapse designs-which were previously not solvable within a week-in less than 5 minutes. We also describe a technique capable of taking advantage of this new method to generate quantum circuits with up to 50% fewer $T$ gates compared to state-of-the-art methods.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114515533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Finite Model Property for Modal Ideal Paraconsistent Four-Valued Logic 模态理想副协调四值逻辑的有限模型性质
2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2019-05-01 DOI: 10.1109/ISMVL.2019.00029
N. Kamide, Yoni Zohar
{"title":"Finite Model Property for Modal Ideal Paraconsistent Four-Valued Logic","authors":"N. Kamide, Yoni Zohar","doi":"10.1109/ISMVL.2019.00029","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00029","url":null,"abstract":"A modal extension M4CC of Arieli, Avron, and Zamansky's ideal paraconsistent four-valued logic 4CC is introduced as a Gentzen-type sequent calculus. The completeness theorem with respect to a Kripke semantics for M4CC is proved. The finite model property for M4CC is shown by modifying the completeness proof. The decidability of M4CC is obtained as a corollary.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114231004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信