K. Datta, Bhadreswar Ghuku, Devi Sandeep, I. Sengupta, H. Rahaman
{"title":"A Cycle Based Reversible Logic Synthesis Approach","authors":"K. Datta, Bhadreswar Ghuku, Devi Sandeep, I. Sengupta, H. Rahaman","doi":"10.1109/ICACC.2013.67","DOIUrl":null,"url":null,"abstract":"Research in the field of reversible computing has gained vivid attention during the last decade because of its importance in various applications like low power design and quantum computing. With such motivations researchers have worked on developing several reversible synthesis approaches over the years. Some methods are exact, some are based on heuristics, some rely on function representations like Binary Decision Diagram (BDD) or Exclusive-OR Sum of Products (ESOP), and some are based on group theoretic methods. In this paper a synthesis approach for reversible logic circuit based on the theory of permutation cycles is presented, using multiple-control Toffoli gates. The method uses cycle decomposition rules to divide larger cycles into smaller ones and then smaller cycles with bit difference less than three are directly synthesized using an existing synthesis algorithm in the backend. After generating the net list, further optimizations are performed using an window optimization method present in Revkit.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Third International Conference on Advances in Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACC.2013.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Research in the field of reversible computing has gained vivid attention during the last decade because of its importance in various applications like low power design and quantum computing. With such motivations researchers have worked on developing several reversible synthesis approaches over the years. Some methods are exact, some are based on heuristics, some rely on function representations like Binary Decision Diagram (BDD) or Exclusive-OR Sum of Products (ESOP), and some are based on group theoretic methods. In this paper a synthesis approach for reversible logic circuit based on the theory of permutation cycles is presented, using multiple-control Toffoli gates. The method uses cycle decomposition rules to divide larger cycles into smaller ones and then smaller cycles with bit difference less than three are directly synthesized using an existing synthesis algorithm in the backend. After generating the net list, further optimizations are performed using an window optimization method present in Revkit.