DocumentCode
841657
Title
Three-step heuristic algorithm for optimal PLA column folding
Author
Yang, Ysung-Yu ; Kyung, Chong-Min
Author_Institution
Dept. of Electr. Eng., Korea Advanced Inst. of Sci. & Technol., Seoul
Volume
24
Issue
17
fYear
1988
fDate
8/18/1988 12:00:00 AM
Firstpage
1088
Lastpage
1090
Abstract
A three-step heuristic algorithm for PLA column folding is presented, which is significantly faster than the earlier works and provides nearly optimal results. The three steps are: (i) min-cut partition of vertices in the column intersection graph; (ii) determination of product order using Fiduccia´s min-net cut algorithm; and (iii) head-tail pairing for deciding column folding pairs
Keywords
cellular arrays; graph theory; integrated logic circuits; logic design; PLA column folding; column folding pairs; column intersection graph; fast near optimal algorithm; head-tail pairing; logic design; min-cut partition; min-net cut algorithm; programmable logic array; three-step heuristic algorithm;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
Filename
191753
Link To Document