Biswas, Nripendra N (1986) Foldable compatibility matrix for the folding of programmable logic arrays. In: International Journal of Electronics, 61 (1). pp. 97-103.Full text not available from this repository. (Request a copy)
This paper describes a switching theoretic algorithm for the folding of programmable logic arrays (PLA). 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 mapped into a square matrix, called the compatibility matrix of the PLA. A foldable compatibility matrix (FCM), a new concept introduced by the author, is then derived from the compatibility matrix. A new theorem called the folding theorem is then proved. The theorem states that the existence of an m by 2m FCM is both necessary and sufficient to fold 2m columns of the n column PLA (2m ≤ n). Once an FCM is obtained, the ordered pairs of foldable columns and the re-ordering of the rows are readily determined.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Taylor and Francis Group.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||11 Aug 2009 10:03|
|Last Modified:||11 Aug 2009 10:03|
Actions (login required)