Search Results - "Perkowski, M.A."

New multivalued functional decomposition algorithms based on MDDs by Files, C.M., Perkowski, M.A.

“…This paper presents two new functional decomposition partitioning algorithms that use multivalued decision diagrams (MDDs). MDDs are an exceptionally good…”
Get full text

Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions by Song, N., Perkowski, M.A.

“…This paper presents a new operation (exorlink) and an algorithm to minimize Exclusive-OR Sum-of-Products expressions (ESOPs) for multiple valued input, two…”
Get full text

A minimal universal test set for self-test of EXOR-Sum-of-Products circuits by Kalay, U., Hall, D.V., Perkowski, M.A.

“…A testable EXOR-Sum-of-Products (ESOP) circuit realization and a simple, universal test set which detects all single stuck-at faults in the internal lines and…”
Get full text

Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions by Falkowski, B.J., Schafer, I., Perkowski, M.A.

“…A theory has been developed to calculate the Rademacher-Walsh transform from a cube array specification of incompletely specified Boolean functions. The…”
Get full text

Functional decomposition of MVL functions using multi-valued decision diagrams by Files, C., Drechsler, R., Perkowski, M.A.

“…In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine…”
Get full text

Minimization of Quaternary Galois Field Sum of Products Expression for Multi-Output Quaternary Logic Function Using Quaternary Galois Field Decision Diagram by Khan, M.H.A., Siddika, N.K., Perkowski, M.A.

“…A quaternary logic function expressed as quaternary Galois field sum of products (QGFSOP) expression can be realized as a cascade of quaternary 1-qudit,…”
Get full text

GF(4) Based Synthesis of Quaternary Reversible/Quantum Logic Circuits by Khan, M.H.A., Perkowski, M.A.

“…Galois field sum of products (GFSOP) has been found to be very promising for reversible/quantum implementation of multiple-valued logic. In this paper, we show…”
Get full text

On universality of general reversible multiple-valued logic gates by Kerntopf, P., Perkowski, M.A., Khan, M.H.A.

“…A set of p-valued logic gates (primitives) is called universal if an arbitrary p-valued logic function can be realized by a logic circuit built up from a…”
Get full text

Minimization of multioutput TANT networks for unlimited fan-in network model by Perkowski, M.A., Chrzanowska-Jeske, M., Shah, T.

“…A program for the minimization of multi-output three-level Boolean networks from NAND gates of unlimited fan-in is described. This model includes don't care…”
Get full text

A Constructive Algorithm for Reversible Logic Synthesis by Guowu Yang, Fei Xie, Xiaoyu Song, Hung, W.N.N., Perkowski, M.A.

“…This paper presents a constructive synthesis algorithm for any n-qubit reversible function. Given any n-qubit reversible function, there are N distinct input…”
Get full text

Multi-output Galois Field Sum of Products synthesis with new quantum cascades by Khan, M.H.A., Perkowski, M.A., Kerntopf, P.

“…Galois Field Sum of Products (GFSOP) leads to efficient multi-valued reversible circuit synthesis using quantum gates. In this paper, we propose a new…”
Get full text

Ternary Galois field expansions for reversible logic and Kronecker decision diagrams for ternary GFSOP minimization [Galois field sum of products] by Khan, M.H.A., Perkowski, M.A., Khan, M.R.

“…Ternary Galois field sum of products (TGFSOP) expressions are found to be good choice for ternary reversible, and especially quantum, logic design. In this…”
Get full text

Synthesis of Hybrid and d-valued Quantum Logic Circuits by Faisal Shah Khan, Perkowski, M.A.

“…Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A…”
Get full text

Symbolic two-dimensional minimization of strongly unspecified finite state machines by Perkowski, M.A, Jóźwiak, L, Zhao, W

“…A generalization of the classical state minimization problem for finite state machine (FSM) is proposed and discussed. In contrast to classical state…”
Get full text

Generalized partially-mixed-polarity Reed-Muller expansion and its fast computation by Haomin Wu, Perkowski, M.A., Xiaoqiang Zeng, Nan Zhuang

“…Generalized partially-mixed-polarity Reed-Muller (GPMPRM) expansion, a canonical subfamily of exclusive sum of products (ESOP), is presented. An efficient…”
Get full text

Multi-valued functional decomposition as a machine learning method by Files, C.M., Perkowski, M.A.

“…In the past few years, several authors have presented methods of using functional decomposition as applied to machine learning. These authors explore the ideas…”
Get full text

Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams by Drechsler, R., Sarabi, A., Theobald, M., Becker, B., Perkowski, M. A.

“…An efficient package for construction of and operation on ordered Kronecker Functional Decision Diagrams (OKFDD) is presented. OKFDDs are a generalization of…”
Get full text

Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks by Sarabi, A., Perkowski, M.A.

“…The authors introduce fast exact and quasi-minimal algorithms for minimal fixed polarity AND/XOR canonical representation of Boolean functions. The method uses…”
Get full text

Bi-decompositions of multi-valued functions for circuit design and data mining applications by Steinbach, B., Perkowski, M.A., Lang, C.

“…We present efficient algorithms for the bi-decomposition of arbitrary incompletely specified functions in variable-valued logic. Several special cases are…”
Get full text

Fast synthesis of exact minimal reversible circuits using group theory by Guowu Yang, Xiaoyu Song, Hung, W.N.N., Perkowski, M.A.

“…We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis…”
Get full text