Open Access. Powered by Scholars. Published by Universities.®
Electrical and Computer Engineering
Electrical and Computer Engineering Faculty Publications and Presentations
- Keyword
-
- Quantum computers (3)
- Computer algorithms (2)
- Machine learning (2)
- Data mining (1)
- Decomposition (Mathematics) (1)
-
- Decomposition method (1)
- Gaussian beams (1)
- Gaussian distribution -- Experiments (1)
- Laser speckle (1)
- Logic Synthesis (1)
- Logic circuits (1)
- Logic circuits -- Design and construction (1)
- Logic design (1)
- Maximum entropy method (1)
- Quantum logic (1)
- Reversable Logic (1)
- Reversable computing (1)
- Reversible computing (1)
- Wave guides -- Research (1)
Articles 1 - 8 of 8
Full-Text Articles in Engineering
Gaussian Beams In Hollow Metal Waveguides: Experiment, Marius Ghita, Lee W. Casperson
Gaussian Beams In Hollow Metal Waveguides: Experiment, Marius Ghita, Lee W. Casperson
Electrical and Computer Engineering Faculty Publications and Presentations
Gaussian beams have been widely used for propagating electromagnetic waves in free space and in certain other optical systems. It has been suggested that recurring forms of such beams might also be useful for propagation in planar or rectangular metal waveguides. Experimental verification of the recurrence of the Gaussian field distribution in metal waveguides is reported here.
Implicit Algorithms For Multi-Valued Input Support Manipulation, Alan Mishchenko, Craig Files, Marek Perkowski, Bernd Steinbach, Christina Dorotska
Implicit Algorithms For Multi-Valued Input Support Manipulation, Alan Mishchenko, Craig Files, Marek Perkowski, Bernd Steinbach, Christina Dorotska
Electrical and Computer Engineering Faculty Publications and Presentations
We present an implicit approach to solve problems arising in decomposition of incompletely specified multi-valued functions and relations. We introduce a new representation based on binaryencoded multi-valued decision diagrams (BEMDDs). This representation shares desirable properties of MDDs, in particular, compactness, and is applicable to weakly-specified relations with a large number of output values. This makes our decomposition approach particularly useful for data mining and machine learning. Using BEMDDs to represent multi-valued relations we have developed two complementary input support minimization algorithms. The first algorithm is efficient when the resulting support contains almost all initial variables; the second is efficient when …
A General Decomposition For Reversible Logic, Marek Perkowski, Lech Jozwiak, Pawel Kerntopf, Alan Mishchenko, Anas Al-Rabadi, Alan Coppola, Andrzej Buller, Xiaoyu Song, Svetlana Yanushkevich, Vlad P. Shmerko, Malgorzata Chrzanowska-Jeske, Mozammel Huq Azad Khan
A General Decomposition For Reversible Logic, Marek Perkowski, Lech Jozwiak, Pawel Kerntopf, Alan Mishchenko, Anas Al-Rabadi, Alan Coppola, Andrzej Buller, Xiaoyu Song, Svetlana Yanushkevich, Vlad P. Shmerko, Malgorzata Chrzanowska-Jeske, Mozammel Huq Azad Khan
Electrical and Computer Engineering Faculty Publications and Presentations
Logic synthesis for reversible logic differs considerably from standard logic synthesis. The gates are multi-output and the unutilized outputs from these gates are called “garbage”. One of the synthesis tasks is to reduce the number of garbage signals. Previous approaches to reversible logic synthesis minimized either only the garbage or (predominantly) the number of gates. Here we present for the first time a method that minimizes concurrently the number of gates, their total delay and the total garbage. Our method adopts for reversible logic many ideas developed previously for standard logic synthesis (such as Ashenhurst/Curtis Decomposition, Dietmeyer’s Composition, non-linear preprocessing …
Fast Heuristic Minimization Of Exclusive-Sums-Of-Products, Alan Mishchenko, Marek Perkowski
Fast Heuristic Minimization Of Exclusive-Sums-Of-Products, Alan Mishchenko, Marek Perkowski
Electrical and Computer Engineering Faculty Publications and Presentations
Exclusive-Sums-Of-Products (ESOPs) play an important role in logic synthesis and design-for-test. This paper presents an improved version of the heuristic ESOP minimization procedure proposed in [1,2]. The improvements concern three aspects of the procedure: (1) computation of the starting ESOP cover; (2) increase of the search space for solutions by applying a larger set of cube transformations; (3) development of specialized datastructures for robust manipulation of ESOP covers. Comparison of the new heuristic ESOP minimizer EXORCISM-4 with other minimizers (EXMIN2 [3], MINT [4], EXORCISM-2 [1] and EXORCISM3 [2]) show that, in most cases, EXORCISM-4 produces results of comparable or better …
Bi-Decomposition Of Multi-Valued Relations, Alan Mishchenko, Marek Perkowski, Bernd Steinbach
Bi-Decomposition Of Multi-Valued Relations, Alan Mishchenko, Marek Perkowski, Bernd Steinbach
Electrical and Computer Engineering Faculty Publications and Presentations
This presentation discusses an approach to decomposition of multivalued functions and relations into networks of two-input gates implementing multi-valued MIN and MAX operations. The algorithm exploits both the incompleteness of the initial specification and the flexibilities generated in the process of decomposition. Experimental results over a set of multi-valued benchmarks show that this approach outperforms other approaches in the quality of final results and CPU time.
Decomposition Of Relations: A New Approach To Constructive Induction In Machine Learning And Data Mining -- An Overview, Marek Perkowski, Stanislaw Grygiel
Decomposition Of Relations: A New Approach To Constructive Induction In Machine Learning And Data Mining -- An Overview, Marek Perkowski, Stanislaw Grygiel
Electrical and Computer Engineering Faculty Publications and Presentations
This is a review paper that presents work done at Portland State University and associated groups in years 1989 - 2001 in the area of functional decomposition of multivalued functions and relations, as well as some applications of these methods.
Regularity And Symmetry As A Base For Efficient Realization Of Reversible Logic Circuits, Marek Perkowski, Pawel Kerntopf, Andrzej Buller, Malgorzata Chrzanowska-Jeske, Alan Mishchenko, Xiaoyu Song, Anas Al-Rabadi, Lech Jozwiak, Alan Coppola
Regularity And Symmetry As A Base For Efficient Realization Of Reversible Logic Circuits, Marek Perkowski, Pawel Kerntopf, Andrzej Buller, Malgorzata Chrzanowska-Jeske, Alan Mishchenko, Xiaoyu Song, Anas Al-Rabadi, Lech Jozwiak, Alan Coppola
Electrical and Computer Engineering Faculty Publications and Presentations
We introduce a Reversible Programmable Gate Array (RPGA) based on regular structure to realize binary functions in reversible logic. This structure, called a 2 * 2 Net Structure, allows for more efficient realization of symmetric functions than the methods shown by previous authors. In addition, it realizes many non-symmetric functions even without variable repetition. Our synthesis method to RPGAs allows to realize arbitrary symmetric function in a completely regular structure of reversible gates with smaller “garbage” than the previously presented papers. Because every Boolean function is symmetrizable by repeating input variables, our method is applicable to arbitrary multi-input, multi-output Boolean …
Processing Algorithms For Tracking Speckle Shifts In Optical Elastography Of Biological Tissues, Donald D. Duncan, Sean J. Kirkpatrick
Processing Algorithms For Tracking Speckle Shifts In Optical Elastography Of Biological Tissues, Donald D. Duncan, Sean J. Kirkpatrick
Electrical and Computer Engineering Faculty Publications and Presentations
Parametric and nonparametric data processing schemes for analyzing translating laser speckle data used to investigate the mechanical behavior of biological tissues are examined. Crosscorrelation, minimum mean square estimator, maximum likelihood, and maximum entropy approaches are discussed and compared on speckle data derived from cortical bone samples undergoing dynamic loading. While it was not the purpose of this paper to demonstrate that one processing technique is superior to another, maximum likelihood and maximum entropy approaches are shown to be particularly useful when the observed speckle motion is small.