|
|||||
|
|
Synthesis of reversible circuits with minimal costs |
|
| Authors: | Guowu Yang Xiaoyu Song William N N Hung Marek A Perkowski Chang-Jun Seo |
| Affiliation: | (1) University of Electronic Science and Technology of China, Chengdu, Sichuan, 610054, China;(2) Portland State University, Portland, USA;(3) Dept. of EIRE, Inje University, Inje, Korea |
| Abstract: | We present fast algorithms to synthesize exact minimal reversible circuits for various types of gate and cost. By reducing reversible logic synthesis problems to permutation group problems, we use the powerful algebraic software GAP to solve such problems. Our approach can minimize for arbitrary cost functions of gates. In addition, we show that Peres gates are a better choice than the standard Toffoli gates in libraries of universal reversible gates. This work was supported by the NNSF of China under Grant 60773205 and the Fund of Cultivating Leading Scholars in UESTC. |
| Keywords: | Circuits networks switching theory application of Boolean algebra Boolean function discrete mathematics in relation to computer science combinatorics |
| 本文献已被 SpringerLink 等数据库收录！ | |