A hardware implementation of Constraint Satisfaction Problem based on new reconfigurante LSI architecture

Abstract

The significant features of Plastic Cell Architecture (PCA) are autonomous reconfigurability and adaptable to the granularity of the application. By using these characters, it is possible to build the computing mechanism, which suits the granularity of the problem and the structure of it. We apply PCA to solve the Constraint Satisfaction Problem (CSP) that is typical combinatorial optimization problem, such as scheduling problem or image recognition.