Maher Hawash | Portland State University (original) (raw)

Papers by Maher Hawash

Research paper thumbnail of Synthesis of reversible circuits for large reversible functions

Facta universitatis - series: Electronics and Energetics, 2010

This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circ... more This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The well-known MMD algorithm for synthesis of reversible circuits requires to store a truth table (or a Reed-Muller-RM transform) as a 2n vector to represent a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we do not store such an exponentially growing data structure. The values of minterms are calculated in MP dynamically, one-by-one, from a set of logic equations that specify the reversible circuit to be designed. This allows for synthesis of large scale reversible circuits (30-bits), which is not possible with any existing algorithm. In addition, our unique multi-pass approach where the circuit is synthesized with various, yet specific, minterm orders yields quasi-optimal solution. The algorithm returns a description of the quasi-optimal circuit with respect to gate count or to its "quantum cost". Although the synthesis process in MP is relatively slower, the solution is found in real-time for smaller circuits of 8 bits or less.

Research paper thumbnail of Reversible Function Synthesis of Large Reversible Functions with No Ancillary Bits Using Covering Set Partitions

2011 Eighth International Conference on Information Technology: New Generations, 2011

This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary f... more This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2 n terms in memory or require a huge amount of time to yield results because they must calculate all possible permutations of an input vector. In contrast, the CSP algorithm harnesses the natural mathematical properties of binary numbers, partially ordered sets and covering graph theory, to construct input vectors which are guaranteed to produce valid results. A randomly selected subset of all valid input vectors are processed where the best input vector sequence wins. The CSP algorithm is capable of synthesizing functions of large number of variables (30 bits) in a reasonable amount of time.

Research paper thumbnail of Application of Genetic Algorithm for Synthesis of Large Reversible Circuits using Covered Set Partitions

We present the results of application of Evolutionary Algorithms to the problem of synthesizing q... more We present the results of application of Evolutionary Algorithms to the problem of synthesizing quantum circuits which belong to the class of reversible circuits, represented as an input/output mapping vectors. The paper specifically focuses on large quantum circuits where many valid solutions exist in an exponentially inflating search space. Valid solutions represent the set of all input vector permutations (arrangements) which satisfy the circuit specification. The search space for circuits with large number of variables grows exponentially making it impossible to discover the set of optimal solutions. The paper compares three methods for selecting valid solutions of input vector sequences: 1) randomly, 2) genetic algorithm, 3) Tabu search. The objective function calculates the number of elementary quantum gates needed to represent the solution such that lower number of gates represents better solutions. In addition to the choice of selection algorithm, we illustrate the impact of using different partition depths for the Covered Set Partitions algorithm used to construct valid input vector sequences.

Research paper thumbnail of DirectX, RDX, RSX, and MMX Technology: A Jumpstart Guide to High Performance APIs

From the Book: PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past fe... more From the Book: PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past few years, the pace of technology growth has been exhilarating. Microsoft launched Windows 95. Intel debuted the Pentium, Pentium Pro, and MMX technology processors. Netscape burst the Internet pipe with a new class of applications and architectures. These companies and others paraded out a slew of new multimedia architectures. And you've never before felt so lost in space. Maybe, you're familiar with programming for Windows 95 and now want to deliver Windows 95 multimedia applications, and you're wondering where to start. Or maybe, you've programmed multimedia for DOS/Windows 3.1, and now you're scrambling to learn Windows 95, learn the new computing environment, and then learn to deliver high-performance multimedia in this environment. Well, several new architectures have been introduced to help you deliver high-performance multimedia under Windows 9x, such as DirectD...

Research paper thumbnail of Methods for Efficient Synthesis of Large Reversible Binary and Ternary Quantum Circuits and Applications of Linear Nearest Neighbor Model

