2.4GHz动态CMOS分频器的设计

对现阶段的主流高速CMOS分频器进行分析和比较,在此基础上设计一种采用TSPC(truesingle phase clock)和E-TSPC(extended TSPC)技术的前置双模分频器电路.该分频器大大提高了工作频率,采用0.6μm CMOS工艺参数进行仿真的结果表明,在5V电源电压下,最高频率达到3GHz,功耗仅为8mW.     

理想九点五态控制器原理的叙述

用计算的方式叙述理想九点五态控制器的控制原理。为便于人们理解二阶对象的运动中控制的变化过程,将抽象的对象转换为人们熟知的L-R-C电路,通过调节输入电压(即控制作用)的大小和方向来实现对对象性能的调节,并使系统达到理想的性能指标。最后用仿真来验证计算结果的正确性。     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

双波长稳频CO_2激光模糊控制系统的建模与优化

报导一种模糊逻辑控制系统的建模与优化方法。以此方法设计的模糊逻辑控制器，用于双波长稳频ＣＯ２激光器的控制得到令人满意的结果。     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A novel compact circuit for 4-PAM energy-efficient high speed interconnect data transmission and reception

Transmission of signals, whether on-chip or off-chip, places severe constraints on timing and extracts a large price in energy. New silicon device technologies, such as back-plane CMOS, provide a programmable and adaptable threshold voltage as an additional tool that can be used for low power design. We show that one particularly desirable use of this freedom is energy-efficient high-speed transmission across long interconnects using multi-valued encoding. Our multi-valued CMOS circuits take advantage of the threshold voltage control of the transistors, by using the signal-voltage-to-threshold-voltage span, in order to make area-efficient implementations of 4-PAM (pulse amplitude modulation) transceivers operating at high speed. In a comparison of a variety of published technologies, for signal transmission with interconnects of 10-15 mm length, we show up to 50% improvement in energy for on-chip signal transmission over binary encoding together with higher limits for operating speeds without a penalty in circuit noise margin.     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

A parametric representation of linguistic hedges in Zadeh’s fuzzy logic

This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

Group-valued measures on coarse-grained quantum logics

In [3] it was shown that a (real) signed measure on a cyclic coarse-grained quantum logic can be extended, as a signed measure, over the entire power algebra. Later ([9]) this result was re-proved (and further improved on) and, moreover, the non-negative measures were shown to allow for extensions as non-negative measures. In both cases the proof technique used was the technique of linear algebra. In this paper we further generalize the results cited by extending group-valued measures on cyclic coarse-grained quantum logics (or non-negative group-valued measures for lattice-ordered groups). Obviously, the proof technique is entirely different from that of the preceding papers. In addition, we provide a new combinatorial argument for describing all atoms of cyclic coarse-grained quantum logics.