发布求助
文献互助 智能选刊 最新文献

33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.最新文献

筛选
英文 中文
A field-programmable digital filter chip using multiple-valued current-mode logic 采用多值电流模式逻辑的现场可编程数字滤波芯片
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201408
K. Degawa, T. Aoki, T. Higuchi
{"title":"A field-programmable digital filter chip using multiple-valued current-mode logic","authors":"K. Degawa, T. Aoki, T. Higuchi","doi":"10.1109/ISMVL.2003.1201408","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201408","url":null,"abstract":"This paper presents a Field-Programmable Digital Filter (FPDF) IC that employs carry-propagation-free redundant arithmetic algorithms for faster computation and multiple-valued current-mode circuit technology for high-density low-power implementation. The prototype FPDF fabrication with 0.6 /spl mu/m CMOS technology demonstrates that the chip area and power consumption can be reduced to 41% and 74%, respectively, compared with the standard binary logic implementation.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127293203","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
Multiple-valued dynamic source-coupled logic 多值动态源耦合逻辑
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201407
T. Hanyu, A. Mochizuki, M. Kameyama
{"title":"Multiple-valued dynamic source-coupled logic","authors":"T. Hanyu, A. Mochizuki, M. Kameyama","doi":"10.1109/ISMVL.2003.1201407","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201407","url":null,"abstract":"A new multiple-valued current-mode (MVCM) integrated circuit based on dynamic source-coupled logic (SCL) is proposed for low-power VLSI applications. The use of a precharge-evaluate logic style makes steady current flow cut off, thereby greatly saving the power dissipation. A combination of SCL and dynamic logic styles makes it possible to reduce the power dissipation while maintaining a highspeed switching capability due to small input-voltage swing with SCL. As a typical example of a high-performance arithmetic circuit, a radix-2 signed-digit adder based on the proposed dynamic SCL is implemented in a 0.18-/spl mu/m CMOS technology. Its power dissipation is reduced to about 33 percent in comparison with that of the corresponding binary CMOS implementation under the normalized switching delay.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124929475","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}
引用次数: 6
Polynomial expansions over GF(3) based on fastest transformation 基于最快变换的GF(3)上的多项式展开式
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201382
B. Falkowski, Cheng Fu
{"title":"Polynomial expansions over GF(3) based on fastest transformation","authors":"B. Falkowski, Cheng Fu","doi":"10.1109/ISMVL.2003.1201382","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201382","url":null,"abstract":"A new fastest Linearly Independent (LI) transforms over GF(3) and its corresponding polynomial expansions have been introduced. The number of required additions and multiplications in new LI transform is advantageous when compared with ternary Reed-Muller transform, which was previously known as the most efficient transform over GF(3). This paper discusses various properties of these fastest LI transforms and their corresponding polynomial expansions over GF(3) as well as their comparison with ternary Reed-Muller transform and its implementation in hardware.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130657808","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}
引用次数: 8
Normal forms for fuzzy logic functions 模糊逻辑函数的范式
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201385
I. Perfilieva
{"title":"Normal forms for fuzzy logic functions","authors":"I. Perfilieva","doi":"10.1109/ISMVL.2003.1201385","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201385","url":null,"abstract":"Three types of normal forms are introduced for fuzzy logic functions: disjunctive, conjunctive and additive. Disjunctive and conjunctive normal forms are considered in two variants: infinite and finite. It is shown that infinite normal forms are universal representation formulas whereas finite normal forms are universal approximation formulas for any L-valued function where L is a support set of any complete BL-algebra. The additive normal form \"lies\" in the middle of the two others. For all of them the estimation of the quality of approximation is suggested.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127965312","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}
引用次数: 6
Recursive evaluation of the generalized Reed-Muller coefficients 广义Reed-Muller系数的递推求值
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201394
Gi-Soo Na, Sang Wan Kim, J. Choi, Heung-Soo Kim
{"title":"Recursive evaluation of the generalized Reed-Muller coefficients","authors":"Gi-Soo Na, Sang Wan Kim, J. Choi, Heung-Soo Kim","doi":"10.1109/ISMVL.2003.1201394","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201394","url":null,"abstract":":In this paper, we propose the computation method of GRM (Generalized Reed-Muller) coefficients over GF(2) using triangle cell recursively. GRM expansions of each polarity contain different numbers of product terms. Hence, the minimum form may be selected from them. Many authors have presented various algorithms of calculating the coefficients of GRM expansions under mixed polarities. The method proposed by W. Besslich requires 2/sup n-1//spl times/(2/sup n/-1) modulo - sums (i.e. Ex-OR)[1], but the method proposed in this paper requires only 2/spl times/(the number of modulo-sums for n-1 variable)+3/sup n-1/ ones. From this proposed method we can get easily GRM coefficients.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122032061","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
Relationship between UCHT and FFT UCHT与FFT的关系
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201400
S. Xie, S. Rahardja, Z. Gu
{"title":"Relationship between UCHT and FFT","authors":"S. Xie, S. Rahardja, Z. Gu","doi":"10.1109/ISMVL.2003.1201400","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201400","url":null,"abstract":"This paper presents relationships among unified complex Hadamard transform (UCHT) whose transformation matrix contains elements /spl plusmn/1 and /spl plusmn/i, Walsh-Hadamard transform (WHT) whose transformation matrix contains elements /spl plusmn/1, and Fast Fourier Transform (FFT). They are all related to each other by a key matrix, and FFT can be computed by using UCHT WHT and some twiddle factor matrices.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"2 20","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120817681","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
A new construction of the irreducible polynomial for parallel multiplier over GF(2/sup m/) GF(2/sup m/)上平行乘法器不可约多项式的新构造
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201380
Jong-Hak Hwang, K. Moon, Seung-Yong Park, Heung-Soo Kim
{"title":"A new construction of the irreducible polynomial for parallel multiplier over GF(2/sup m/)","authors":"Jong-Hak Hwang, K. Moon, Seung-Yong Park, Heung-Soo Kim","doi":"10.1109/ISMVL.2003.1201380","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201380","url":null,"abstract":"This paper presents the construction algorithm of the irreducible polynomial which needs to multiply over GF(2/sup m/) and the flow chart representing the proposed algorithm has been proposed And also, we get the degree from the value of x/sup m.k/ formation to the value of k=7 using the proposed flow chart. The multiplier circuit has been implemented by using the proposed irreducible polynomial generation(IPG) algorithm in this paper, and we compared the proposed circuit with the conventional one. In the case of k=7, one AND gale and five Ex-or gates are needed as the delay time for the irreducible polynomial in the proposed algorithm, but seven AND gales and seven Ex-or gates in the conventional one. As a result, the proposed algorithm shows the improved performance on the delay time.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126392313","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
Automated finding of the Willis ring in MR angiography images using fuzzy knowledge base 利用模糊知识库自动发现MR血管造影图像中的Willis环
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201389
Syoji Kobashi, K. Kondo, Y. Hata
{"title":"Automated finding of the Willis ring in MR angiography images using fuzzy knowledge base","authors":"Syoji Kobashi, K. Kondo, Y. Hata","doi":"10.1109/ISMVL.2003.1201389","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201389","url":null,"abstract":"This paper proposes an automated method for finding the Willis ring from the human brain MR angiography (MRA) images, which can depict cerebral arteries with high contrast. It strongly helps screening of unruptured cerebral aneurysm in MRA images. The proposed method consists of (1) segmenting cerebral arteries from MRA images, (2) skeletonization of artery trees, and detection of furcations, and (3) finding furcations in the Willis ring using genetic algorithm (GA) based on fuzzy knowledge base (fuzzy KB). Fuzzy KB gives knowledge about the Willis ring that consists of arteries and furcations. GA finds a set of furcations by optimizing an objective function. The objective function used by GA estimates fitness of a set of furcations using fuzzy KB. Our method was first applied to a 3-D phantom data generated by computer simulation. The result demonstrated that our method detected all suitable furcations correctly. Next, it was applied to MRA volume data of two normal healthy volunteers. In any cases, the proposed method detected desired all furcations in the Willis ring.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131554188","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
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey 多值逻辑的功能与约束满足的复杂性:综述
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201427
A. Krokhin, A. Bulatov, P. Jeavons
{"title":"Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey","authors":"A. Krokhin, A. Bulatov, P. Jeavons","doi":"10.1109/ISMVL.2003.1201427","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201427","url":null,"abstract":"Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this short survey we discuss an approach that is related to the algebraic component of multiple-valued logic and that has proved to be very successful in studying the complexity of constraint satisfaction.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763363","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
Complete and independent sets of axioms of boolean algebra 布尔代数公理的完全独立集
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201402
T. Ninomiya, M. Mukaidono
{"title":"Complete and independent sets of axioms of boolean algebra","authors":"T. Ninomiya, M. Mukaidono","doi":"10.1109/ISMVL.2003.1201402","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201402","url":null,"abstract":"We investigate fundamental properties of axioms of Boolean algebra in detail by using the method of indeterminate coefficients, which uses multiple-valued logic. We can prove that four axioms, one of the commutative laws, one of the complementary laws, one of the distributive laws and one of the least element(a), greatest element (b) and the absorption laws are independent from others in the set of fundamental axioms of Boolean algebra. Then we research candidates, including those four axioms and other smaller number of axioms and prove all of those candidates are indeed complete and independent sets of axioms of the algebra.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115301065","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学术文献互助群
群 号：481959085
Book学术官方微信