EFFICIENT ALGORITHM FOR WEINBERGER ARRAY FOLDING

EFFICIENT ALGORITHM FOR WEINBERGER ARRAY FOLDING. INTERNATIONAL JOURNAL OF ELECTRONICS 69 (4): 509-518 OCT 1990.

[img]
Preview
PDF
efficient_algorithm.pdf

Download (1MB) | Preview

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
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AbdulRahman
Date Deposited: 16 Mar 2008 06:55
Last Modified: 01 Nov 2019 13:23
URI: https://eprints.kfupm.edu.sa/id/eprint/424