A Three-Step Heuristic Algorithm For Optimal PLA Column and/or Row Folding

PLA 열 또는 행의 최적 겹침쌍을 찾기위한 3 단계 휴리스틱 알고리즘

A three-step heuristic algorithm for PLA column folding and row folding of column-folded PLA 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 (or row) intersection graph, ii) determination of products' order using Fiduccia's min-net cut algorithm, and iii) head-tail pairing for column folding, while some heuristics are proposed for deciding row folding pairs. The time complexity of this algorithm is O($n^{2}$log n) compared to the O($n^{3}$) - O($n^{4}$) of the earlier works.$^[2][3][9]$ For a test PLA with 23 inputs, 19 outputs and 52 products, the number of column folding pairs obtained using this algorithm is 20 which is optimal, as compared to 17 in a previous work.