A hardware implementation of Constraint Satisfaction Problem based on new reconfigurante LSI architecture
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.
Unable to display preview. Download preview PDF.
- K. Nagami, K. Oguri, T. Shiozawa, H. Ito and R. Konishi, “Plastic Cell Architecture: Towards Reconfigurable Computing for General-Purpose,” Proc. of FCCM, 1998.Google Scholar
- H. Ito, K. Oguri, K. Nagami, R. Konishi, and T. Shiozawa, “The Plastic Cell Architecture for Dynamic Reconfigurable Computing,” Proc. of RSP, pp39–44, 1998.Google Scholar
- N.Imlig, K. Oguri, H. Ito, K. Nagami, R. Konishi, and T. Shiozawa, “General Purpose Computer Architecture Based on Fully Programmable Logic,” ICES, 1998.Google Scholar
- Y. Nakamura, K. Oguri and A. Nagoya, “Synthesis From Pure Behavioral Descriptions,” High-Level VLSI Synthesis, Edited by R. Camposano and W. Wolf, Kluwer Academic Publishers, pp.205–229, 1991/06.Google Scholar
- “PARTHENON Home Page,” http://www.kecl.ntt.co.jp/car/prthe/Google Scholar