A neural network approach to PLA folding problems

Kazuhiro Tsuchiya, Yoshiyasu Takefuji

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


A near-optimum parallel algorithm for solving PLA folding problems is presented in this paper where the problem is NP-complete and one of the most fundamental problems in VLSI design. The proposed system is composed of n X n neurons based on an artificial two-dimensional maximum neural network where n is the number of inputs and outputs or the number of product lines of PLA. The two-dimensional maximum neurons generate the permutation of inputs and outputs or product lines. Our algorithm can solve not only a simple folding problem but also multiple, bipartite, and constrained folding problems. We have discovered improved solutions in four benchmark problems over the best existing algorithms using the proposed algorithm.

Original languageEnglish
Pages (from-to)1299-1305
Number of pages7
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Issue number10
Publication statusPublished - 1996
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering


Dive into the research topics of 'A neural network approach to PLA folding problems'. Together they form a unique fingerprint.

Cite this