DocumentCode :
913760
Title :
A Statistical Analysis of PLA Folding
Author :
Makarenko, Darrell D. ; Tartar, John
Author_Institution :
Department of Computing Science, University of Alberta, Edmonton, Alta., Canada
Volume :
5
Issue :
1
fYear :
1986
fDate :
1/1/1986 12:00:00 AM
Firstpage :
39
Lastpage :
51
Abstract :
Current understanding of the PLA folding problem is limited to simple empirical evidence from studies of heuristic methods. This paper presents a theoretical approach through an analytical and statistical analysis. The problem is first mapped into a set theoretic model. Using a random selection heuristic as a basis, a probability density function (PDF) is derived for the expected number of folds under a set of simplifying assumptions. This PDF is derived in terms of the three fundamental properties of a PLA, r the number of rows, c the number of columns, and d the density. Empirical results obtained from folding thousands of randomly generated PLA´s verify the accuracy of the derived probability density function. A technique is developed whereby the PDF can also be used to predict the size of optimal folding sets. A new folding heuristic is introduced which is shown to perform better than other heuristic algorithms in the literature, when applied to a set of randomly generated PLA´s. This is the first folding heuristic to have an analytical basis for its expected results, as derived from the PDF function.
Keywords :
Automatic control; Helium; Heuristic algorithms; Logic circuits; Logic design; Probability density function; Process design; Programmable logic arrays; Statistical analysis; Very large scale integration;
fLanguage :
English
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0278-0070
Type :
jour
DOI :
10.1109/TCAD.1986.1270176
Filename :
1270176
Link To Document :
بازگشت