DocumentCode
914142
Title
A Best-First Search Algorithm for Optimal PLA Folding
Author
Hwang, Sun Young ; Dutton, Robert W. ; Blank, Tom
Author_Institution
Department of Electrical Engineering, Stanford University, Stanford, CA, USA
Volume
5
Issue
3
fYear
1986
fDate
7/1/1986 12:00:00 AM
Firstpage
433
Lastpage
442
Abstract
In this paper we propose a new algorithm for optimal PLA folding based on a graph theoretic formulation. An efficient best-first search (BFS) algorithm is presented which finds a near-optimal PLA folding. The proposed algorithm first constructs the longest paths on the associated disjoint graph generated from the PLA personality matrix, and then extracts the ordered folding sets from the constructed paths. The algorithm is shown to be effective for most test cases.
Keywords
Computational complexity; Design automation; Drives; Heuristic algorithms; Logic arrays; Programmable logic arrays; Silicon; Sun; Terminology; Testing;
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.1986.1270213
Filename
1270213
Link To Document