An Algorithm for Optimal Bipartite Pla Folding
نویسنده
چکیده
This paper presents some results of PLA area optimizing by means of its column and row folding. A more restricted type of PLA simple folding is considered. It is introduced by Egan and Liu and called as bipartite folding. An efficient approach is presented which allows finding an optimal bipartite folding without exhaustive computational efforts.
منابع مشابه
An efficient algorithm for bipartite PLA folding
Programmable Logic Arrays (PLA’s) provide a flexible and efficient way of synthesizing arbitrary combinational functions as well as sequential logic circuits. They are used in both LSI and VLSI technologies. The disadvantage of using PLA’s is that most PLA’s are very sparse. The high sparsity of the PLA results in a significant waste of silicon area. PLA folding is a technique which reclaims un...
متن کاملAn efficient algorithm for optimal PLA folding
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 ...
متن کاملOptimizing Programmable Logic Arrays Using the Simulated Annealing Algorithm
In the paper the programmable logic array (PLA) topological optimization problem is dealt with using folding techniques. A PLA folding algorithm based on the method of simulated annealing is presented. A simulated-annealing PLA folding algorithm is presented for multiple unconstrained folding. Then, the algorithm is extended to handle constrained folding. In this way, simple folding is consider...
متن کاملGraph Theoretic Analysis of PLA Folding Heuristics
Because the problem of folding a programmable logic array (PLA) to its smallest possible area is NP-complete, the design and analysis of PLA-folding heuristics is important. In this paper, we study PLA-folding heuristics from a theoretical perspective, using the folding ratio of the heuristic to characterize its worst case behavior. In the first portion of this paper, we obtain best possible bo...
متن کاملOrdering with precedence constraints and budget minimization
We introduce a variation of the scheduling with precedence constraints problem that has applications to molecular folding and production management. We are given a bipartite graph H = (B,S). Vertices in B are thought of as goods or services that must be bought to produce items in S that are to be sold. An edge from j ∈ S to i ∈ B indicates that the production of j requires the purchase of i. Ea...
متن کامل