一种基于连续时间动力系统求解组合优化问题的模拟无时钟计算结构

2022 IEEE Custom Integrated Circuits Conference (CICC) Pub Date : 2022-04-01 DOI:10.1109/CICC53496.2022.9772850

Muya Chang, Xunzhao Yin, Z. Toroczkai, X. Hu, A. Raychowdhury

{"title":"一种基于连续时间动力系统求解组合优化问题的模拟无时钟计算结构","authors":"Muya Chang, Xunzhao Yin, Z. Toroczkai, X. Hu, A. Raychowdhury","doi":"10.1109/CICC53496.2022.9772850","DOIUrl":null,"url":null,"abstract":"NP-hard combinatorial optimization problems (COPs) are known to be very complex and expensive to solve with traditional computers. COPs can be mapped onto many different kinds of architecture, such as fully digital [1]–[3], event based [4], oscillators [5]–[6], Optical LASER [7], Qbits, or pure analog approach [8]–[9]. We propose a scalable pure analog clock-free continuous-time dynamical system to solve COPs in hardware.","PeriodicalId":415990,"journal":{"name":"2022 IEEE Custom Integrated Circuits Conference (CICC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Analog Clock-free Compute Fabric base on Continuous-Time Dynamical System for Solving Combinatorial Optimization Problems\",\"authors\":\"Muya Chang, Xunzhao Yin, Z. Toroczkai, X. Hu, A. Raychowdhury\",\"doi\":\"10.1109/CICC53496.2022.9772850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"NP-hard combinatorial optimization problems (COPs) are known to be very complex and expensive to solve with traditional computers. COPs can be mapped onto many different kinds of architecture, such as fully digital [1]–[3], event based [4], oscillators [5]–[6], Optical LASER [7], Qbits, or pure analog approach [8]–[9]. We propose a scalable pure analog clock-free continuous-time dynamical system to solve COPs in hardware.\",\"PeriodicalId\":415990,\"journal\":{\"name\":\"2022 IEEE Custom Integrated Circuits Conference (CICC)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Custom Integrated Circuits Conference (CICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICC53496.2022.9772850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Custom Integrated Circuits Conference (CICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICC53496.2022.9772850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

NP-hard组合优化问题(cop)是一个非常复杂和昂贵的问题，很难用传统的计算机来解决。cop可以映射到许多不同类型的架构上，例如全数字[1]-[3]，基于事件的[4]，振荡器[5]-[6]，光学激光[7]，量子比特或纯模拟方法[8]-[9]。我们提出了一种可扩展的纯模拟无时钟连续时间动力系统来解决硬件上的cop问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

An Analog Clock-free Compute Fabric base on Continuous-Time Dynamical System for Solving Combinatorial Optimization Problems

NP-hard combinatorial optimization problems (COPs) are known to be very complex and expensive to solve with traditional computers. COPs can be mapped onto many different kinds of architecture, such as fully digital [1]–[3], event based [4], oscillators [5]–[6], Optical LASER [7], Qbits, or pure analog approach [8]–[9]. We propose a scalable pure analog clock-free continuous-time dynamical system to solve COPs in hardware.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2022 IEEE Custom Integrated Circuits Conference (CICC)

自引率

0.00%

发文量