Improved ordering of ESOP cubes for Toffoli networks
| dc.contributor.advisor | Dueck, Gerhard | |
| dc.contributor.author | Hamza, Zakaria | |
| dc.date.accessioned | 2023-03-01T16:18:30Z | |
| dc.date.available | 2023-03-01T16:18:30Z | |
| dc.date.issued | 2011 | |
| dc.date.updated | 2016-07-15T00:00:00Z | |
| dc.description.abstract | Logic synthesis deals with the problem of finding a cost-effective realization of a given logic function. This uses several state-of-the-art techniques and involves several tools of mathematical origin. In recent years reversible logic has been suggested to address the power consumption associated with computation. To accomplish such a task, synthesis of reversible logic function is needed. Several new synthesis methods have been developed. In this thesis methods are proposed that improve on a given synthesis method. In particular, interest has been demonstrated in the optimization of this class of circuits which use the particular Exclusive-or Sum of Product (ESOP) terms representation. The advantage this representation format offers is in the ease of mapping the function to a network of Toffoli logic gates. However, this synthesis technique provides non-optimal results which could be improved. This problem has roots in both the representation and mapping processes of synthesis. It is well-known that the order of the terms in the ESOP expression will have a direct effect on the cost of the implementation. The problem of finding the optimal order can be mapped into the Generalized Traveling Salesman Problem. Another route of optimization involves reducing the number of terms used to represent the function. This can be achieved by canonical representation of functions. Both of these have proven to offer enhancements over existing synthesis techniques and have been developed in this thesis. Experimental results show that significant improvements can be achieved with the proposed methods. | |
| dc.description.copyright | © Zakaria Hamza, 2011 | |
| dc.description.note | (UNB thesis number) Thesis 8777. (OCoLC)810261535. | |
| dc.description.note | M.C.S. University of New Brunswick, Faculty of Computer Science, 2011 | |
| dc.format | text/xml | |
| dc.format.extent | vi, 95 pages : illustrations | |
| dc.format.medium | electronic | |
| dc.identifier.oclc | (OCoLC)810261535 | |
| dc.identifier.other | Thesis 8777 | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/13431 | |
| dc.language.iso | en_CA | |
| dc.publisher | University of New Brunswick | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.subject.lcsh | Electric circuit analysis. | |
| dc.subject.lcsh | Quantum logic. | |
| dc.subject.lcsh | Logic circuits. | |
| dc.subject.lcsh | Gate array circuits -- Design. | |
| dc.subject.lcsh | Logic design -- Data processing. | |
| dc.subject.lcsh | Combinatorial optimization -- Data processing. | |
| dc.subject.lcsh | Traveling salesman problem. | |
| dc.subject.lcsh | Computer algorithms. | |
| dc.title | Improved ordering of ESOP cubes for Toffoli networks | |
| dc.type | master thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.fullname | Master of Computer Science | |
| thesis.degree.fullname | Masters of Computer Science | |
| thesis.degree.grantor | University of New Brunswick | |
| thesis.degree.level | masters | |
| thesis.degree.name | M.C.S. |
Files
Original bundle
1 - 1 of 1