A.G. Ferreira and S.W. Song. Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach. In I. Simon, editor, Latin'92, volume 583 of Lecture Notes in Computer Science, pages 139-153, S~ao Paulo, Brasil, 1992. Springer-Verlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimum PLA Folding through Boolean Satisfiability - Quintana, Avedillo, Parra.. (1995) (Correct)
....arrays are usually very sparse, a considerable area reduction can be achieved by folding. If we restrict the folding to pairs of columns, simple folding is obtained; if no restrictions are imposed, the folding is multiple. The problem of optimum PLA folding is discussed extensively in literature [1 3]. Also, design ideas for the problem of multiple folding of PLAs apply to the gate matrix layout problem [3] The folding problem has been shown to be NPcomplete [4] Consequently most efforts have been made in the search of heuristic algorithms. Here, we transform the problem of simple or ....
....folding to pairs of columns, simple folding is obtained; if no restrictions are imposed, the folding is multiple. The problem of optimum PLA folding is discussed extensively in literature [1 3] Also, design ideas for the problem of multiple folding of PLAs apply to the gate matrix layout problem [3]. The folding problem has been shown to be NPcomplete [4] Consequently most efforts have been made in the search of heuristic algorithms. Here, we transform the problem of simple or multiple column folding into one of boolean satisfiability in a similar way to [5] for the problem of optimal ....
[Article contains additional citation context not shown here]
A.G. Ferreira, y S.W. Song, "Achieving Optimality for Gate Matrix Layout and PLA folding: A Graph theoretic Approach", Integration, the VLSI Journal,14 (1992), pp. 173-195
Building PQR Trees in Almost-Linear Time - Telles, Meidanis (2003) (Correct)
No context found.
A.G. Ferreira and S.W. Song. Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach. In I. Simon, editor, Latin'92, volume 583 of Lecture Notes in Computer Science, pages 139-153, S~ao Paulo, Brasil, 1992. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC