基于模拟退火遗传算法的三值FPRM电路功耗优化

在三值FPRM(Fixed-Polarity Reed-Muller)逻辑函数中,n变量函数有3ⁿ个固定极性.针对不同极性下FPRM电路功耗不同的特点,研究了三值FPRM逻辑表达式,提出一种基于模拟退火遗传算法的三值FPRM电路功耗优化方法.首先,根据三值逻辑函数表达式和开关信号传递理论,建立三值FPRM电路功耗估计模型;再利用模拟退火遗传算法对三值FPRM电路进行功耗最佳极性搜索,得到了功耗最低的FPRM电路;最后对13个MCNC Benchmark电路进行仿真.结果表明:与0极性相比,搜索到的最佳极性功耗平均节省了73.98%.     

基于RTD可编程逻辑门的数字电路3层网络综合算法

随着集成电路的不断发展,CMOS器件的工艺逐渐达到其物理设计极限,研究新器件和新设计方法成为集成电路继续发展的必经之路. 阈值逻辑门因具有强大的逻辑功能而备受关注,共振隧穿二极管（RTD）因其负阻特性在设计阈值逻辑门时更具优势. 由于阈值逻辑门与二进制神经元模型有相似之处,因此可用神经网络模型实现逻辑函数,从而为电路设计提供新的思路. 对基于RTD可编程逻辑门的3层网络算法中的隐层综合算法进行了改进,提出采用汉明距离最大优先覆盖的方法对真向量进行覆盖,从而提高了真向量的覆盖效率,减少了隐层函数个数,并采用真假向量标记的方法简化了隐层综合算法.提出的算法比原隐层综合算法简单,进一步简化了基于RTD可编程逻辑门实现n变量函数的电路.     

计算含无关项布尔c-导数的K图方法

为简化与-或-非代数系统中含无关项逻辑函数布尔c-导数的计算过程,从逻辑函数布尔c-导数的定义出发,提出了计算含无关项一阶布尔c-导数和二阶布尔c-导数的K图方法.该方法通过折叠映射K图中的填入格值,并对相应格值进行"或"运算以计算含无关项布尔c-导数.应用实例表明,该方法直观有效,且能直接得到布尔c-导数的最简与/或式.     

硫杂杯[4]荧光探针的离子识别及分子逻辑门研究

以硫杂杯[4]芳烃为母体,在其1,3-位连接羟乙基邻苯二甲酰亚胺,2,4-位以三氮唑为连接基,将苄基引入硫杂杯[4]芳烃的下沿,得到硫杂杯[4]-邻苯二甲酰亚胺衍生物荧光探针(s1)。探针s1发射强烈荧光,在CH₃CN介质中的相对荧光量子产率为0.43。在DMF/H₂O介质中,以310 nm为激发波长,Fe3+能选择性猝灭探针s1在390 nm处的荧光;在CH₃CN介质中,以245 nm为激发波长,I-能选择性猝灭探针s1在310 nm处的荧光,光谱滴定和等温滴定量热均测出探针s1与Fe3+或与I-形成1∶1配合物,结合常数均达105。结合自由能表明配合为自发过程。荧光猝灭检测Fe3+和 I-的浓度线性范围分别为1.0×10-7～1.6×10-4 mol·L-1和1.0×10-7～8.5×10-5 mol·L-1,检测限分别为2.30×10-8 mol·L-1和1.17×10-8 mol·L-1。同时,利用识别和竞争配合作用,控制Fe3+和F-的输入使探针s1发射荧光或荧光猝灭,构建了分子水平上的逻辑电路。红外光谱推测探针s1分子中三氮唑基的氮原子参与了识别Fe3+的配位,而探针s1分子中三氮唑环上的芳氢与I-形成氢键而实现识别。     

部分多值逻辑中保正规关系的准完备集的性质

在多值逻辑完备性理论中,Sheffer函数的刻划是一个重要的问题,此问题的解决可归结为定出其准完备集的最小覆盖.本文对部分多值逻辑函数集中保正规关系的准完备集的性质进行了研究,为确定部分多值逻辑函数集中准完备集的最小覆盖奠定了一定的基础.     

MCML/TG混合结构与三值T门和三值Dlatch电路设计

在深入分析MCML和TG的电路特点后,提出将2种结构结合起来进行数字电路设计的思路.该混合结构主要由MCML和TG共同构成,MCML结构产生控制信号,TG进行信号的传输.并以三值T门和三值D锁存器电路为例,验证了这种设计思路的可行性.通过Hspice软件,采用TSMC 0.18 μm CMOS工艺,供电电压1.8 V,对所设计的电路进行仿真,分析结果表明：电路逻辑功能正确;输入输出高低电平一致,具有较好的电压兼容性;功耗保持MCML结构的优势,基本与频率无关;与传统的CMOS电路相比,取得了较大的延迟优化.     

基于MCML的高性能三值D型触发器的设计

MCML电路由于具有高速低摆幅、抗干扰能力强、在高频下比传统CMOS电路功耗更低等优点,越来越受到广泛关注.通过分析二值MCML电路的设计方法,引入与参考电压进行比较的思路,设计了一种结构简单的新型高性能三值D型触发器.采用TSMC 180 nm工艺,使用HSPICE进行模拟.结果表明,所设计的触发器不仅具有正确的逻辑功能,工作频率达到10 GHz,平均D-Q延时和PDP也比传统CMOS三值触发器有明显降低,且随着工作频率的上升,PDP不断下降,适合于高速和高工作频率的应用.     

Concepts and fuzzy sets: Misunderstandings, misconceptions, and oversights

The psychology of concepts has been undergoing significant changes since the early 1970s, when the classical view of concepts was seriously challenged by convincing experimental evidence that conceptual categories never have sharp boundaries. Some researchers recognized already in the early 1970s that fuzzy set theory and fuzzy logic were potentially suitable for modeling of concepts and obtained encouraging results. This positive attitude abruptly changed in the early 1980s, and since that time fuzzy set theory and fuzzy logic have been portrayed as problematic and unsuitable for representing and dealing with concepts. Our aim in this paper is to identify some of the most notorious claims regarding fuzzy set theory and fuzzy logic that have propagated through the literature on psychology of concepts and to show that they are, by and large, false. We trace the origin and propagation of these claims within the literature in this area. It is shown in detail that these claims are consistently erroneous and that they are based on various misunderstandings, misconceptions, and oversights. The ultimate purpose of this paper is to document these various erroneous claims.     

A solution to Curry and Hindley’s problem on combinatory strong reduction

It has often been remarked that the metatheory of strong reduction , the combinatory analogue of βη-reduction in λ-calculus, is rather complicated. In particular, although the confluence of is an easy consequence of being confluent, no direct proof of this fact is known. Curry and Hindley’s problem, dating back to 1958, asks for a self-contained proof of the confluence of , one which makes no detour through λ-calculus. We answer positively to this question, by extending and exploiting the technique of transitivity elimination for ‘analytic’ combinatory proof systems, which has been introduced in previous papers of ours. Indeed, a very short proof of the confluence of immediately follows from the main result of the present paper, namely that a certain analytic proof system G _e [] , which is equivalent to the standard proof system CL _ext of Combinatory Logic with extensionality, admits effective transitivity elimination. In turn, the proof of transitivity elimination—which, by the way, we are able to provide not only for G _e [] but also, in full generality, for arbitrary analytic combinatory systems with extensionality—employs purely proof-theoretical techniques, and is entirely contained within the theory of combinators.