IMI-BAS BAS
 

BulDML at Institute of Mathematics and Informatics >
ITHEA >
International Journal ITA >
2003 >
Volume 10 Number 1 >

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 Array
Area Optimization
PLA Folding
Bipartite 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
ijita10-1-p16.pdf119.05 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!   Creative Commons License DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback