期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
面向并行模拟机的path-CSA MOS开关模型及评价算法
1
作者 高德远 程贵鑫 康继昌 《航空学报》 EI CAS CSCD 北大核心 1993年第9期A483-A489,共7页
提出一种新型MOS开关模型,它基于MOS CSA模型,又具有path MOS模型特性。新模型采用了逻辑门一级的Time-mapping事件驱动算法,有利于采用并行模拟机硬件实现。新算法利用了path MOS模型路径法特性,因而克服了CSA方法中的LOOP问题。新算... 提出一种新型MOS开关模型,它基于MOS CSA模型,又具有path MOS模型特性。新模型采用了逻辑门一级的Time-mapping事件驱动算法,有利于采用并行模拟机硬件实现。新算法利用了path MOS模型路径法特性,因而克服了CSA方法中的LOOP问题。新算法中首次提出最大、最小信号强度传送及评价操作,克服了MOS电路逻辑模拟中存在的不定值X问题。 展开更多
关键词 并行模拟机 MOS逻辑电路 算法
下载PDF
Kinematics modeling of a 6-PSS parallel mechanism with wide-range flexure hinges 被引量:1
2
作者 杜志江 史若冲 董为 《Journal of Central South University》 SCIE EI CAS 2012年第9期2482-2487,共6页
A novel 6-PSS flexible parallel mechanism was presented,which employed wide-range flexure hinges as passive joints.The proposed mechanism features micron level positioning accuracy over cubic centimeter scale workspac... A novel 6-PSS flexible parallel mechanism was presented,which employed wide-range flexure hinges as passive joints.The proposed mechanism features micron level positioning accuracy over cubic centimeter scale workspace.A three-layer back-propagation(BP) neural network was utilized to the kinematics analysis,in which learning samples containing 1 280 groups of data based on stiffness-matrix method were used to train the BP model.The kinematics performance was accurately calculated by using the constructed BP model with 19 hidden nodes.Compared with the stiffness model,the simulation and numerical results validate that BP model can achieve millisecond level computation time and micron level calculation accuracy.The concept and approach outlined can be extended to a variety of applications. 展开更多
关键词 flexible parallel manipulator wide-range flexure hinge kinematics model neural network
下载PDF
64-qubit quantum circuit simulation 被引量:7
3
作者 Zhao-Yun Chen Qi Zhou +3 位作者 Cheng Xue Xia Yang Guang-Can Guo Guo-Ping Guo 《Science Bulletin》 SCIE EI CSCD 2018年第15期964-971,共8页
Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 q... Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 qubits, there are several methods of simulation proposed by teams at Google and IBM. Here,we present a scheme of simulation which can extract a large amount of measurement outcomes within a short time, achieving a 64-qubit simulation of a universal random circuit of depth 22 using a 128-node cluster, and 56-and 42-qubit circuits on a single PC. We also estimate that a 72-qubit circuit of depth 23 can be simulated in about 16 h on a supercomputer identical to that used by the IBM team. Moreover, the simulation processes are exceedingly separable, hence parallelizable, involving just a few inter-process communications. Our work enables simulating more qubits with less hardware burden and provides a new perspective for classical simulations. 展开更多
关键词 Simulation of quantum circuits Universal random circuit Quantum supremacy Partitioning Parallel computing
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部