基于一维光子晶体的全光逻辑门研究

考虑光场分布的影响,利用传输矩阵法研究了含有非线性缺陷的非对称一维光子晶体的透射特性,得到一种新的全光逻辑门的实现方法.由于光场在缺陷层中有着很强的局域,光子晶体的非线性效应得到增强.基于此,分析了场分布和缺陷层折射率的相互作用对光子晶体透射特性的影响,结果表明：通过合理设计,透射特性完全可以达到稳定状态.在此基础上设计了基于一维光子晶体的异或、与等全光逻辑门     

基于线性光放大器的全光逻辑异或门理论分析

基于速率方程建立了线性光放大器(LOA)的数值模型,模拟了线性光放大器的增益钳制特性。与对称结构马赫曾德尔干涉仪(MZI)的传输矩阵相结合,构建了线性光放大器马赫曾德尔干涉仪全光逻辑异或门模型,实现了两路40Gbit/s信号的异或运算。与传统的半导体光放大器(SOA)构成的马赫曾德尔干涉仪型异或门进行了比较,从器件结构上对两种异或门运算结果的差异给出了解释。结果表明,线性光放大器具有平坦的增益特性,对输入信号的扰动具有不敏感性,垂直光场缩短了载流子恢复时间;线性光放大器马赫曾德尔干涉仪结构可以实现异或运算;利用差分相位法可以解决载流子恢复时间对信号处理速度的限制,合理地选择延迟时间能获得较好的运算结果;输出信号具有眼图张开度大、消光比高、峰值啁啾小、对波长变化不敏感等优点。     

基于同一结构实现全光逻辑“与门”和“或非门”的研究

提出了一种基于同一结构实现全光逻辑“与门”和“或非门”的新型方案，其理论基础是级联单端半导体光放大器(SOA)的交叉增益调制效应.利用单端SOA的动态理论模型成功地模拟了输入信号光为20Gb/s固定格式非归零信号时，该方案分别得到逻辑“与”和逻辑“或非”两种不同的输出结果.最后进行了实验验证，模拟结果和实验结果基本相符. 关键词： 半导体光放大器 交叉增益调制 全光逻辑     

基于单个半导体光放大器的高速多功能逻辑门

采用半导体光放大器(SOA)中的非线性效应可以实现多种多样的高速全光信号处理. 利用SOA的非线性效应(包括四波混频、交叉增益调制、瞬态交叉相位调制等)实现了多种功能的逻辑运算,包括“与”、“或非”、“同或”、“或”和“非”. 由于SOA用于全光信号处理的调制速率受到增益恢复时间较慢的限制而无法实现高速的信号处理,在SOA后面级联一个带宽为0.32nm的失谐滤波器可以提高SOA的工作速率,仅用一个SOA实现了40Gbit/s的多功能逻辑门. 关键词： 半导体光放大器 全光逻辑门 瞬态交叉相位调制     

Anisotropic Spin Cluster as a Qubit

We study an anisotropic spin cluster of 3 spin S=1/2 particles with antiferromagnetic exchange interaction with non-uniform coupling constants. A time-dependent magnetic field is applied to control the time evolution of the cluster. It is well known that for an odd number og sites a spin cluster qubit can be defined in terms of the ground state doublet. The universal one-qubit logic gate can be constructed from the time evolution operator of the non-autonomous many-body system, and the six basic one-qubit gates can be realized by adjusting the applied time-dependent magnetic field.     

基于XOR门的静态逻辑电路功耗优化技术

提出了一种新的基于XOR门的静态逻辑电路功耗优化技术.通过极性转换,可迅速得到基于XOR门的静态逻辑电路的最优结构,达到优化功耗的目的.实验结果表明,本文提出的算法在功耗节省方面比其他同类算法更有效.     

积分时间可调的CCD相机驱动时序设计与实现

在分析帧转移CCD的结构和驱动时序的基础之上,对时序关系和积分时间选择进行了计算,并给出积分时间可调的循环嵌套时序设计方案.以现场可编程逻辑门阵列为硬件载体,用硬件描述语言对方案进行设计.考虑到CCD驱动时序复杂、相位要求严格,提出运用锁相环技术进行高频信号的精确移相,用嵌入式逻辑分析仪对时序进行采样验证,在CCD电路板上实现了积分时间可调的CCD空间相机驱动时序.     

Complexity of syntactical tree fragments of Independence-Friendly logic

A dichotomy result of Sevenster (2014) [29] completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain “Henkin” or “signalling” patterns were shown to characterize fragments of IF logic that capture NP-complete problems; all the remaining prefixes were shown instead to be essentially first-order.In the present paper we develop the machinery which is needed in order to extend the results of Sevenster to non-prenex, regular IF sentences. This involves shifting attention from quantifier prefixes to a (rather general) class of syntactical tree prefixes.We partially classify the fragments of regular IF logic that are thus determined by syntactical trees; in particular, a) we identify four classes of tree prefixes that are neither signaling nor Henkin, and yet express NP-complete problems and other second-order concepts; and b) we give more general criteria for checking the first-orderness of an IF sentence.     

Fluorescent Molecular Logic Gates Driven by Temperature and by Protons in Solution and on Solid

Temperature-driven fluorescent NOT logic is demonstrated by exploiting predissociation in a 1,3,5-trisubstituted Δ²-pyrazoline on its own and when grafted onto silica microparticles. Related Δ²-pyrazolines become proton-driven YES and NOT logic gates on the basis of fluorescent photoinduced electron transfer (PET) switches. Additional PASS 1 and YES+PASS 1 logic gates on silica are also demonstrated within the same family. Beside these small-molecule systems, a polymeric molecular thermometer based on a benzofurazan-derivatized N-isopropylacrylamide copolymer is attached to silica to produce temperature-driven fluorescent YES logic.