{"title":"Conversion Method of Netlists Consisting of Conventional Logic Gates to RSFQ Logic Circuits Using the Characteristics of Pulse Logic","authors":"Nobutaka Kito, K. Takagi, N. Takagi","doi":"10.1109/ISEC46533.2019.8990930","DOIUrl":null,"url":null,"abstract":"Conversion method of netlists consisting of conventional logic gates to RSFQ circuits is proposed. It treats netlists for CMOS circuits as the design entry, and converts them considering reduction of the number of clocked gates. It utilizes two characteristics of pulse logic for the reduction. One is utilizing confluence of pulses to realize logic-OR. The other is utilizing a small resettable DFF as an NIMPLY gate by tuning the order of pulse arrival. To minimize the number of clocked gates with minimum replacements of gates, the selection problem of gates for replacements utilizing those characteristics and assignment of logic level to each gate are formulated as an instance of integer linear programming.","PeriodicalId":250606,"journal":{"name":"2019 IEEE International Superconductive Electronics Conference (ISEC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Superconductive Electronics Conference (ISEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISEC46533.2019.8990930","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Conversion method of netlists consisting of conventional logic gates to RSFQ circuits is proposed. It treats netlists for CMOS circuits as the design entry, and converts them considering reduction of the number of clocked gates. It utilizes two characteristics of pulse logic for the reduction. One is utilizing confluence of pulses to realize logic-OR. The other is utilizing a small resettable DFF as an NIMPLY gate by tuning the order of pulse arrival. To minimize the number of clocked gates with minimum replacements of gates, the selection problem of gates for replacements utilizing those characteristics and assignment of logic level to each gate are formulated as an instance of integer linear programming.