S. Yanushkevich, J. T. Butler, G. Dueck, V. Shmerko
{"title":"Experiments on FPRM expressions for partially symmetric logic functions","authors":"S. Yanushkevich, J. T. Butler, G. Dueck, V. Shmerko","doi":"10.1109/ISMVL.2000.848612","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848612","url":null,"abstract":"This paper focuses on the fired polarity Reed-Muller (FPRM) expression of multiple-valued logic (MVL) symmetric functions. In the FPRM expression, each variable occurs in exactly one complemented form. We show properties of the FPRM of partially symmetric functions and report experimental results for certain benchmark functions.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123906439","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}
{"title":"Probabilistic verification of multiple-valued functions","authors":"E. Dubrova, Harald Sack","doi":"10.1109/ISMVL.2000.848659","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848659","url":null,"abstract":"This paper describes a probabilistic method for verifying the equivalence of two multiple-valued functions. Each function is hashed to an integer code by transforming it to a integer-valued polynomial and the equivalence of two polynomials is checked probabilistically. The hash codes for two equivalent functions are always the same. Thus, the equivalence of two functions can be verified with a known probability of error, arising from collisions between inequivalent functions. Such a probabilistic verification can be an attractive alternative for verifying functions that are too large to be handled by deterministic verification methods.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128546777","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}
Hyeon-Kyeong Seong, J. Choi, Boo Sik Shin, Heung-Soo Kim
{"title":"Implementation of multiple-valued multiplier on GF(3/sup m/) using current mode CMOS","authors":"Hyeon-Kyeong Seong, J. Choi, Boo Sik Shin, Heung-Soo Kim","doi":"10.1109/ISMVL.2000.848623","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848623","url":null,"abstract":"The multiplication algorithm of two polynomials on finite fields GF(3/sup m/) is presented. The 3-valued multiplier of the serial-in/parallel-out modular structures on GF(3/sup 3/) to be performed on the presented multiplication algorithm is implemented by current-mode CMOS. The current-mode CMOS 3-valued multiplier is implemented two GF(3) multipliers and two GF(3) adders. Performances of the proposed circuits are evaluated using Pspice simulations with 2.0 /spl mu/m standard CMOS device parameters, 20 /spl mu/A unit current level and 3.3 V V/sub DD/ voltage supply.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129639367","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}
{"title":"Multi-valued logic pass gate network using neuron-MOS transistors","authors":"Jing Shen, M. Inaba, K. Tanno, O. Ishizuka","doi":"10.1109/ISMVL.2000.848594","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848594","url":null,"abstract":"A multi-valued logic (MVL) pass gate is an important element to configure multi-valued logic networks. Different from binary pass gates, multiple logical levels are required to be discriminated in MVL pass gates. In this paper, according to the feature of the threshold operation of a neuron MOS transistor (VMOS), two types of MVL pass gates using /spl nu/MOS are presented. One type, a CMOS MVL pass gate with VMOS down literal circuit, is composed of a CMOS pass gate and a VMOS threshold gate (/spl nu/MOS down literal circuit (DLC)). The discrimination between different MVL signals is realized by the threshold gate. Another type, a /spl nu/MOS hybrid pass gate, consists of a /spl nu/MOS transistor, a MOS transistor and a binary inverter. The VMOS transistor as used as a pass transistor, and the threshold discrimination is directly implemented by the VMOS pass gate. The latter is more compact than the former. The number of transistors and the layout area of the MVL network can be reduced by using /spl nu/MOS hybrid pass gates, while the bias setting is easier by using CMOS MVL pass gates. The common advantages of the proposed pass gates are low fabrication cost and possibility to build reconfigurable networks.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127823524","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}
{"title":"Some properties of discrete interval truth valued logic","authors":"N. Takagi, K. Nakashima","doi":"10.1109/ISMVL.2000.848606","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848606","url":null,"abstract":"This paper focus on functions defined on a special subset of the power set of {0, 1, ..., r-1} (the elements in the subset will be called discrete interval truth values because they act precisely as intervals) and operations on. The truth values. The operations discussed in this paper will be called regular because they can be seen as an extension of the regularity which was introduced by Kleene in his ternary logic. M. Mukaidono investigated some properties of ternary functions which can be represented by the regular operations. He called such ternary functions \"regular ternary logic functions\". Regular ternary logic functions are useful for representing and analyzing ambiguities such as transient states and/or initial stated in binary logic circuits that Boolean functions cannot cope with. They are also applicable to studied of fail-safe systems for binary logic circuits. In this paper, we will discuss an extension of regular ternary logic functions to functions on the discrete interval truth values. Section 2 will give some of the basic definitions of discrete interval truth valued logic, and show dome of its mathematical properties. In Section 3 we will give logic formulas which represent minimum and maximum information loss functions.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125054944","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}
{"title":"Multi-valued sub-function encoding in functional decomposition based on information relationships measures","authors":"A. Chojnacki, L. Józwiak","doi":"10.1109/ISMVL.2000.848604","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848604","url":null,"abstract":"Functional decomposition is becoming more and more popular, because it is more general than all other known logic synthesis approaches and it seems to be the most effective approach for LUT-based FPGAs, (C)PLDs and complex CMOS-gates. The multi-level functional decomposition can be seen as a recursive splitting of a given function, into two sub-functions: the predecessor (bound-set) function and successor function, initially, the bound set function is a multi-valued (symbolic) function, where a certain value (symbol) is assigned to each particular input-cube compatibility class of the function being decomposed. To be implemented with binary logic, the multi-valued bound-set function must be expressed as a set of binary functions. This transformation is called the multi-valued sub-function encoding. It can be performed by the binary code assignment to each particular input-cube compatibility class. It determines the resulting binary predecessor and successor sub-functions and therefore influences the quality of the resulting circuit to a high degree. In this paper, a new method of the multi-valued sub-function encoding is presented. The method is based on the information relationship measures. Experimental results from the prototype CAD-tool that implements the method demonstrate that it is able to efficiently construct extremely effective circuits for symmetric functions. Results for asymmetric functions are also very good.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130393584","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}
Mark E. Bauer, R. Alexis, Gregory E. Atwood, B. Baltar, A. Fazio, K. Frary, M. Hensel, M. Ishac, Jahanshir J. Javanifard, Marcus E. Landgraf, D. Leak, K. Loe, D. Mills, P. Ruby, R. Rozman, S. Sweha, S. Talreja, K. Wojciechowski
{"title":"A multilevel-cell 32 Mb flash memory","authors":"Mark E. Bauer, R. Alexis, Gregory E. Atwood, B. Baltar, A. Fazio, K. Frary, M. Hensel, M. Ishac, Jahanshir J. Javanifard, Marcus E. Landgraf, D. Leak, K. Loe, D. Mills, P. Ruby, R. Rozman, S. Sweha, S. Talreja, K. Wojciechowski","doi":"10.1109/ISMVL.2000.848644","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848644","url":null,"abstract":"A flash memory with multilevel cell significantly reduces the memory per-bit cost. A 32 Mb multilevel-cell (MLC) flash memory storing two bits of data per cell achieves 32 Mb memory storage capacity using 16 M flash memory cells. This 32 Mb flash memory on a 0.6 /spl mu/m process has a 2.0/spl times/1.8 /spl mu/m/sup 2/ flash cell. In MLC operation, the logical flash memory cell achieves two bits per cell using four possible states, defined by four flash cell threshold voltage ranges. The relationship between the threshold voltage ranges stored in the first memory cell and the corresponding logic levels is shown in this paper, which also shows a plot of the four threshold voltage distributions, each with a separation range.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130409188","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}
{"title":"On the number of dependent variables for incompletely specified multiple-valued functions","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL.2000.848605","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848605","url":null,"abstract":"This paper considers the minimization of dependent variables in functions with many don't cares. It also derives the conditions for almost all randomly generated function to be redundant in at least one variable. Experimental results support the validity of the approach.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128758714","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}
{"title":"Computation of spectral information from logic netlists","authors":"R. Drechsler, M. Thornton","doi":"10.1109/ISMVL.2000.848600","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848600","url":null,"abstract":"Spectral information can be used for many CAD system tasks including synthesis, verification and test vector generation. We analyze the problem of extracting spectral information from Boolean and multi-valued logic netlists. It is shown that spectral information may be calculated directly from output probabilities and a method for extracting output probabilities from general graphs is described. As a special case, we consider AND/OR graphs which are a data structure recently proposed as an alternative to decision diagrams. Experimental results are given to demonstrate the efficiency of our approach.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129793563","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}
{"title":"A four-valued logic B(4) of E(9) for modeling human communication","authors":"D. Rine, R. Alnakari","doi":"10.1109/ISMVL.2000.848633","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.848633","url":null,"abstract":"In this paper a four-valued logic on B(4) called Hyawic Form UniLogic is presented. Examples of this UniLogic are given which model problems in the area of human interaction, dialog and communication, i.e., human speech. The four values, or states, are isolated, conflicting, coexisting and unifying, forming a square lattice of B(4), Post Algebra of order 2 with 4 elements, inside a Post Algebra on E(9) of order 3 with 9=3/sup */3 elements. This logic has been used to represent human speech problems and their solutions in college classrooms. This logic is used in different universities, countries and languages including France, Algeria, Egypt and USA. It is used for policy analysis and planning, as well as for academic research in inter-communications analysis. Software packages using this logic are available from the developer Dr. Raiek Alnakari.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124747151","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}