This dissertation describes the development of automated synthesis algorithms that construct reve... more This dissertation describes the development of automated synthesis algorithms that construct reversible quantum circuits for reversible functions with large number of variables. Specifically, the research area is focused on reversible, permutative and fully specified binary and ternary specifications and the applicability of the resulting circuit to the physical limitations of existing quantum technologies. Automated synthesis of arbitrary reversible specifications is an NP hard, multiobjective optimization problem, where 1) the amount of time and computational resources required to synthesize the specification, 2) the number of primitive quantum gates in the resulting circuit (quantum cost), and 3) the number of ancillary qubits (variables added to hold intermediate calculations) are all minimized while 4) the number of variables is maximized. Some of the existing algorithms in the literature ignored tenth of my PhD. I close by thanking my friends Naveed and

Research paper thumbnail of Color as a visual cue in speech-enabled applications

Research paper thumbnail of Method and apparatus for processing inputs into a computing device

Research paper thumbnail of Using Hasse Diagrams to Synthesize Ternary Quantum Circuits

We present the results of application of Hasse diagrams to the problem of synthesizing ternary qu... more We present the results of application of Hasse diagrams to the problem of synthesizing ternary quantum circuits represented as input-output mapping vectors. The paper specifically focuses on ternary quantum circuits with relatively large number of variables where valid solutions exist in an exponentially expanding search space. Valid solutions represent the set of all input vector permutations (arrangements or sequences) which satisfy the circuit specification and are algorithmically convergent. We discovered that a) the ordering of the input vector has an impact on the size of the resulting circuit and, that b) only certain orderings are algorithmically convergent. Here we describe a method for systematically constructing such valid sequences using a ternary Hasse diagram and illustrate a detailed proof of the critical issue of algorithmic convergence. In essence, we illustrate the benefit of exploring many input sequences over limiting the synthesis to the natural binary order.

Research paper thumbnail of Speaker independent voice recognition (SIVR) using dynamic assignment of speech contexts, dynamic biasing, and multi-pass parsing

Research paper thumbnail of Real-time prescription renewal transaction across a network

The present invention provides for performing a prescription renewal transaction through a portab... more The present invention provides for performing a prescription renewal transaction through a portable healthcare device, including providing prescription-related information with a request for renewal of the prescription. A renewal request is transmitted from a pharmacy site to a benefits manager, where the relevant prescription-related information is immediately added. The request is prepared by an access server for reading at the portable healthcare device and is considered by the healthcare professional in generating a decision to allow or disallow the renewal. This response is returned into an end-to-end communication system that includes a real-time communication channel to the remote prescription site. In addition, other aspects of the present invention relating to the renewal of a prescription.

Research paper thumbnail of DirectX, RDX, RSX, and MMX Technology: A Jumpstart Guide to High Performance APIs

From the Book:PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past few... more From the Book:PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past few years, the pace of technology growth has been exhilarating. Microsoft launched Windows 95. Intel debuted the Pentium, Pentium Pro, and MMX technology processors. Netscape burst the Internet pipe with a new class of applications and architectures. These companies and others paraded out a slew of new multimedia architectures. And you've never before felt so lost in space. Maybe, you're familiar with programming for Windows 95 and now want to deliver Windows 95 multimedia applications, and you're wondering where to start. Or maybe, you've programmed multimedia for DOS/Windows 3.1, and now you're scrambling to learn Windows 95, learn the new computing environment, and then learn to deliver high-performance multimedia in this environment. Well, several new architectures have been introduced to help you deliver high-performance multimedia under Windows 9x, such as DirectDr...

Research paper thumbnail of Minimizing Reversible Circuits in the 2n Scheme Using Two and Three Bits Patterns

2014 17th Euromicro Conference on Digital System Design, 2014

Research paper thumbnail of Synthesis of Reversible Circuits with No Ancilla Bits for Large Reversible Functions Specified with Bit Equations

2010 40th IEEE International Symposium on Multiple-Valued Logic, 2010

This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circ... more This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The MMD algorithm requires to store a truth table (or a Reed-Muller-RM transform) as a 2 n vector for a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we do not store such an exponentially growing data structure. The values of minterms are calculated in MP dynamically, one-by-one, from a set of logic equations that specify the reversible circuit to be designed. This allows for synthesis of large scale reversible circuits (30-bits), which is not possible with existing algorithms. In addition, our unique multipass approach where the circuit is synthesized with various, yet specific, minterm orders yields optimal solution. The algorithm returns a description of the optimal circuit with respect to gate count or quantum cost. Although the synthesis process is relatively slower, the solution is found in real-time for smaller circuits of 8 bits or less I.

