首页> 外文会议>IEEE International Solid- State Circuits Conference >24.3 20k-spin Ising chip for combinational optimization problem with CMOS annealing
【24h】

24.3 20k-spin Ising chip for combinational optimization problem with CMOS annealing

机译:24.3 20K-旋转芯片用于CMOS退火的组合优化问题

获取原文

摘要

In the near future, the performance growth of Neumann-architecture computers will slow down due to the end of semiconductor scaling. Presently a new computing paradigm, so-called natural computing, which maps problems to physical models and solves the problem by its own convergence property, is expected. The analog computer using superconductivity from D-Wave [1] is one of those computers. A neuron chip [2] is also one of them. We proposed a CMOS-type Ising computer [3]. The Ising computer maps problems to an Ising model, a model to express the behavior of magnetic spins (the upper left diagram in Fig. 24.3.1), and solves the problems by ground-state search operations. The energy of the system is expressed by the formula in the diagram. Computing flows are expressed in the lower flow chart in Fig. 24.3.1. In the conventional Neumann architecture, the problem is sequentially and repeatedly calculated, and therefore, the number of computing steps drastically increases as the problem size grows. In the Ising computer, in the first step, the problem is mapped to the Ising model. In the next steps, an annealing operation, the ground-state search by interactions between spins, are activated and the state transitions to the ground state where the energy of the system is minimized. The interacting operation between spins is decided by the interaction coefficients, which are set to each connection. Here, the configuration of the interaction coefficients is decided by the problem, and therefore, the interaction coefficients are equivalent to the programming in the conventional computing paradigm. The ground state corresponds to the solution of the original problem, and the solution is acquired by observing the ground state. The interactions for the annealing are performed in parallel, and the necessary steps for the annealing are smaller than that used by a sequential computing, Neumann architecture. As the table in Fig. 24.3.1, our Ising computer uses CMOS circuits to expre- s the Ising model, and acquires the scalability and operation at room temperature.
机译:在不久的将来,由于半导体缩放结束,Neumann-Charchitect计算机的性能增长将减速。目前,新的计算范例,所谓的自然计算,预计将通过自己的收敛属性解决问题并解决问题。使用来自D-Wave的超导性的模拟计算机[1]是这些计算机之一。神经元芯片[2]也是其中之一。我们提出了一个CMOS型的计算机[3]。 ising计算机将问题映射到insing模型,一种表达磁旋转行为的模型(图24.3.1中的左上图),并通过地面搜索操作解决问题。系统的能量由图中的公式表示。计算流量在图24.3.1中的下流程图中表示。在传统的Neumann架构中,顺序且重复地计算问题,因此,随着问题大小的增长,计算步骤的数量大幅增加。在ISING计算机中,在第一步中,问题映射到ISING模型。在接下来的步骤中,激活退火操作,通过旋转之间的相互作用的地面搜索,并且状态转换到系统的能量最小化的地面状态。 Spins之间的相互作用操作由交互系数决定,该交互系数被设置为每个连接。这里,相互作用系数的配置由问题决定,因此,交互系数等同于传统计算范例中的编程。地状态对应于原始问题的解决方案,通过观察地面状态来获取解决方案。退火的相互作用并行地进行,并且退火的必要步骤小于顺序计算Neumann架构使用的步骤。作为图24.3.1中的表,我们的ISIP计算机使用CMOS电路来表达ISING模型,并在室温下获取可扩展性和操作。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号