Debugging of Toffoli networks

Intensive research is performed to find post-CMOS technologies. A very promising direction based on reversible logic are quantum computers. While in the domain of reversible logic synthesis, testing, and verification have been investigated, debugging of reversible circuits has not yet been considere...

Full description

Saved in:
Bibliographic Details
Published in2009 Design, Automation & Test in Europe Conference & Exhibition pp. 1284 - 1289
Main Authors Wille, R., Grosse, D., Frehse, S., Dueck, G.W., Drechsler, R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2009
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Intensive research is performed to find post-CMOS technologies. A very promising direction based on reversible logic are quantum computers. While in the domain of reversible logic synthesis, testing, and verification have been investigated, debugging of reversible circuits has not yet been considered. The goal of debugging is to determine gates of an erroneous circuit that explain the observed incorrect behavior. In this paper we propose the first approach for automatic debugging of reversible Toffoli networks. Our method uses a formulation for the debugging problem based on Boolean satisfiability. We show the differences to classical (irreversible) debugging and present theoretical results. These are used to speed-up the debugging approach as well as to improve the resulting quality. Our method is able to find and to correct single errors automatically.
ISBN:9781424437818
1424437814
ISSN:1530-1591
1558-1101
DOI:10.1109/DATE.2009.5090863