On asymptotic gate complexity and depth of reversible circuits without additional memory
作者：
Highlights：
• We examine the gate complexity of reversible circuits without additional inputs.
• We examine the depth of reversible circuits without additional inputs.
• Lower asymptotic bounds for the gate complexity and the depth are proved.
• New group theory based synthesis algorithm of reversible circuits is proposed.
• Upper asymptotic bounds for the gate complexity and the depth are proved.
摘要
•We examine the gate complexity of reversible circuits without additional inputs.•We examine the depth of reversible circuits without additional inputs.•Lower asymptotic bounds for the gate complexity and the depth are proved.•New group theory based synthesis algorithm of reversible circuits is proposed.•Upper asymptotic bounds for the gate complexity and the depth are proved.
论文关键词：Reversible logic,Gate complexity,Circuit depth,Asymptotic bounds
论文评审过程：Received 29 May 2015, Revised 1 August 2016, Accepted 26 September 2016, Available online 6 October 2016, Version of Record 14 November 2016.
论文官网地址：https://doi.org/10.1016/j.jcss.2016.09.010
