Skip to main content
SpringerLink
Log in

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

  • Miscellaneous
  • Conference paper
  • First Online:
Field-Programmable Logic and Applications From FPGAs to Computing Paradigm (FPL 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1482))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. 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 

  3. 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 

  4. A. K. Mackworth, “The logic of constraint satisfaction,” Artificial Intelligence, no. 58, pp3–20, 1992.

    Article  MathSciNet  Google Scholar 

  5. P. R. Cooper, “Arc consistency: parallelism and domain dependence,” Artificial Intelligence, no. 58, pp207–235, 1992.

    Article  MathSciNet  Google Scholar 

  6. R. M. Haralick and G. L. Elliott, “Increasing Tree Search Efficiency for Constraint Satisfaction Problems,” Artificial Intelligence, no. 14, pp263–313, 1980.

    Article  Google Scholar 

  7. 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 

  8. “PARTHENON Home Page,” http://www.kecl.ntt.co.jp/car/prthe/

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Optical Network Systems Laboratories, 1-1 Hikari-no-oka, Yokosuka-shi, 239-0847, Kanagawa, Japan

    Tsunemichi Shiozawa, Kiyoshi Oguri, Kouichi Nagami, Hideyuki Ito, Ryusuke Konishi & Norbert Imlig

Authors
  1. Tsunemichi Shiozawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kiyoshi Oguri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kouichi Nagami
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hideyuki Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ryusuke Konishi
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Norbert Imlig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Reiner W. Hartenstein Andres Keevallik

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shiozawa, T., Oguri, K., Nagami, K., Ito, H., Konishi, R., Imlig, N. (1998). A hardware implementation of Constraint Satisfaction Problem based on new reconfigurante LSI architecture. In: Hartenstein, R.W., Keevallik, A. (eds) Field-Programmable Logic and Applications From FPGAs to Computing Paradigm. FPL 1998. Lecture Notes in Computer Science, vol 1482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055274

Download citation

  • DOI: https://doi.org/10.1007/BFb0055274

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64948-9

  • Online ISBN: 978-3-540-68066-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation