AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for deriving algorithms on processor arrays with reconfigurable bus systems. The effectiveness of this approach is shown through some important applications. They include computing the logical exclusive-OR of n bits, summing n bits, summing n m-bit binary integers, and multiplying two n-bit binary integers. All these applications are solved in O(1) time
In this paper, we use the tensor product notation as the framework of a programming methodology for ...
International audienceIn this paper, we introduce a constraint programming- based approach for the o...
Reconfigurable systems are widely used nowadays to increase performance of computationally intensive...
[[abstract]]In this paper, a new approach, which is based on function decomposition, is proposed for...
AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for der...
[[abstract]]The power of a computation model usually indicates how fast a problem can be solved unde...
[[abstract]]A reconfigurable bus system is a bus system whose configuration is dynamically changeabl...
[[abstract]]A processor array with a reconfigurable bus system (abbreviated to PARBS) is a computati...
[[abstract]]©2002 IEEE-In this paper, we use the tensor product notation as the framework of a progr...
This paper presents a formalism for describing the behavior of computational networks at the algori...
[[abstract]]ABSTRACT The Designs and Analyses of Parallel Algorithms for Some Problems on Permutatio...
[[abstract]]The authors present an asymptotically efficient parallel algorithm for summing up n bina...
The reconfigurable mesh (RN-MESH) can solve a large class of problems in constant time, including pr...
[[abstract]]We develop constant-time algorithms to compute the Hough transform on a processor array ...
AbstractThis paper presents the following algorithms to compute the sum of nd-bit integers on reconf...
In this paper, we use the tensor product notation as the framework of a programming methodology for ...
International audienceIn this paper, we introduce a constraint programming- based approach for the o...
Reconfigurable systems are widely used nowadays to increase performance of computationally intensive...
[[abstract]]In this paper, a new approach, which is based on function decomposition, is proposed for...
AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for der...
[[abstract]]The power of a computation model usually indicates how fast a problem can be solved unde...
[[abstract]]A reconfigurable bus system is a bus system whose configuration is dynamically changeabl...
[[abstract]]A processor array with a reconfigurable bus system (abbreviated to PARBS) is a computati...
[[abstract]]©2002 IEEE-In this paper, we use the tensor product notation as the framework of a progr...
This paper presents a formalism for describing the behavior of computational networks at the algori...
[[abstract]]ABSTRACT The Designs and Analyses of Parallel Algorithms for Some Problems on Permutatio...
[[abstract]]The authors present an asymptotically efficient parallel algorithm for summing up n bina...
The reconfigurable mesh (RN-MESH) can solve a large class of problems in constant time, including pr...
[[abstract]]We develop constant-time algorithms to compute the Hough transform on a processor array ...
AbstractThis paper presents the following algorithms to compute the sum of nd-bit integers on reconf...
In this paper, we use the tensor product notation as the framework of a programming methodology for ...
International audienceIn this paper, we introduce a constraint programming- based approach for the o...
Reconfigurable systems are widely used nowadays to increase performance of computationally intensive...