Research paper thumbnail of Multiple-Valued Reversible Benchmarks and Extensible Quantum Specification (XQS) Format

2013 IEEE 43rd International Symposium on Multiple-Valued Logic, 2013

ABSTRACT In this paper we introduce a set of resources used to describe multiple-valued (MV) func... more ABSTRACT In this paper we introduce a set of resources used to describe multiple-valued (MV) functions: a set of multiple-valued benchmarks and a file format specifically designed to accommodate the requirements of multiple-valued function representation. The proposed functions are intended for use as reference benchmarks for automated synthesis algorithms of multiple-valued circuits. In the MV domain, functions can be represented using fixed radices (e.g. ternary, quaternary, etc) or using mixed radices (hybrid functions). Since such functions are harder to represent with the existing PLA specification, in this paper, we introduce the eXtensible Quantum Specification (XQS) file format which is based on the well-known YAML file specification.

Research paper thumbnail of Using Hasse Diagrams to Synthesize Ternary Quantum Circuits

2012 IEEE 42nd International Symposium on Multiple-Valued Logic, 2012

We present the results of application of Hasse diagrams to the problem of synthesizing ternary qu... more We present the results of application of Hasse diagrams to the problem of synthesizing ternary quantum circuits represented as input-output mapping vectors. The paper specifically focuses on ternary quantum circuits with relatively large number of variables where valid solutions exist in an exponentially expanding search space. Valid solutions represent the set of all input vector permutations (arrangements or sequences) which satisfy the circuit specification and are algorithmically convergent. We discovered that a) the ordering of the input vector has an impact on the size of the resulting circuit and, that b) only certain orderings are algorithmically convergent. Here we describe a method for systematically constructing such valid sequences using a ternary Hasse diagram and illustrate a detailed proof of the critical issue of algorithmic convergence. In essence, we illustrate the benefit of exploring many input sequences over limiting the synthesis to the natural binary order.

Research paper thumbnail of Synthesis of reversible circuits for large reversible functions

Facta universitatis - series: Electronics and Energetics, 2010

This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circ... more This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The well-known MMD algorithm for synthesis of reversible circuits requires to store a truth table (or a Reed-Muller-RM transform) as a 2n vector to represent a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we do not store such an exponentially growing data structure. The values of minterms are calculated in MP dynamically, one-by-one, from a set of logic equations that specify the reversible circuit to be designed. This allows for synthesis of large scale reversible circuits (30-bits), which is not possible with any existing algorithm. In addition, our unique multi-pass approach where the circuit is synthesized with various, yet specific, minterm orders yields quasi-optimal solution. The algorithm returns a description of the quasi-optimal circuit with respect to gate count or to its "quantum cost". Although the synthesis process in MP is relatively slower, the solution is found in real-time for smaller circuits of 8 bits or less.

Research paper thumbnail of Reversible Function Synthesis of Large Reversible Functions with No Ancillary Bits Using Covering Set Partitions

2011 Eighth International Conference on Information Technology: New Generations, 2011

This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary f... more This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2 n terms in memory or require a huge amount of time to yield results because they must calculate all possible permutations of an input vector. In contrast, the CSP algorithm harnesses the natural mathematical properties of binary numbers, partially ordered sets and covering graph theory, to construct input vectors which are guaranteed to produce valid results. A randomly selected subset of all valid input vectors are processed where the best input vector sequence wins. The CSP algorithm is capable of synthesizing functions of large number of variables (30 bits) in a reasonable amount of time.

Research paper thumbnail of Application of Genetic Algorithm for Synthesis of Large Reversible Circuits using Covered Set Partitions

