KFUPM ePrints

EFFICIENT ALGORITHM FOR WEINBERGER ARRAY FOLDING

Sait, Sadiq M. and AlRashed, MAA EFFICIENT ALGORITHM FOR WEINBERGER ARRAY FOLDING. INTERNATIONAL JOURNAL OF ELECTRONICS 69 (4): 509-518 OCT 1990.

[img]
Preview
PDF
1132Kb

Abstract

Weinberger arrays (WAs) are an alternative to progammable logic arrays (PLAs) as a method of implementing combinatorial logic circuits. Column folding is a technique generally employed in PLAs to save the silicon area by implementing the circuit of two column in the area of one. THis paper describes an algorithm for folding weinberger arrays. The algorithm performs column and row ordering and tehn column folding. The complexity of the algorithm is 0(n-squared). The algorithm has been tested extensively on WAs that were generated circuits. Experimental results are discussed.



Item Type:Article
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Sait, Sadiq M. and AlRashed, MAA
Email:sadiq@kfupm.edu.sa, UNSPECIFIED
ID Code:424
Deposited By:AbdulRahman
Deposited On:16 Mar 2008 09:55
Last Modified:12 Apr 2011 13:07

Repository Staff Only: item control page