Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/921

 Title: An Algorithm for Optimal Bipartite PLA Folding Authors: Cheremisinova, Liudmila Keywords: Programmable Logic ArrayArea OptimizationPLA FoldingBipartite Folding Issue Date: 2003 Publisher: Institute of Information Theories and Applications FOI ITHEA Abstract: 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. URI: http://hdl.handle.net/10525/921 ISSN: 1313-0463 Appears in Collections: Volume 10 Number 1

Files in This Item:

File Description SizeFormat