DocumentCode
1277211
Title
Functional complexity estimation for large combinational circuits
Author
Aborhey, S.
Author_Institution
Dept. of Technol., Univ. of the South Pacific, Suva, Fiji
Volume
149
Issue
2
fYear
2002
fDate
3/1/2002 12:00:00 AM
Firstpage
39
Lastpage
45
Abstract
A disjoint cube-based method for the fast computation of M.G. Karpovsky´s (1976, 1977) functional complexity measure is presented. A modification to the method for generating a disjoint sum-of-cubes representation for a combinational system is also presented, which results in improved speed performance in the generation of disjoint sums of cubes. The proposed algorithms are tested on several benchmark circuits. The results obtained demonstrate the efficiency of the proposed algorithms
Keywords
circuit complexity; combinational circuits; software performance evaluation; algorithm efficiency; benchmark circuits; complexity measure; disjoint sum-of-cubes representation; functional complexity estimation; large combinational circuits; speed performance;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:20020379
Filename
997986
Link To Document