Biswas, NN (1985) PLA folding algorithm from compatibility relations. In: Electronic Letters, 21 (21). pp. 984-986.
Full text not available from this repository. (Request a copy)Abstract
The letter reports an algorithm for the folding of programmable logic arrays. The algorithm is valid for both column and row folding, although it has been presented considering only the simple column folding. The pairwise compatibility relations among all the pairs of the columns of the PLA are plotted in a matrix called the compatibility matrix of the PLA. A foldable compatibility matrix (FCM), a new concept defined in the letter, is then derived from the compatibility matrix. Once an FCM is obtained, the ordered pairs of fold-able columns and the reordering of the rows are readily determined
| Item Type: | Journal Article |
|---|---|
| Publication: | Electronic Letters |
| Publisher: | IEE |
| Additional Information: | Copyright of this article belongs to IEE. |
| Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
| Date Deposited: | 30 Jan 2010 05:25 |
| Last Modified: | 30 Jan 2010 05:25 |
| URI: | http://eprints.iisc.ac.in/id/eprint/22931 |
Actions (login required)
 |
View Item |
