Proceedings 1997 27th International Symposium on Multiple- Valued Logic最新文献

筛选
英文 中文
Circuit design from Kronecker Galois field decision diagrams for multiple-valued functions 多值函数的克罗内克伽罗瓦场决策图电路设计
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601413
R. Stankovic, R. Drechsler
{"title":"Circuit design from Kronecker Galois field decision diagrams for multiple-valued functions","authors":"R. Stankovic, R. Drechsler","doi":"10.1109/ISMVL.1997.601413","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601413","url":null,"abstract":"In this paper we define the Kronecker Galois field decision diagrams (KGFDDs), a generalization of Kronecker decision diagrams (KDDs) to the representation of multiple-valued (MV) functions. Starting from the multi-place decision diagrams (MDDs) and Galois field decision diagrams (GFDDs) we give a generalization that allows more compact representation with respect to the nodes needed. Based on KGFDDs we present a new method for circuit design for MV circuits. In contrast to previously presented approaches the resulting circuits have only logarithmic (instead of linear) depth.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128706819","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}
引用次数: 39
Multiple-valued programmable logic arrays with universal literals 具有通用文字的多值可编程逻辑阵列
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601391
T. Utsumi, N. Kamiura, Y. Hata, K. Yamato
{"title":"Multiple-valued programmable logic arrays with universal literals","authors":"T. Utsumi, N. Kamiura, Y. Hata, K. Yamato","doi":"10.1109/ISMVL.1997.601391","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601391","url":null,"abstract":"A universal literal is a single-variable function and has an ability to manipulate more information than a set literal. The array size therefore could be eliminated by using universal literal generators (ULGs for short) in programmable logic arrays (PLAs), compared to PLAs with set literals. This paper discusses what operator is the most suitable in the term of eliminating the array size. We find four solutions as the good operator structures to eliminate the array size. A speculation of the upper bound of the array sizes is shown. Experiments are also done for randomly generated functions and some arithmetic functions. The experimental results show that the MAX-of-TPRODUCT form PLAs require the smallest array size.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122701170","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
One-transistor-cell 4-valued universal-literal CAM for cellular logic image processing 用于单元逻辑图像处理的单晶体管单元4值通用文字CAM
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601393
T. Hanyu, M. Arakaki, M. Kameyama
{"title":"One-transistor-cell 4-valued universal-literal CAM for cellular logic image processing","authors":"T. Hanyu, M. Arakaki, M. Kameyama","doi":"10.1109/ISMVL.1997.601393","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601393","url":null,"abstract":"A non-volatile 4-valued content-addressable memory (CAM) is proposed for fully parallel template-matching operations in real-time cellular logic image processing with fixed templates. A universal literal in each CAM cell is used to compare a 4-valued input pixel with a 4-valued template pattern. Any CAM cell functions are performed by a pair of a simple threshold operation and a logic-value conversion which is shared by CAM cells in the same column of a CAM cellular array. Moreover, the use of a single floating-gate MOS transistor makes it possible to implement a universal-literal circuit together with a 4-valued storage element. As a result, a high-density 4-valued universal-literal CAM, with a single transistor cell is designed by using a multi-layer interconnection technology. Its performance is much superior to that of conventional CAM-based implementations under the same dynamic power dissipation.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114767936","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}
引用次数: 3
Finding composition trees for multiple-valued functions 寻找多值函数的组合树
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601368
E. Dubrova, J. Muzio, B. Stengel
{"title":"Finding composition trees for multiple-valued functions","authors":"E. Dubrova, J. Muzio, B. Stengel","doi":"10.1109/ISMVL.1997.601368","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601368","url":null,"abstract":"The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realization of the function at a minimal cost. Previously and independently, the authors had studied the class of multiple-valued functions that are fully sensitive to their variables. These functions are useful for test generation purposes, and almost all m-valued n-variable functions belong to this class as n increases. All functions in this class have composition trees. This paper presents a recursive algorithm for generating the composition tree for any function in this class. The construction proceeds top-down and makes immediate use of any encountered decomposition, which reduces the (in general exponential) computation time.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132819353","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}
引用次数: 13
Fourier decision diagrams on finite non-Abelian groups with preprocessing 有限非阿贝尔群的傅里叶决策图及其预处理
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601415
R. Stankovic
{"title":"Fourier decision diagrams on finite non-Abelian groups with preprocessing","authors":"R. Stankovic","doi":"10.1109/ISMVL.1997.601415","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601415","url":null,"abstract":"This paper introduces a method for optimization of Fourier decision diagrams representations of discrete functions based on the preprocessing of the represented functions. Fourier decision diagrams are defined for matrix-valued-function on non-Abelian groups. Their application to number-valued functions is provided through a simple preprocessing of the represented functions.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132939847","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}
引用次数: 13
Set-valued functions and regularity 集值函数与正则性
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601379
N. Takagi, Y. Nakamura, K. Nakashima
{"title":"Set-valued functions and regularity","authors":"N. Takagi, Y. Nakamura, K. Nakashima","doi":"10.1109/ISMVL.1997.601379","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601379","url":null,"abstract":"In this paper, we focus on regularity and set-valued functions. The regularity was first introduced by S.C. Kleene (1952) into the propositional connectives of a ternary logic. Then, M. Mukaidono (1986) expanded the regularity of Kleene into n-variable ternary functions, and a ternary function which is regular is called a regular ternary logic function. Some studies expanded regular ternary logic functions into /spl tau/-valued functions, and studied properties of them. In this paper, we propose another extension of the concepts of the regularity in the sense of Kleene and Mukaidono. That is, we introduce regularity into r-valued set-valued functions. Further, we give properties of the set-valued functions with the regularity.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115578569","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
Family of complex Hadamard transforms: relationship with other transforms and complex composite spectra 复哈达玛变换族:与其它变换和复复合谱的关系
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601386
S. Rahardja, B. Falkowski
{"title":"Family of complex Hadamard transforms: relationship with other transforms and complex composite spectra","authors":"S. Rahardja, B. Falkowski","doi":"10.1109/ISMVL.1997.601386","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601386","url":null,"abstract":"Relationship of the recently introduced family of unified complex Hadamard transforms with other transforms used in binary and multiple-valued logic design are investigated in this paper. All the complex Hadamard matrices can be generated by a common unifying formula presented here. Only half of all possible 64 unified complex Hadamard transforms have half-spectrum property. The existence of such a property for 32 transformation matrices is proven for the first time in this paper. Half-spectrum property is important as h reduces the required computer storage by half when compared to other transforms operating on complex numbers. The method is also presented to evaluate complex Hadamard spectra of AND, OR, and XOR of Boolean functions directly from the spectra of the separate Boolean functions. The results are given using a general coding scheme, and different possible codings of Boolean functions are discussed. Moreover, new definition of the convolution operation called complex convolution is derived. Different properties of such a convolution are presented. Theorem giving final formulae for composite complex Hadamard spectra of Boolean functions is stated in terms of complex convolution. By using presented methods, many of the Boolean operations in original domain can be represented much simpler in terms of their composite complex spectra.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114727817","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
VLSI design of a quaternary multiplier with direct generation of partial products 一种直接生成部分产品的四元乘法器的VLSI设计
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601392
O. Ishizuka, Akihiro Ohta, K. Tanno, Zheng Tang, D. Handoko
{"title":"VLSI design of a quaternary multiplier with direct generation of partial products","authors":"O. Ishizuka, Akihiro Ohta, K. Tanno, Zheng Tang, D. Handoko","doi":"10.1109/ISMVL.1997.601392","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601392","url":null,"abstract":"This paper presents the VLSI design of a novel quaternary multiplier with direct generation of partial products using a radix-4 redundant number system. The structure of the multiplier is so simple and regular that it is suitable for VLSI implementation. Partial products in the multiplier are generated as the corresponding value 0 to 9 and are implemented by simple CMOS current-mode circuits. To add partial products in the multiplier, we introduce a redundant multi-valued adder (RMA). The RMA can add two redundant numbers without carry propagation. The resulting numbers in the final level of additions are also redundant. We use a high speed quaternary carry-lookahead adder (QCLA) to convert a redundant number into a non-redundant number. The chip of a CMOS 4/spl times/4-digit quaternary multiplier is fabricated in cooperation with the VLSI Design and Education Center of Tokyo University, Japan. The chip and core sizes of the multiplier are 2.3/spl times/2.3 mm/sup 2/ and 1.5/spl times/1.6 mm/sup 2/, respectively with 1.5 /spl mu/m technology. The layout design of a 16/spl times/16-digit quaternary multiplier with 0.8 /spl mu/m technology is also discussed for the practical use.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132319748","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}
引用次数: 25
Design of ternary CCD circuits referencing to current-mode CMOS circuits 参考电流型CMOS电路设计三元CCD电路
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601399
Xunwei Wu, Massoud Pedram
{"title":"Design of ternary CCD circuits referencing to current-mode CMOS circuits","authors":"Xunwei Wu, Massoud Pedram","doi":"10.1109/ISMVL.1997.601399","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601399","url":null,"abstract":"This paper investigates the relationship between current-mode and charge-mode circuits. In particular, it shows that four basic CCD logic elements have their counterparts in the current-mode circuits. This is in turn used to show how to apply design principles used for current-mode CMOS circuits to the design of charge-mode CCD circuits.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"756 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132814556","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
Fast algorithm for minimizing Reed-Muller expansions of systems of incompletely specified MVL functions 不完全指定MVL函数系统的Reed-Muller展开式的快速最小化算法
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601375
A. Zakrevskij, L. Zakrevski
{"title":"Fast algorithm for minimizing Reed-Muller expansions of systems of incompletely specified MVL functions","authors":"A. Zakrevskij, L. Zakrevski","doi":"10.1109/ISMVL.1997.601375","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601375","url":null,"abstract":"A problem of the optimal implementation of multi-valued logic (MVL) functions on the basis of multivalued EXOR gates is considered. In this paper, we are concerned with the question of representing systems of MVL functions by minimum Reed-Muller expansions. A specific class of such representations, called superoptimal, is regarded. For the superoptimal solutions the number of different conjunctions in the sought-for system of polynomials equals to the number of linear independent output variables (on the area of definition). The proposed method enables to find a superoptimal solution for a given system of weakly specified MVL functions, if such a solution exists. It is based on the theory of linear vector spaces.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129584651","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}
引用次数: 3
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学术官方微信