{"title":"Dynamic current-mode multi-valued MOS memory with error correction","authors":"Edward K. F. Lee, P. Gulak","doi":"10.1109/ISMVL.1992.186797","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186797","url":null,"abstract":"The design of a dynamic current-mode multivalued MOS memory, with error correction used to increase the noise margins, is presented. It is based on the current-copier and single-slope analog-to-digital conversion techniques. The noise margin of the multivalued stored data is increased by storing and comparing the least significant bits of its binary representation during each refresh cycle. Alternatively, the number of bits of precision can be increased for a given noise margin. Furthermore, this technique provides a design trade-off between noise margin and implementation area.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130369014","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":"Fast logic synthesis based upon ternary universal logic module U/sub f/","authors":"B. Fei, N. Zhuang","doi":"10.1109/ISMVL.1992.186823","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186823","url":null,"abstract":"A fast algorithm for logic synthesis based on U/sub f/ (a ternary Reed-Muller universal logic module) is presented. Using this algorithm, the optimum or suboptimum synthesis scheme for n-variable logic functions can be located using pseudoexhaustive search of time (n+2)(n-1)/2.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129112489","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 use of multiple-valued switch-level algebra to analyze binary MOS bridge circuits and dynamic circuits","authors":"Mou Hu, Shensheng Xu, Kenneth C. Smith","doi":"10.1109/ISMVL.1992.186822","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186822","url":null,"abstract":"Two results for multivalued switch-level algebra (MSA) are presented. The first is the use of MSA to describe the bidirectional switching function of MOS transistors and, thereby, to analyze binary MOS bridge circuits. The second is the use of MSA to describe the function of capacitors and, thereby, to analyze binary MOS dynamic circuits.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127634922","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}
F. Ueno, T. Inoue, Badur-ul-Haque Baloch, Takayoshi Yamamoto
{"title":"An automatic adjustment method of backpropagation learning parameters, using fuzzy inference","authors":"F. Ueno, T. Inoue, Badur-ul-Haque Baloch, Takayoshi Yamamoto","doi":"10.1109/ISMVL.1992.186824","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186824","url":null,"abstract":"Fuzzy inference is introduced into a conventional backpropagation learning algorithm for neural networks. This procedure repeatedly adjusts the learning parameters and leads the system to convergence at the earliest possible time. The technique is appropriate in the sense that optimum learning parameters are being applied in every learning cycle automatically, whereas conventional backpropagation does not contain any well-defined rule regarding the proper selection of learning parameters.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778882","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":"Fuzzifying topological groups based on completely distributive residuated lattice-valued logic. I","authors":"Jizhong Shen","doi":"10.1109/ISMVL.1992.186796","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186796","url":null,"abstract":"The theory of fuzzifying topological groups based on completely distributive residuated lattice-valued logic is established. In particular, unit neighborhood systems, subgroups, and quotients are discussed in this framework.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127649710","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":"Concurrent checking and unidirectional errors in multiple-valued circuits","authors":"D. Wessels, J. Muzio","doi":"10.1109/ISMVL.1992.186791","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186791","url":null,"abstract":"The concept of unateness for multiple-valued logic circuits and its usefulness for concurrent checking through the use of unidirectional error-detecting codes are examined. Three such codes are adapted for multivalued logic, and the set of operators which provide an internally unate circuit is described. For each code, modifications are provided to incorporate testing for primary input faults. Some area overhead evaluations are performed using benchmarks implemented on binary and quaternary programmable logic arrays.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129981331","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":"Fuzzy logic and the calculus of fuzzy if-then rules","authors":"L. Zadeh","doi":"10.1109/ISMVL.1992.186834","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186834","url":null,"abstract":"Summary form only given. Fuzzy logic and the calculus of fuzzy if-then rules are reviewed. The agenda of the calculus of fuzzy if-then rules is set forth briefly. Their importance is discussed.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124537973","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":"Incremental gate: a method to compute minimal cost CCD realizations of MVL functions","authors":"M. Abd-El-Barr, H. Choy","doi":"10.1109/ISMVL.1992.186785","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186785","url":null,"abstract":"n-variable vector-valued functions that map a set of vectors of integers to a set of vectors of integers are realized using logic gates constructed using charge-coupled device (CCD) very-large-scale integration (VLSI) technology. Minimal-cost realizations of these functions are obtained through an exhaustive algorithm that considers all the circuits consisting of one gate, then all the circuits consisting of two gates, and so forth. At each step all the circuits that realize functions at a cost less than the cost of any other realizations of the same functions are recorded. Since the number of functions is exponential in the number of variables and the range of integers considered, the algorithm's time complexity is exponential in the number of variables and the range of integers. A number of pruning criteria that reduce the search space and speed up the algorithm are presented.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053844","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}
Z. Shen, L. Ding, H. Lui, Pei-Zhuang Wang, M. Mukaidono
{"title":"Revision principle for approximate reasoning (based on semantic revising method)","authors":"Z. Shen, L. Ding, H. Lui, Pei-Zhuang Wang, M. Mukaidono","doi":"10.1109/ISMVL.1992.186832","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186832","url":null,"abstract":"The problem of how to get the conclusion Q' approximately when a rule P to Q and a fact P' that is an approximation of P are given, is considered. The revision principle and the linear revision method have been proposed for this case. The basic idea of the revision principle is that it is believed that there are some approximate relations between P' and P as well as between Q' and Q. As a continuation of above research, a semantic revision method (SRM) is proposed. In SRM, the so-called semantics of a rule P to Q is defined by the falling shadow theory. By the semantics of a rule P to Q and an approximated fact P', an approximate conclusion Q' can be naturally deduced.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599318","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 efficient decoding of Reed-Solomon codes based on GMD criterion","authors":"K. Araki, M. Takada, M. Morii","doi":"10.1109/ISMVL.1992.186788","DOIUrl":"https://doi.org/10.1109/ISMVL.1992.186788","url":null,"abstract":"An efficient algorithm for GMD (generalized minimum distance) decoding is presented. It requires an algebraic errors-and-erasures decoding procedure to execute only one time. The Welch-Berlekamp iterative method is efficiently used to reduce the number of algebraic decoding procedures. A method for hardware implementation of this GMD decoding is shown.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125317713","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}