Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering

Portland State University

Electrical and Computer Engineering Faculty Publications and Presentations

2007

Computer algorithims

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Realization Of Incompletely Specified Functions In Minimized Reversible Cascades, Marek Perkowski, Manjith Kumar, Bala Iyer, Natalie Metzger, Ying Wang Jan 2007

Realization Of Incompletely Specified Functions In Minimized Reversible Cascades, Marek Perkowski, Manjith Kumar, Bala Iyer, Natalie Metzger, Ying Wang

Electrical and Computer Engineering Faculty Publications and Presentations

There is a need to convert non-reversible functions to their corresponding reversible functions to be realized as reversible cascades. The original MMD (D.M.Miller, D. Maslov, and G.W.Dueck) algorithm for synthesis of reversible functions using cascades of reversible gates [1] can be modified to allow for the inclusion of “don't cares” within the given function's truth table (reversible or irreversible). This was achieved in the approach presented, by first initializing the “don't cares” to binary values, synthesizing the network using the base MMD algorithm, comparing the cost, and iterating to find an implementation with the smallest possible cost. The “don't care” …


Search For Universal Ternary Quantum Gate Sets With Exact Minimum Costs, Marek Perkowski, Normen Giesecke, Dong Hwa Kim, Sazzad Hossain Jan 2007

Search For Universal Ternary Quantum Gate Sets With Exact Minimum Costs, Marek Perkowski, Normen Giesecke, Dong Hwa Kim, Sazzad Hossain

Electrical and Computer Engineering Faculty Publications and Presentations

The choice of the best set of universal ternary gates for quantum circuits is an open problem. We create exact minimum cost ternary reversible gates with quantum multiplexers using the method of iterative deepening depth-first search (IDDFS) [25]. Such search is better for small problems than evolutionary algorithms or other search methods. Several new gates that are provably exact minimum cost have been discovered. These gates are next used as library building blocks in the minimization of larger ternary quantum circuits like highly testable GFSOP cascades [15,16] (that generalize ESOP) as well as the wave cascades [24] generalized to ternary …