We present the results of application of Evolutionary Algorithms to the problem of synthesizing q... more We present the results of application of Evolutionary Algorithms to the problem of synthesizing quantum circuits which belong to the class of reversible circuits, represented as an input/output mapping vectors. The paper specifically focuses on large quantum circuits where many valid solutions exist in an exponentially inflating search space. Valid solutions represent the set of all input vector permutations (arrangements) which satisfy the circuit specification. The search space for circuits with large number of variables grows exponentially making it impossible to discover the set of optimal solutions. The paper compares three methods for selecting valid solutions of input vector sequences: 1) randomly, 2) genetic algorithm, 3) Tabu search. The objective function calculates the number of elementary quantum gates needed to represent the solution such that lower number of gates represents better solutions. In addition to the choice of selection algorithm, we illustrate the impact of using different partition depths for the Covered Set Partitions algorithm used to construct valid input vector sequences.

Research paper thumbnail of DirectX, RDX, RSX, and MMX Technology: A Jumpstart Guide to High Performance APIs

From the Book: PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past fe... more From the Book: PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past few years, the pace of technology growth has been exhilarating. Microsoft launched Windows 95. Intel debuted the Pentium, Pentium Pro, and MMX technology processors. Netscape burst the Internet pipe with a new class of applications and architectures. These companies and others paraded out a slew of new multimedia architectures. And you've never before felt so lost in space. Maybe, you're familiar with programming for Windows 95 and now want to deliver Windows 95 multimedia applications, and you're wondering where to start. Or maybe, you've programmed multimedia for DOS/Windows 3.1, and now you're scrambling to learn Windows 95, learn the new computing environment, and then learn to deliver high-performance multimedia in this environment. Well, several new architectures have been introduced to help you deliver high-performance multimedia under Windows 9x, such as DirectD...

Research paper thumbnail of Methods for Efficient Synthesis of Large Reversible Binary and Ternary Quantum Circuits and Applications of Linear Nearest Neighbor Model

This dissertation describes the development of automated synthesis algorithms that construct reve... more This dissertation describes the development of automated synthesis algorithms that construct reversible quantum circuits for reversible functions with large number of variables. Specifically, the research area is focused on reversible, permutative and fully specified binary and ternary specifications and the applicability of the resulting circuit to the physical limitations of existing quantum technologies. Automated synthesis of arbitrary reversible specifications is an NP hard, multiobjective optimization problem, where 1) the amount of time and computational resources required to synthesize the specification, 2) the number of primitive quantum gates in the resulting circuit (quantum cost), and 3) the number of ancillary qubits (variables added to hold intermediate calculations) are all minimized while 4) the number of variables is maximized. Some of the existing algorithms in the literature ignored tenth of my PhD. I close by thanking my friends Naveed and

Research paper thumbnail of Color as a visual cue in speech-enabled applications

Research paper thumbnail of Method and apparatus for processing inputs into a computing device

Research paper thumbnail of Using Hasse Diagrams to Synthesize Ternary Quantum Circuits

We present the results of application of Hasse diagrams to the problem of synthesizing ternary qu... more We present the results of application of Hasse diagrams to the problem of synthesizing ternary quantum circuits represented as input-output mapping vectors. The paper specifically focuses on ternary quantum circuits with relatively large number of variables where valid solutions exist in an exponentially expanding search space. Valid solutions represent the set of all input vector permutations (arrangements or sequences) which satisfy the circuit specification and are algorithmically convergent. We discovered that a) the ordering of the input vector has an impact on the size of the resulting circuit and, that b) only certain orderings are algorithmically convergent. Here we describe a method for systematically constructing such valid sequences using a ternary Hasse diagram and illustrate a detailed proof of the critical issue of algorithmic convergence. In essence, we illustrate the benefit of exploring many input sequences over limiting the synthesis to the natural binary order.

Research paper thumbnail of Speaker independent voice recognition (SIVR) using dynamic assignment of speech contexts, dynamic biasing, and multi-pass parsing

Research paper thumbnail of Real-time prescription renewal transaction across a network

The present invention provides for performing a prescription renewal transaction through a portab... more The present invention provides for performing a prescription renewal transaction through a portable healthcare device, including providing prescription-related information with a request for renewal of the prescription. A renewal request is transmitted from a pharmacy site to a benefits manager, where the relevant prescription-related information is immediately added. The request is prepared by an access server for reading at the portable healthcare device and is considered by the healthcare professional in generating a decision to allow or disallow the renewal. This response is returned into an end-to-end communication system that includes a real-time communication channel to the remote prescription site. In addition, other aspects of the present invention relating to the renewal of a prescription.

