DocumentCode :
911812
Title :
An Algorithm for Optimal PLA Folding
Author :
Hachtel, Gary D. ; Newton, Arthur Richard ; Sangiovanni-Vincentelli, Alberto L.
Author_Institution :
Department of Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
Volume :
1
Issue :
2
fYear :
1982
fDate :
4/1/1982 12:00:00 AM
Firstpage :
63
Lastpage :
77
Abstract :
In this paper we present a graph-theoretic formulation of the optimal PLA folding problem. The class of admissible PLA foldings is defined. Necessary and sufficient conditions for obtaining the optimal folding are given. A subproblem of the optimal problem is shown to be NP-complete, and a heuristic algorithm is given which has proven to be effective on a number of test problems.
Keywords :
Books; Computer science; Database systems; Large scale integration; Logic arrays; Logic design; Process design; Programmable logic arrays; Project management; Very large scale integration;
fLanguage :
English
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0278-0070
Type :
jour
DOI :
10.1109/TCAD.1982.1269996
Filename :
1269996
Link To Document :
بازگشت