Structured Decomposition for Reversible Boolean Functions

doi:10.1109/TCAD.2019.2928974

CORC > 计算技术研究所 > 中国科学院计算技术研究所 > 中国科学院计算技术研究所期刊论文 > 英文

	Structured Decomposition for Reversible Boolean Functions
	Jiang, Jiaqing 1,2; Sun, Xiaoming 1,2; Sun, Yuan ; Wu, Kewen 3; Xia, Zhiyu 1,2
刊名	IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
	2020-10-01
卷号	39 期号:10 页码:2410-2421
关键词	Integrated circuits logic gates quantum computation reversible computation reversible logic synthesis method
ISSN号	0278-0070
DOI	10.1109/TCAD.2019.2928974
英文摘要	Reversible Boolean function (RBF) is a one-to-one function which maps n-bit input to n-bit output. Reversible logic synthesis has been widely studied due to its connection with low-energy computation as well as quantum computation. In this paper, we give a structured decomposition for even RBFs. Specifically, for n >= 6, any even n-bit RBF can be decomposed to 7 blocks of (n-1)-bit RBF, where 7 is a constant independent of n and the positions of these blocks have a large degree of freedom. Moreover, if the (n-1)-bit RBFs are required to be even as well, we show for n >= 10, even n-bit RBF can be decomposed to 10 even (n - 1)-bit RBFs. In short, our decomposition has block depth 7 and even block depth 10. Our result improves Selinger's work in block depth model, by reducing the constant from 9 to 7 and from 13 to 10, when the blocks are limited to be even. We emphasize that our setting is a bit different from Selinger's work. In Selinger's constructive proof, each block is placed in one of two specific positions and thus the decomposition has an alternating structure. We relax this restriction and allow each block to act on arbitrary (n - 1) bits. This relaxation keeps the block structure and provides more candidates when choosing the positions of blocks.
资助项目	National Natural Science Foundation of China[61433014] ; National Natural Science Foundation of China[61832003] ; National Natural Science Foundation of China[61761136014] ; National Natural Science Foundation of China[61872334] ; National Natural Science Foundation of China[61801459] ; 973 Program of China[2016YFB1000201] ; Strategic Priority Research Program of Chinese Academy of Sciences[XDB28000000] ; Anhui Initiative in Quantum Information Technologies[AHY150100]
WOS研究方向	Computer Science ; Engineering
语种	英语
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号	WOS:000572636400036
内容类型	期刊论文
源URL	[http://119.78.100.204/handle/2XEOYT63/15608]
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Sun, Xiaoming
作者单位	1.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China 2.Univ Chinese Acad Sci, Sch Comp Sci & Technol, Beijing 100049, Peoples R China 3.Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100000, Peoples R China
推荐引用方式 GB/T 7714	Jiang, Jiaqing,Sun, Xiaoming,Sun, Yuan,et al. Structured Decomposition for Reversible Boolean Functions[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,2020,39(10):2410-2421.
APA	Jiang, Jiaqing,Sun, Xiaoming,Sun, Yuan,Wu, Kewen,&Xia, Zhiyu.(2020).Structured Decomposition for Reversible Boolean Functions.IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,39(10),2410-2421.
MLA	Jiang, Jiaqing,et al."Structured Decomposition for Reversible Boolean Functions".IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 39.10(2020):2410-2421.