Finding the longest simple path in cyclic combinational circuits

Yaun chung Hsu, Shangzhi Sun, David H Du

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

An optimal algorithm to find the longest simple path in a cyclic combinatorial circuit is proposed. The approach first replaces cycles with matched sub-circuits and then compute the longest simple path of the expanded circuit. The matched sub-circuits are carefully constructed to preserve the path information of the original cyclic combinatorial circuit. The proposed algorithm has exponential time complexity in the worst case. Nevertheless, experimental results demonstrate the feasibility of the proposed algorithm.

Original languageEnglish (US)
Title of host publicationVLSI in Computers and Processors
PublisherIEEE
Pages530-535
Number of pages6
StatePublished - Dec 1 1998
EventProceedings of the 1998 IEEE International Conference on Computer Design - Austin, TX, USA
Duration: Oct 5 1998Oct 7 1998

Other

OtherProceedings of the 1998 IEEE International Conference on Computer Design
CityAustin, TX, USA
Period10/5/9810/7/98

Fingerprint Dive into the research topics of 'Finding the longest simple path in cyclic combinational circuits'. Together they form a unique fingerprint.

Cite this