ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Compatibility relation algorithm for the folding of programmable logic arrays

Biswas, NN (1990) Compatibility relation algorithm for the folding of programmable logic arrays. In: International Journal of Systems Science, 21 (8). 1589 - 1601.

Full text not available from this repository. (Request a copy)
Official URL: http://www.tandfonline.com/doi/abs/10.1080/0020772...


The basic principles of an algorithm for the folding of programmable logic arrays (PLAs) are presented in this paper. The algorithm is valid for both column and row folding, although it has been described considering only the simple column folding. The pairwise compatibility relations among all the pairs of the columns of the PLA are mapped into a square matrix, called the compatibility matrix of the PLA. A foldable compatibility matrix (FCM), is then derived from the compatibility matrix. The algorithm presented in this paper is based on the FCM concept and the folding theorem, which states that the existence of an n x m FCM is both necessary and sufficient to fold 2m columns of an M-column PLA $(2m\le n)$.Once an FCM is obtained, the ordered pairs of foldable columns and the reordering of the rows are readily determined. It has been conjectured that the algorithm produces the maximum olding of the PLA in all cases.

Item Type: Journal Article
Publication: International Journal of Systems Science
Publisher: Taylor and Francis Group
Additional Information: Copyright of this article belongs to Taylor and Francis Group.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 10 Jul 2007
Last Modified: 27 Feb 2019 08:59
URI: http://eprints.iisc.ac.in/id/eprint/11469

Actions (login required)

View Item View Item