An Algorithm for Optimal Bipartite PLA Folding
| Data(s) |
04/01/2010
04/01/2010
2003
|
|---|---|
| Resumo |
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. |
| Identificador |
1313-0463 |
| Idioma(s) |
en |
| Publicador |
Institute of Information Theories and Applications FOI ITHEA |
| Palavras-Chave | #Programmable Logic Array #Area Optimization #PLA Folding #Bipartite Folding |
| Tipo |
Article |
