{"title":"Fault characterization and testability considerations in multi-valued logic circuits","authors":"M. Abd-El-Barr, Maher Al-Sherif, Mohamed Y. Osman","doi":"10.1109/ISMVL.1999.779726","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779726","url":null,"abstract":"With the growing interest and the emergence of various implementations of Multiple-Valued logic (MVL) circuits, testability issues of these circuits are becoming crucial. Fault characterization is an early step in the test generation process. It is aimed at finding fault models that best describe the possible faults expected to occur in a given class of circuits or technology. Layout and device level studies on CMOS and BiCMOS circuits revealed that the stuck-at model is not adequate to represent the actual physical defects. In this paper our aim is to characterize faults in a CMOS functionally complete set of MVL operators. The set has been implemented using existing standard binary CMOS technology. This enables us to characterize faults in these operators using the same techniques used for standard binary CMOS. Fault categories in MVL circuits and recommendations for testability will be given.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115699874","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":"Shared multiple-valued decision diagrams for multiple-output functions","authors":"H. M. H. Babu, Tsutomu Sasao","doi":"10.1109/ISMVL.1999.779712","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779712","url":null,"abstract":"In this paper, we propose a method to represent multiple-output functions using shared multiple-valued decision diagrams (SMDDs). We show an algorithm for pairing the input variables of binary decision diagrams (BDDs). We also present the pair sifting that moves pairs of 4-valued input variables to speed up the normal sifting, and to produce compact SMDDs. The size of the SMDD is the total number of non-terminal nodes excluding the nodes for output selection variables. We derive the sizes of SMDDs for general functions and symmetric functions. From experimental results, we conjecture that, for n>1, the sizes of SMDDs for bit-counting functions (wgt n) and incrementing functions (inc n) are n[log/sub 2/n]+n-2([log/sub 2/n]) and 2n-1, respectively, where n is the number of binary input variables, and [a] denotes the largest integer not greater than a. We also compare our method with other one. Experimental results show the efficiency of our method.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115386937","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":"Evaluation of m-valued fixed polarity generalizations of Reed-Muller canonical form","authors":"E. Dubriva","doi":"10.1109/ISMVL.1999.779701","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779701","url":null,"abstract":"This paper compares the complexity of three different fixed polarity generalizations of Reed-Muller canonical form to multiple-valued logic. The Galois field-based expansion introduced by D.H. Green and I.S. Taylor (1974), the Reed-Muller-Fourier form of R.S. Stankovic and C. Moraga (1998), and the expansion over addition modulo m, minimum and the set of all literal operators introduced by the author and Muzio. An algorithm for computing the minimal canonical forms for these generalizations is implemented and applied to a set of encoded 4-valued benchmark functions, 3- and 4-valued adders and multipliers. The experimental results show that, for the benchmark functions, the Reed-Muller-Fourier form and our expansion yield a comparable number of products on average. They have 40% less products on average than the expansion of Green and Taylor. The Reed-Muller-Fourier form gives a compact representation for adders, while our expansion seems to be suitable for multipliers.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115402545","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":"Gigantic pairs of minimal clones","authors":"I. Rosenberg, Hajime Machida","doi":"10.1109/ISMVL.1999.779698","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779698","url":null,"abstract":"L. Szabo (1992) asked for the minimal number n=n(|A|) such that the clone of all operations on A can be generated as the join of n minimal clones. He showed, e.g., n(p)=2 for any prime p, and later G. Czedli (1998) proved that if k has a divisor /spl ges/5 then n(k)=2. In this paper, a pair (f, g) of operations is called gigantic if each of f and g generates a minimal clone and the set {f, g} generates the clone of all operations. First, we give a general theorem to characterize a gigantic pair. Then we show that n(k)=2 for every k which is not a power of 2.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125985892","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":"Bi-decompositions of multi-valued functions for circuit design and data mining applications","authors":"B. Steinbach, M. Perkowski, C. Lang","doi":"10.1109/ISMVL.1999.779695","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779695","url":null,"abstract":"We present efficient algorithms for the bi-decomposition of arbitrary incompletely specified functions in variable-valued logic. Several special cases are discussed. The algorithms are especially applicable for Data Mining applications, because, in contrast to the general multi-valued approaches to function decomposition that decompose to arbitrary tables, we create a network from multi-valued two-input operators that are selected by the user. Such decompositions lead to decision rules that are easier to understand by humans.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124738994","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":"Self-checking multiple-valued circuit based on dual-rail current-mode differential logic","authors":"T. Hanyu, T. Ike, M. Kameyama","doi":"10.1109/ISMVL.1999.779728","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779728","url":null,"abstract":"A multiple-valued current-mode (MVCM) circuit based on dual-rail differential logic has been proposed for high-speed arithmetic systems at a low supply voltage. This paper presents a new totally self-checking circuit based on dual-rail MVCM logic, where almost all the basic components except a differential-pair circuit have been already duplicated which results in small hardware overhead compared with a non-self-checking circuit based on dual-rail MVCM logic. Moreover the performance of the proposed self-checking circuit is superior to that of full duplication of the non-self-checking circuit based on dual-rail MVCM logic in terms of transistor counts, switching delay and dynamic power dissipation under a 0.5-/spl mu/m standard CMOS technology.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131662969","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":"Maximal chains of partial clones containing all idempotent partial functions","authors":"L. Haddad, J. Fugère","doi":"10.1109/ISMVL.1999.779699","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779699","url":null,"abstract":"Let k/spl ges/2 and k be a k-element set. We show that every partial clone containing all idempotent partial functions on k is finitely generated. Moreover we construct maximal chains of length 2/sup k/ of such partial clones.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123170097","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":"The number of cascade functions","authors":"Grant R. Pogosyan","doi":"10.1109/ISMVL.1999.779707","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779707","url":null,"abstract":"Cascade function is a Boolean function which can be implemented by a so-called cascade network. An n input cascade network is a circuit built with n-1 two-input-one-output gates (i.e., dyadic operations) such that at least one input of each gate is a network input. By arranging the inputs in a proper order these networks can be presented in a \"cascade\" shape, which is the origin of the name. Cascade networks, and thus cascade functions have many interesting properties. Although the portion of cascades among all logic functions is small (the ratio approaches zero with growth of the number of variables), their remarkable properties and the practical significance of such networks has attracted many researchers in the fields of switching functions and logic design. There are several papers published that focus on the enumeration problem of cascade functions and networks. Asymptotic expression and a recurrence relation have been found for the number of all cascades, as well as for some subclasses. However, to the author's knowledge, until now no closed formula has been discovered which explicitly counts such functions. This paper presents an explicit formula for the number of all n-variable cascade functions.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123280639","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":"Semirigidity problems in k-valued logic","authors":"M. Miyakawa","doi":"10.1109/ISMVL.1999.779725","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779725","url":null,"abstract":"The study of semirigid sets arose from the classification of bases. In this complex problem-fully solved only for |A|=2, 3-one of the task is to find all minimal nontrivial intersections of systems of maximal clones. Most of the clones are determined by reflexive relations (binary or of higher arities) and so we need to determine subsets R of these relations such that every function preserving all relations in R is either constant or is a projection. In this paper we give a short overview of this problem for 1) isotone relations, 2) central relations and 3) quasi-linear relations. Finally we add some new results for 4) autodual clones.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833541","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":"Structural and behavioral modeling with monadic logics","authors":"A. Ayari, D. Basin, Stefan Friedrich","doi":"10.1109/ISMVL.1999.779709","DOIUrl":"https://doi.org/10.1109/ISMVL.1999.779709","url":null,"abstract":"Logic offers the possibility of modeling and reasoning about hardware and software. But which logic? We propose monadic logics of strings and trees as good candidates for many kinds of discrete systems. These logics are natural, decidable, yet substantially more expressive, extensions of Boolean logic. We motivate their applicability through examples.","PeriodicalId":356740,"journal":{"name":"Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641090","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}