Research paper thumbnail of DirectX, RDX, RSX, and MMX Technology: A Jumpstart Guide to High Performance APIs

From the Book:PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past few... more From the Book:PREFACE: Why Read This Book? There's Lots of New Stuff to Learn In the past few years, the pace of technology growth has been exhilarating. Microsoft launched Windows 95. Intel debuted the Pentium, Pentium Pro, and MMX technology processors. Netscape burst the Internet pipe with a new class of applications and architectures. These companies and others paraded out a slew of new multimedia architectures. And you've never before felt so lost in space. Maybe, you're familiar with programming for Windows 95 and now want to deliver Windows 95 multimedia applications, and you're wondering where to start. Or maybe, you've programmed multimedia for DOS/Windows 3.1, and now you're scrambling to learn Windows 95, learn the new computing environment, and then learn to deliver high-performance multimedia in this environment. Well, several new architectures have been introduced to help you deliver high-performance multimedia under Windows 9x, such as DirectDr...

Research paper thumbnail of Minimizing Reversible Circuits in the 2n Scheme Using Two and Three Bits Patterns

2014 17th Euromicro Conference on Digital System Design, 2014

Research paper thumbnail of Synthesis of Reversible Circuits with No Ancilla Bits for Large Reversible Functions Specified with Bit Equations

2010 40th IEEE International Symposium on Multiple-Valued Logic, 2010

This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circ... more This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The MMD algorithm requires to store a truth table (or a Reed-Muller-RM transform) as a 2 n vector for a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we do not store such an exponentially growing data structure. The values of minterms are calculated in MP dynamically, one-by-one, from a set of logic equations that specify the reversible circuit to be designed. This allows for synthesis of large scale reversible circuits (30-bits), which is not possible with existing algorithms. In addition, our unique multipass approach where the circuit is synthesized with various, yet specific, minterm orders yields optimal solution. The algorithm returns a description of the optimal circuit with respect to gate count or quantum cost. Although the synthesis process is relatively slower, the solution is found in real-time for smaller circuits of 8 bits or less I.

Research paper thumbnail of Multiple-Valued Reversible Benchmarks and Extensible Quantum Specification (XQS) Format

2013 IEEE 43rd International Symposium on Multiple-Valued Logic, 2013

ABSTRACT In this paper we introduce a set of resources used to describe multiple-valued (MV) func... more ABSTRACT In this paper we introduce a set of resources used to describe multiple-valued (MV) functions: a set of multiple-valued benchmarks and a file format specifically designed to accommodate the requirements of multiple-valued function representation. The proposed functions are intended for use as reference benchmarks for automated synthesis algorithms of multiple-valued circuits. In the MV domain, functions can be represented using fixed radices (e.g. ternary, quaternary, etc) or using mixed radices (hybrid functions). Since such functions are harder to represent with the existing PLA specification, in this paper, we introduce the eXtensible Quantum Specification (XQS) file format which is based on the well-known YAML file specification.

Research paper thumbnail of Using Hasse Diagrams to Synthesize Ternary Quantum Circuits

2012 IEEE 42nd International Symposium on Multiple-Valued Logic, 2012

We present the results of application of Hasse diagrams to the problem of synthesizing ternary qu... more We present the results of application of Hasse diagrams to the problem of synthesizing ternary quantum circuits represented as input-output mapping vectors. The paper specifically focuses on ternary quantum circuits with relatively large number of variables where valid solutions exist in an exponentially expanding search space. Valid solutions represent the set of all input vector permutations (arrangements or sequences) which satisfy the circuit specification and are algorithmically convergent. We discovered that a) the ordering of the input vector has an impact on the size of the resulting circuit and, that b) only certain orderings are algorithmically convergent. Here we describe a method for systematically constructing such valid sequences using a ternary Hasse diagram and illustrate a detailed proof of the critical issue of algorithmic convergence. In essence, we illustrate the benefit of exploring many input sequences over limiting the synthesis to the natural binary order.