Efficient algorithm for Weinberger array folding

Sadiq M. Sait; Muhammad Abdul Aziz Al-Rashed

doi:10.1080/00207219008920334

Efficient algorithm for Weinberger array folding

Sadiq M. Sait, Muhammad Abdul Aziz Al-Rashed

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Weinberger arrays (WAs) are an alternative to programmable logic arrays (PLAs) as a method of implementing combinational logic circuits. Column folding is a technique generally employed in PLAs to save the silicon area by implementing the circuit of two columns in the area of one. This paper describes an algorithm for folding Weinberger arrays. The algorithm performs column and row ordering and then column folding. The complexity of the algorithm is O (n²). The algorithm has been tested extensively on WAs that were generated both for practical circuits and for numerous randomly generated ciruits. Experimental results are discussed.

Original language	English
Pages (from-to)	509-518
Number of pages	10
Journal	International Journal of Electronics
Volume	69
Issue number	4
DOIs	https://doi.org/10.1080/00207219008920334
State	Published - Oct 1990

Bibliographical note

Funding Information:
The authors acknowledge the support of the King Fahd University of Petroleum and Minerals. They also thank Mr Ahmed A. Al-Sheikh for his help in making the illustrations.

ASJC Scopus subject areas

Electrical and Electronic Engineering

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1080/00207219008920334

Cite this

@article{d7d6c1774bbe456082a8131e7d7f1102,

title = "Efficient algorithm for Weinberger array folding",

abstract = "Weinberger arrays (WAs) are an alternative to programmable logic arrays (PLAs) as a method of implementing combinational logic circuits. Column folding is a technique generally employed in PLAs to save the silicon area by implementing the circuit of two columns in the area of one. This paper describes an algorithm for folding Weinberger arrays. The algorithm performs column and row ordering and then column folding. The complexity of the algorithm is O (n2). The algorithm has been tested extensively on WAs that were generated both for practical circuits and for numerous randomly generated ciruits. Experimental results are discussed.",

author = "Sait, \{Sadiq M.\} and Al-Rashed, \{Muhammad Abdul Aziz\}",

note = "Funding Information: The authors acknowledge the support of the King Fahd University of Petroleum and Minerals. They also thank Mr Ahmed A. Al-Sheikh for his help in making the illustrations.",

year = "1990",

month = oct,

doi = "10.1080/00207219008920334",

language = "English",

volume = "69",

pages = "509--518",

journal = "International Journal of Electronics",

issn = "0020-7217",

number = "4",

}

TY - JOUR

T1 - Efficient algorithm for Weinberger array folding

AU - Sait, Sadiq M.

AU - Al-Rashed, Muhammad Abdul Aziz

N1 - Funding Information: The authors acknowledge the support of the King Fahd University of Petroleum and Minerals. They also thank Mr Ahmed A. Al-Sheikh for his help in making the illustrations.

PY - 1990/10

Y1 - 1990/10

N2 - Weinberger arrays (WAs) are an alternative to programmable logic arrays (PLAs) as a method of implementing combinational logic circuits. Column folding is a technique generally employed in PLAs to save the silicon area by implementing the circuit of two columns in the area of one. This paper describes an algorithm for folding Weinberger arrays. The algorithm performs column and row ordering and then column folding. The complexity of the algorithm is O (n2). The algorithm has been tested extensively on WAs that were generated both for practical circuits and for numerous randomly generated ciruits. Experimental results are discussed.

AB - Weinberger arrays (WAs) are an alternative to programmable logic arrays (PLAs) as a method of implementing combinational logic circuits. Column folding is a technique generally employed in PLAs to save the silicon area by implementing the circuit of two columns in the area of one. This paper describes an algorithm for folding Weinberger arrays. The algorithm performs column and row ordering and then column folding. The complexity of the algorithm is O (n2). The algorithm has been tested extensively on WAs that were generated both for practical circuits and for numerous randomly generated ciruits. Experimental results are discussed.

UR - https://www.scopus.com/pages/publications/0025499811

U2 - 10.1080/00207219008920334

DO - 10.1080/00207219008920334

M3 - Article

AN - SCOPUS:0025499811

SN - 0020-7217

VL - 69

SP - 509

EP - 518

JO - International Journal of Electronics

JF - International Journal of Electronics

IS - 4

ER -

Efficient algorithm for Weinberger array folding

Abstract

Bibliographical note

ASJC Scopus subject areas

UN SDGs

Access to Document

Fingerprint

Cite this